YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:03:54,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:03:54,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:03:54,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:03:54,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:03:54,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:03:54,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:03:54,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:03:54,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:03:54,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:03:54,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:03:54,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:03:54,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:03:54,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:03:54,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:03:54,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:03:54,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:03:54,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:03:54,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:03:54,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:03:54,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:03:54,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:03:54,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:03:54,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:03:54,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:03:54,265 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:03:54,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:03:54,266 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:03:54,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:03:54,267 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:03:54,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:03:54,269 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:03:54,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:03:54,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:03:54,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:03:54,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:03:54,271 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:03:54,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:03:54,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:03:54,273 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:03:54,287 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:03:54,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:03:54,288 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:03:54,288 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:03:54,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:03:54,289 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:03:54,289 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:03:54,289 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:03:54,289 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:03:54,289 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:03:54,289 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:03:54,289 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:03:54,290 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:03:54,290 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:03:54,290 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:03:54,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:03:54,290 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:03:54,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:03:54,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:03:54,291 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:03:54,291 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:03:54,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:03:54,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:03:54,291 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:03:54,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:03:54,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:03:54,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:03:54,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:03:54,292 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:03:54,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:03:54,330 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:03:54,334 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:03:54,335 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:03:54,336 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:03:54,336 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:03:54,403 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9e81c856f43440038214134a9737900e/FLAG40219c442 [2020-06-22 10:03:54,741 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:03:54,741 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:03:54,742 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:03:54,748 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9e81c856f43440038214134a9737900e/FLAG40219c442 [2020-06-22 10:03:55,139 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9e81c856f43440038214134a9737900e [2020-06-22 10:03:55,150 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:03:55,152 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:03:55,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:03:55,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:03:55,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:03:55,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382e7333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55, skipping insertion in model container [2020-06-22 10:03:55,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:03:55,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:03:55,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:03:55,426 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:03:55,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:03:55,460 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:03:55,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55 WrapperNode [2020-06-22 10:03:55,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:03:55,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:03:55,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:03:55,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:03:55,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:03:55,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:03:55,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:03:55,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:03:55,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:03:55,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:03:55,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:03:55,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:03:55,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:03:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:03:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:03:55,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:03:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:03:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:03:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:03:55,795 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:03:55,795 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:03:55,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:55 BoogieIcfgContainer [2020-06-22 10:03:55,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:03:55,797 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:03:55,797 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:03:55,799 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:03:55,800 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,815 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 21 edges [2020-06-22 10:03:55,817 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:03:55,817 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:03:55,818 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:03:55,818 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:03:55,825 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:03:55,826 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:03:55,826 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:03:55,847 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:03:55,872 INFO L200 BlockEncoder]: SBE split 9 edges [2020-06-22 10:03:55,879 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:03:55,881 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:55,898 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 10:03:55,901 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states [2020-06-22 10:03:55,902 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:03:55,902 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:55,902 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:03:55,903 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:03:55,903 INFO L313 BlockEncoder]: Encoded RCFG 13 locations, 21 edges [2020-06-22 10:03:55,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:55 BasicIcfg [2020-06-22 10:03:55,904 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:03:55,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:03:55,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:03:55,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:03:55,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:03:55" (1/4) ... [2020-06-22 10:03:55,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fdd4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:03:55, skipping insertion in model container [2020-06-22 10:03:55,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (2/4) ... [2020-06-22 10:03:55,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fdd4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:03:55, skipping insertion in model container [2020-06-22 10:03:55,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:55" (3/4) ... [2020-06-22 10:03:55,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fdd4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:55, skipping insertion in model container [2020-06-22 10:03:55,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:55" (4/4) ... [2020-06-22 10:03:55,913 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:03:55,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:03:55,930 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-06-22 10:03:55,947 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-06-22 10:03:55,975 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:03:55,976 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:03:55,976 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:03:55,976 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:03:55,976 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:03:55,976 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:03:55,977 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:03:55,977 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:03:55,977 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:03:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-06-22 10:03:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:03:55,998 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:55,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:03:56,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash 3603045, now seen corresponding path program 1 times [2020-06-22 10:03:56,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,184 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2020-06-22 10:03:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,260 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2020-06-22 10:03:56,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:56,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:03:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,274 INFO L225 Difference]: With dead ends: 13 [2020-06-22 10:03:56,274 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 10:03:56,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 10:03:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 10:03:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:03:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2020-06-22 10:03:56,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 4 [2020-06-22 10:03:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,313 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-06-22 10:03:56,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 19 transitions. [2020-06-22 10:03:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:03:56,314 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:03:56,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 3603047, now seen corresponding path program 1 times [2020-06-22 10:03:56,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:56,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:56,348 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. Second operand 4 states. [2020-06-22 10:03:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,391 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-06-22 10:03:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:56,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 10:03:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,392 INFO L225 Difference]: With dead ends: 13 [2020-06-22 10:03:56,392 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 10:03:56,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 10:03:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 10:03:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:03:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-06-22 10:03:56,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 4 [2020-06-22 10:03:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,397 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 10:03:56,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2020-06-22 10:03:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:03:56,397 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:03:56,398 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 3603048, now seen corresponding path program 1 times [2020-06-22 10:03:56,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,431 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 3 states. [2020-06-22 10:03:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,462 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-06-22 10:03:56,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:56,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:03:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,463 INFO L225 Difference]: With dead ends: 12 [2020-06-22 10:03:56,463 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:03:56,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:03:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:03:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:03:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 10:03:56,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 [2020-06-22 10:03:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,467 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:03:56,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 10:03:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:56,467 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:56,468 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash 111695058, now seen corresponding path program 1 times [2020-06-22 10:03:56,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,509 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2020-06-22 10:03:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,538 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-06-22 10:03:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:56,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:03:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,539 INFO L225 Difference]: With dead ends: 11 [2020-06-22 10:03:56,539 INFO L226 Difference]: Without dead ends: 10 [2020-06-22 10:03:56,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-06-22 10:03:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 10:03:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:03:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-06-22 10:03:56,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 [2020-06-22 10:03:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,542 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-06-22 10:03:56,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-06-22 10:03:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:56,543 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:56,543 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash 111695060, now seen corresponding path program 1 times [2020-06-22 10:03:56,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:56,586 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 4 states. [2020-06-22 10:03:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,636 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-06-22 10:03:56,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:56,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:03:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,637 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:03:56,637 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:03:56,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:03:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2020-06-22 10:03:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:03:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 10:03:56,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 [2020-06-22 10:03:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,642 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:03:56,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 10:03:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:56,642 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:56,643 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash 111695061, now seen corresponding path program 1 times [2020-06-22 10:03:56,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:03:56,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:03:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:03:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:56,693 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 5 states. [2020-06-22 10:03:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,748 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-06-22 10:03:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:03:56,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-06-22 10:03:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,749 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:03:56,749 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 10:03:56,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:03:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 10:03:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2020-06-22 10:03:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:03:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-06-22 10:03:56,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 5 [2020-06-22 10:03:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,753 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 10:03:56,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:03:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-06-22 10:03:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:03:56,754 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:56,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash -35259792, now seen corresponding path program 1 times [2020-06-22 10:03:56,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,781 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2020-06-22 10:03:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,799 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-06-22 10:03:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:56,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:03:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,800 INFO L225 Difference]: With dead ends: 11 [2020-06-22 10:03:56,801 INFO L226 Difference]: Without dead ends: 9 [2020-06-22 10:03:56,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-06-22 10:03:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 10:03:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:03:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-06-22 10:03:56,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2020-06-22 10:03:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,804 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-06-22 10:03:56,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-06-22 10:03:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:03:56,804 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:56,805 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1093028459, now seen corresponding path program 1 times [2020-06-22 10:03:56,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:03:56,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:03:56,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:03:56,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:03:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:03:56,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 10:03:56,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:03:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:03:56,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:03:56,937 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2020-06-22 10:03:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,988 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-06-22 10:03:56,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:03:56,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 10:03:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,989 INFO L225 Difference]: With dead ends: 12 [2020-06-22 10:03:56,989 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:03:56,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:03:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:03:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-06-22 10:03:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:03:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-06-22 10:03:56,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 8 [2020-06-22 10:03:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,993 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-06-22 10:03:56,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:03:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-06-22 10:03:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:03:56,994 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:56,994 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1093028458, now seen corresponding path program 1 times [2020-06-22 10:03:56,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:03:57,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:03:57,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 10:03:57,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:03:57,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:03:57,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:03:57,247 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,248 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:03:57,248 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 10:03:57,293 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,294 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 10:03:57,298 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:03:57,315 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:03:57,321 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 10:03:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:03:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-06-22 10:03:57,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 10:03:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 10:03:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:03:57,411 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 11 states. [2020-06-22 10:03:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,638 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-06-22 10:03:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:03:57,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2020-06-22 10:03:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,640 INFO L225 Difference]: With dead ends: 13 [2020-06-22 10:03:57,640 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 10:03:57,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:03:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 10:03:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 10:03:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:03:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-06-22 10:03:57,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2020-06-22 10:03:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,644 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-06-22 10:03:57,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 10:03:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-06-22 10:03:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:03:57,645 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,646 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:03:57,646 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2030309685, now seen corresponding path program 2 times [2020-06-22 10:03:57,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:03:57,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:03:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:03:57,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:03:57,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:03:57,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 10:03:57,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:03:57,895 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:03:57,895 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:03:57,899 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:03:57,900 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 10:03:57,919 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:03:57,919 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:03:57,925 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,926 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:03:57,926 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 10:03:57,961 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 10:03:57,963 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:03:57,973 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:57,988 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:03:57,988 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 10:03:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:03:58,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:03:58,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-06-22 10:03:58,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 10:03:58,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 10:03:58,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:03:58,076 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-06-22 10:03:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,590 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-06-22 10:03:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 10:03:58,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-06-22 10:03:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,591 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:03:58,591 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:03:58,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-06-22 10:03:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:03:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-06-22 10:03:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:03:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-06-22 10:03:58,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2020-06-22 10:03:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,595 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-06-22 10:03:58,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 10:03:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-06-22 10:03:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:03:58,596 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,596 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,597 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 10:03:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1069539081, now seen corresponding path program 1 times [2020-06-22 10:03:58,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:03:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 10:03:58,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:03:58,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:03:58,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 10:03:58,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:03:58,734 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:03:58,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:03:58,739 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:58,740 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:03:58,740 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 10:03:58,749 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:03:58,749 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:03:58,751 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:58,751 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:03:58,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:03:58,765 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:58,766 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 10:03:58,767 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:03:58,777 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:03:58,777 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:03:58,778 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 10:03:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:58,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:03:58,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-06-22 10:03:58,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 10:03:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:03:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:03:58,834 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 9 states. [2020-06-22 10:03:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,920 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-06-22 10:03:58,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:03:58,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-06-22 10:03:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,924 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:03:58,924 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:03:58,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:03:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:03:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:03:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:03:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:03:58,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-06-22 10:03:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,926 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:03:58,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 10:03:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:03:58,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:03:58,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:03:59,083 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-06-22 10:03:59,086 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:03:59,086 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2020-06-22 10:03:59,086 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2020-06-22 10:03:59,086 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 16) no Hoare annotation was computed. [2020-06-22 10:03:59,086 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-06-22 10:03:59,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:59,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:59,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:03:59,087 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 15) no Hoare annotation was computed. [2020-06-22 10:03:59,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:03:59,087 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 14 15) no Hoare annotation was computed. [2020-06-22 10:03:59,088 INFO L444 ceAbstractionStarter]: At program point L14-4(lines 14 15) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_main_~length1~0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (.cse0 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse1 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse2 (= ULTIMATE.start_cstrlen_~str.base ULTIMATE.start_cstrlen_~s~0.base)) (.cse4 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse6 (= 1 (select |#valid| ULTIMATE.start_cstrlen_~s~0.base))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrlen_~s~0.base) (- 1))))))) (.cse3 (select |#length| ULTIMATE.start_cstrlen_~s~0.base))) (or (and (<= 1 ULTIMATE.start_cstrlen_~s~0.offset) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) .cse3) .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse4 .cse6 (= ULTIMATE.start_cstrlen_~s~0.offset 0) .cse7 (<= 1 .cse3)))) [2020-06-22 10:03:59,088 INFO L448 ceAbstractionStarter]: For program point L14-5(lines 14 15) no Hoare annotation was computed. [2020-06-22 10:03:59,088 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:03:59,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:03:59,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:03:59,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:03:59,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:03:59,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:03:59,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:59,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:59 BasicIcfg [2020-06-22 10:03:59,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:03:59,119 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:03:59,119 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:03:59,123 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:03:59,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:59,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:03:55" (1/5) ... [2020-06-22 10:03:59,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59ddec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:03:59, skipping insertion in model container [2020-06-22 10:03:59,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:59,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (2/5) ... [2020-06-22 10:03:59,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59ddec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:03:59, skipping insertion in model container [2020-06-22 10:03:59,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:59,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:55" (3/5) ... [2020-06-22 10:03:59,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59ddec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:03:59, skipping insertion in model container [2020-06-22 10:03:59,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:59,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:55" (4/5) ... [2020-06-22 10:03:59,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59ddec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:03:59, skipping insertion in model container [2020-06-22 10:03:59,126 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:59,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:59" (5/5) ... [2020-06-22 10:03:59,127 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:03:59,149 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:03:59,149 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:03:59,149 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:03:59,149 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:03:59,149 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:03:59,149 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:03:59,149 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:03:59,149 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:03:59,149 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:03:59,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-06-22 10:03:59,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:03:59,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:03:59,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:03:59,162 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:03:59,162 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:03:59,162 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:03:59,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-06-22 10:03:59,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:03:59,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:03:59,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:03:59,163 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:03:59,163 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:03:59,169 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue [88] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 8#L21true [47] L21-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 3#L21-2true [69] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc3.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_4|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc3.base_4| |v_#StackHeapBarrier_1|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 14#L25true [89] L25-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11))) (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~str.offset_2| v_ULTIMATE.start_cstrlen_~str.offset_4) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlen_~str.base_5 |v_ULTIMATE.start_cstrlen_#in~str.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlen_#in~str.offset_2|) (= (store |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8 (store (select |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11 (- 1)) 0)) |v_#memory_int_4|) (= v_ULTIMATE.start_cstrlen_~str.base_5 v_ULTIMATE.start_cstrlen_~s~0.base_11) (<= .cse0 (select |v_#length_7| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~str.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrlen_~s~0.offset_9 v_ULTIMATE.start_cstrlen_~str.offset_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstrlen_#in~str.base=|v_ULTIMATE.start_cstrlen_#in~str.base_2|, ULTIMATE.start_cstrlen_#t~pre0.base=|v_ULTIMATE.start_cstrlen_#t~pre0.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, ULTIMATE.start_cstrlen_#in~str.offset=|v_ULTIMATE.start_cstrlen_#in~str.offset_2|, ULTIMATE.start_cstrlen_~str.offset=v_ULTIMATE.start_cstrlen_~str.offset_4, ULTIMATE.start_cstrlen_#t~pre0.offset=|v_ULTIMATE.start_cstrlen_#t~pre0.offset_4|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_11, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_7|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_9, ULTIMATE.start_cstrlen_~str.base=v_ULTIMATE.start_cstrlen_~str.base_5, ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#in~str.base, ULTIMATE.start_cstrlen_#t~pre0.offset, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_cstrlen_#res, ULTIMATE.start_cstrlen_#t~pre0.base, #memory_int, ULTIMATE.start_cstrlen_#in~str.offset, ULTIMATE.start_cstrlen_~s~0.offset, ULTIMATE.start_cstrlen_~str.base, ULTIMATE.start_cstrlen_#t~mem1, ULTIMATE.start_cstrlen_~str.offset] 7#L14-4true [2020-06-22 10:03:59,169 INFO L796 eck$LassoCheckResult]: Loop: 7#L14-4true [43] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrlen_~s~0.offset_4) (<= (+ v_ULTIMATE.start_cstrlen_~s~0.offset_4 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~s~0.base_4)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrlen_~s~0.base_4)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~s~0.base_4) v_ULTIMATE.start_cstrlen_~s~0.offset_4) |v_ULTIMATE.start_cstrlen_#t~mem1_2|)) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_4, #length=|v_#length_5|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_4, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_4, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_4, ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem1] 12#L14-1true [78] L14-1-->L14-3: Formula: (> 0 |v_ULTIMATE.start_cstrlen_#t~mem1_6|) InVars {ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_6|} OutVars{ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem1] 10#L14-3true [50] L14-3-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrlen_~s~0.base_7 v_ULTIMATE.start_cstrlen_~s~0.base_8) (= v_ULTIMATE.start_cstrlen_~s~0.offset_6 (+ v_ULTIMATE.start_cstrlen_~s~0.offset_7 1))) InVars {ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_8, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_7} OutVars{ULTIMATE.start_cstrlen_#t~pre0.offset=|v_ULTIMATE.start_cstrlen_#t~pre0.offset_2|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_7, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_6, ULTIMATE.start_cstrlen_#t~pre0.base=|v_ULTIMATE.start_cstrlen_#t~pre0.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~pre0.offset, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_cstrlen_#t~pre0.base, ULTIMATE.start_cstrlen_~s~0.offset] 7#L14-4true [2020-06-22 10:03:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash 3592524, now seen corresponding path program 1 times [2020-06-22 10:03:59,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash 73582, now seen corresponding path program 1 times [2020-06-22 10:03:59,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,206 INFO L82 PathProgramCache]: Analyzing trace with hash -349256125, now seen corresponding path program 1 times [2020-06-22 10:03:59,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:59,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:59,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:03:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:03:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:03:59,362 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 6 states. [2020-06-22 10:03:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:59,462 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2020-06-22 10:03:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:03:59,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2020-06-22 10:03:59,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:03:59,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 9 transitions. [2020-06-22 10:03:59,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 10:03:59,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 10:03:59,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-06-22 10:03:59,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:03:59,468 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-22 10:03:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-06-22 10:03:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 10:03:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:03:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-06-22 10:03:59,470 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-22 10:03:59,470 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-22 10:03:59,471 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:03:59,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-06-22 10:03:59,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:03:59,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:03:59,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:03:59,471 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:03:59,472 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:03:59,472 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY [88] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 56#L21 [58] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 57#L21-2 [69] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc3.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_4|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc3.base_4| |v_#StackHeapBarrier_1|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 60#L25 [89] L25-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11))) (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~str.offset_2| v_ULTIMATE.start_cstrlen_~str.offset_4) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlen_~str.base_5 |v_ULTIMATE.start_cstrlen_#in~str.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlen_#in~str.offset_2|) (= (store |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8 (store (select |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11 (- 1)) 0)) |v_#memory_int_4|) (= v_ULTIMATE.start_cstrlen_~str.base_5 v_ULTIMATE.start_cstrlen_~s~0.base_11) (<= .cse0 (select |v_#length_7| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~str.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrlen_~s~0.offset_9 v_ULTIMATE.start_cstrlen_~str.offset_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstrlen_#in~str.base=|v_ULTIMATE.start_cstrlen_#in~str.base_2|, ULTIMATE.start_cstrlen_#t~pre0.base=|v_ULTIMATE.start_cstrlen_#t~pre0.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, ULTIMATE.start_cstrlen_#in~str.offset=|v_ULTIMATE.start_cstrlen_#in~str.offset_2|, ULTIMATE.start_cstrlen_~str.offset=v_ULTIMATE.start_cstrlen_~str.offset_4, ULTIMATE.start_cstrlen_#t~pre0.offset=|v_ULTIMATE.start_cstrlen_#t~pre0.offset_4|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_11, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_7|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_9, ULTIMATE.start_cstrlen_~str.base=v_ULTIMATE.start_cstrlen_~str.base_5, ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#in~str.base, ULTIMATE.start_cstrlen_#t~pre0.offset, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_cstrlen_#res, ULTIMATE.start_cstrlen_#t~pre0.base, #memory_int, ULTIMATE.start_cstrlen_#in~str.offset, ULTIMATE.start_cstrlen_~s~0.offset, ULTIMATE.start_cstrlen_~str.base, ULTIMATE.start_cstrlen_#t~mem1, ULTIMATE.start_cstrlen_~str.offset] 54#L14-4 [2020-06-22 10:03:59,472 INFO L796 eck$LassoCheckResult]: Loop: 54#L14-4 [43] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrlen_~s~0.offset_4) (<= (+ v_ULTIMATE.start_cstrlen_~s~0.offset_4 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~s~0.base_4)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrlen_~s~0.base_4)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~s~0.base_4) v_ULTIMATE.start_cstrlen_~s~0.offset_4) |v_ULTIMATE.start_cstrlen_#t~mem1_2|)) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_4, #length=|v_#length_5|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_4, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_4, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_4, ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem1] 55#L14-1 [78] L14-1-->L14-3: Formula: (> 0 |v_ULTIMATE.start_cstrlen_#t~mem1_6|) InVars {ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_6|} OutVars{ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem1] 59#L14-3 [50] L14-3-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrlen_~s~0.base_7 v_ULTIMATE.start_cstrlen_~s~0.base_8) (= v_ULTIMATE.start_cstrlen_~s~0.offset_6 (+ v_ULTIMATE.start_cstrlen_~s~0.offset_7 1))) InVars {ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_8, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_7} OutVars{ULTIMATE.start_cstrlen_#t~pre0.offset=|v_ULTIMATE.start_cstrlen_#t~pre0.offset_2|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_7, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_6, ULTIMATE.start_cstrlen_#t~pre0.base=|v_ULTIMATE.start_cstrlen_#t~pre0.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~pre0.offset, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_cstrlen_#t~pre0.base, ULTIMATE.start_cstrlen_~s~0.offset] 54#L14-4 [2020-06-22 10:03:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash 3603095, now seen corresponding path program 1 times [2020-06-22 10:03:59,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash 73582, now seen corresponding path program 2 times [2020-06-22 10:03:59,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash -34335464, now seen corresponding path program 1 times [2020-06-22 10:03:59,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:03:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:59,678 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:03:59,679 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:03:59,679 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:03:59,679 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:03:59,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:03:59,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:03:59,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:03:59,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:03:59,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:03:59,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:03:59,680 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:03:59,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:00,074 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:00,080 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:00,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:00,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:00,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:00,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:00,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:00,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:00,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:00,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:00,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:00,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:00,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:00,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:00,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:00,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:00,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:00,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:00,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:00,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:00,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:00,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:00,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:00,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:00,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:00,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:00,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:00,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:00,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:00,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:00,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:00,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:00,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:00,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:00,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:00,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:00,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:00,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:00,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:00,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:00,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:00,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:00,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:00,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:00,133 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:00,160 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:04:00,161 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:04:00,163 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:00,165 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:00,165 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:00,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_1, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_1 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2020-06-22 10:04:00,178 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:04:00,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:00,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:04:00,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:00,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:04:00,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:00,275 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:00,279 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-06-22 10:04:00,280 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-06-22 10:04:00,335 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2020-06-22 10:04:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:04:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-06-22 10:04:00,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 10:04:00,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:00,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 10:04:00,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:00,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 10:04:00,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:00,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2020-06-22 10:04:00,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:04:00,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2020-06-22 10:04:00,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:04:00,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:04:00,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:04:00,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:00,346 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:00,346 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:00,346 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:00,346 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:04:00,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:04:00,347 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:04:00,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:04:00,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:04:00 BasicIcfg [2020-06-22 10:04:00,353 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:04:00,353 INFO L168 Benchmark]: Toolchain (without parser) took 5202.51 ms. Allocated memory was 649.6 MB in the beginning and 769.7 MB in the end (delta: 120.1 MB). Free memory was 564.2 MB in the beginning and 679.4 MB in the end (delta: -115.3 MB). Peak memory consumption was 4.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,354 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:04:00,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.12 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 564.2 MB in the beginning and 656.8 MB in the end (delta: -92.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.68 ms. Allocated memory is still 693.1 MB. Free memory was 656.8 MB in the beginning and 654.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,356 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 693.1 MB. Free memory was 654.6 MB in the beginning and 652.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,356 INFO L168 Benchmark]: RCFGBuilder took 271.72 ms. Allocated memory is still 693.1 MB. Free memory was 652.5 MB in the beginning and 634.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,357 INFO L168 Benchmark]: BlockEncodingV2 took 107.11 ms. Allocated memory is still 693.1 MB. Free memory was 634.7 MB in the beginning and 628.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,357 INFO L168 Benchmark]: TraceAbstraction took 3213.85 ms. Allocated memory was 693.1 MB in the beginning and 756.0 MB in the end (delta: 62.9 MB). Free memory was 628.2 MB in the beginning and 535.4 MB in the end (delta: 92.8 MB). Peak memory consumption was 155.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:00,358 INFO L168 Benchmark]: BuchiAutomizer took 1233.65 ms. Allocated memory was 756.0 MB in the beginning and 769.7 MB in the end (delta: 13.6 MB). Free memory was 535.4 MB in the beginning and 679.4 MB in the end (delta: -144.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:04:00,362 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 19 locations, 21 edges - StatisticsResult: Encoded RCFG 13 locations, 21 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.12 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 564.2 MB in the beginning and 656.8 MB in the end (delta: -92.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.68 ms. Allocated memory is still 693.1 MB. Free memory was 656.8 MB in the beginning and 654.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.28 ms. Allocated memory is still 693.1 MB. Free memory was 654.6 MB in the beginning and 652.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 271.72 ms. Allocated memory is still 693.1 MB. Free memory was 652.5 MB in the beginning and 634.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 107.11 ms. Allocated memory is still 693.1 MB. Free memory was 634.7 MB in the beginning and 628.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3213.85 ms. Allocated memory was 693.1 MB in the beginning and 756.0 MB in the end (delta: 62.9 MB). Free memory was 628.2 MB in the beginning and 535.4 MB in the end (delta: 92.8 MB). Peak memory consumption was 155.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1233.65 ms. Allocated memory was 756.0 MB in the beginning and 769.7 MB in the end (delta: 13.6 MB). Free memory was 535.4 MB in the beginning and 679.4 MB in the end (delta: -144.1 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 10:04:00,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:04:00,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 <= s && 1 <= length1) && 1 == \valid[nondetString1]) && str == s) && s + 1 <= unknown-#length-unknown[s]) && nondetString1 == 0) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[s]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s] + -1])) || ((((((((length1 == unknown-#length-unknown[nondetString1] && 1 <= length1) && 1 == \valid[nondetString1]) && str == s) && nondetString1 == 0) && 1 == \valid[s]) && s == 0) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s] + -1])) && 1 <= unknown-#length-unknown[s]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 3.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 189 SDslu, 95 SDs, 0 SdLazy, 318 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 109 HoareAnnotationTreeSize, 1 FomulaSimplifications, 74 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 101 ConstructedInterpolants, 5 QuantifiedInterpolants, 7234 SizeOfPredicates, 25 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 10/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * s and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 53 SDslu, 48 SDs, 0 SdLazy, 118 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital111 mio100 ax100 hnf100 lsp94 ukn91 mio100 lsp46 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:03:51.925 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:04:00.626 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check