java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:42:32,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:42:32,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:42:32,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:42:32,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:42:32,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:42:32,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:42:32,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:42:32,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:42:32,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:42:32,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:42:32,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:42:32,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:42:32,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:42:32,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:42:32,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:42:32,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:42:32,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:42:32,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:42:32,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:42:32,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:42:32,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:42:32,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:42:32,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:42:32,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:42:32,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:42:32,603 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:42:32,603 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:42:32,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:42:32,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:42:32,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:42:32,605 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:42:32,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:42:32,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:42:32,614 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:42:32,614 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:42:32,614 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:42:32,615 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:42:32,615 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:42:32,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:42:32,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:42:32,615 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:42:32,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:42:32,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:42:32,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:42:32,617 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:42:32,617 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:42:32,617 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:42:32,617 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:42:32,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:42:32,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:42:32,618 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:42:32,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:42:32,618 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:42:32,618 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:42:32,618 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:42:32,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:42:32,619 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:42:32,619 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:42:32,619 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:42:32,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:42:32,663 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:42:32,665 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:42:32,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:42:32,667 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:42:32,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:42:32,822 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:42:32,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:42:32,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:42:32,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:42:32,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:42:32,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:42:32" (1/1) ... [2018-01-29 22:42:32,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3909789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:32, skipping insertion in model container [2018-01-29 22:42:32,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:42:32" (1/1) ... [2018-01-29 22:42:32,851 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:42:32,888 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:42:33,011 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:42:33,029 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:42:33,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33 WrapperNode [2018-01-29 22:42:33,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:42:33,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:42:33,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:42:33,039 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:42:33,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... [2018-01-29 22:42:33,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:42:33,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:42:33,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:42:33,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:42:33,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:42:33,127 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:42:33,127 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:42:33,128 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:42:33,128 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:42:33,128 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:42:33,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:42:33,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:42:33,128 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:42:33,129 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:42:33,129 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:42:33,129 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:42:33,129 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:42:33,359 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:42:33,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:42:33 BoogieIcfgContainer [2018-01-29 22:42:33,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:42:33,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:42:33,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:42:33,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:42:33,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:42:32" (1/3) ... [2018-01-29 22:42:33,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e086c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:42:33, skipping insertion in model container [2018-01-29 22:42:33,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:33" (2/3) ... [2018-01-29 22:42:33,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e086c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:42:33, skipping insertion in model container [2018-01-29 22:42:33,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:42:33" (3/3) ... [2018-01-29 22:42:33,368 INFO L107 eAbstractionObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:42:33,375 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:42:33,382 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-29 22:42:33,422 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:42:33,422 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:42:33,423 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:42:33,423 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:42:33,423 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:42:33,423 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:42:33,423 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:42:33,423 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:42:33,424 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:42:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-29 22:42:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:42:33,449 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:33,450 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:33,451 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1056340414, now seen corresponding path program 1 times [2018-01-29 22:42:33,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:33,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:33,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:33,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:33,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:33,548 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:33,548 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:33,548 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:33,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:33,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:33,652 INFO L477 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 [2018-01-29 22:42:33,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:33,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:33,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:42:33,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-01-29 22:42:33,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:33,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:42:33,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-29 22:42:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:33,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:33,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:42:33,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:42:33,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:42:33,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:42:33,883 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 4 states. [2018-01-29 22:42:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:34,013 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-01-29 22:42:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:42:34,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-29 22:42:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:34,028 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:42:34,029 INFO L226 Difference]: Without dead ends: 57 [2018-01-29 22:42:34,033 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:42:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-29 22:42:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-29 22:42:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-29 22:42:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-29 22:42:34,079 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 26 [2018-01-29 22:42:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:34,079 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-29 22:42:34,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:42:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-29 22:42:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:42:34,081 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:34,081 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:34,081 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1056340415, now seen corresponding path program 1 times [2018-01-29 22:42:34,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:34,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:34,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:34,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,094 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:34,094 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:34,094 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:34,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:34,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:34,148 INFO L477 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 [2018-01-29 22:42:34,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:34,161 INFO L477 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 8 treesize of output 7 [2018-01-29 22:42:34,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:34,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:34,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-29 22:42:34,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:34,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:34,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:42:34,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:34,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-29 22:42:34,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:34,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 22:42:34,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-01-29 22:42:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:34,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:34,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:42:34,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:42:34,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:42:34,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:42:34,393 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-01-29 22:42:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:34,745 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-29 22:42:34,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:42:34,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-29 22:42:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:34,747 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:42:34,747 INFO L226 Difference]: Without dead ends: 64 [2018-01-29 22:42:34,748 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:42:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-29 22:42:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-29 22:42:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-29 22:42:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-29 22:42:34,758 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 26 [2018-01-29 22:42:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:34,758 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-29 22:42:34,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:42:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-29 22:42:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 22:42:34,760 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:34,760 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:34,760 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1471240260, now seen corresponding path program 1 times [2018-01-29 22:42:34,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:34,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:34,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:34,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,771 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:34,771 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:34,771 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-01-29 22:42:34,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:34,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:34,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:34,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:42:34,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:42:34,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:42:34,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:42:34,873 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-29 22:42:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:34,981 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-01-29 22:42:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:42:34,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-29 22:42:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:34,983 INFO L225 Difference]: With dead ends: 63 [2018-01-29 22:42:34,983 INFO L226 Difference]: Without dead ends: 56 [2018-01-29 22:42:34,983 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:42:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-29 22:42:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-29 22:42:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-29 22:42:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-29 22:42:34,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 27 [2018-01-29 22:42:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:34,993 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-29 22:42:34,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:42:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-29 22:42:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 22:42:34,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:34,995 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:34,995 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash 920975272, now seen corresponding path program 1 times [2018-01-29 22:42:34,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:34,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:34,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:34,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,008 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:35,008 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:35,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:35,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:35,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:35,052 INFO L477 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 [2018-01-29 22:42:35,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:35,059 INFO L477 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 8 treesize of output 7 [2018-01-29 22:42:35,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:35,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:35,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-29 22:42:35,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:35,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-29 22:42:35,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:35,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:35,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:35,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:42:35,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:35,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:42:35,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2018-01-29 22:42:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:35,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:42:35,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-01-29 22:42:35,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:42:35,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:42:35,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:42:35,296 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 9 states. [2018-01-29 22:42:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:37,264 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-01-29 22:42:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:42:37,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-29 22:42:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:37,266 INFO L225 Difference]: With dead ends: 59 [2018-01-29 22:42:37,266 INFO L226 Difference]: Without dead ends: 58 [2018-01-29 22:42:37,266 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:42:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-29 22:42:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-01-29 22:42:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-29 22:42:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-29 22:42:37,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 34 [2018-01-29 22:42:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:37,275 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-29 22:42:37,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:42:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-29 22:42:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 22:42:37,276 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:37,276 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:37,277 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash 292498666, now seen corresponding path program 1 times [2018-01-29 22:42:37,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:37,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:37,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,288 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:37,288 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:37,288 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:37,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:37,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:37,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:42:37,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-01-29 22:42:37,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:42:37,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:42:37,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:42:37,411 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 10 states. [2018-01-29 22:42:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:37,637 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-29 22:42:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 22:42:37,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-01-29 22:42:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:37,638 INFO L225 Difference]: With dead ends: 85 [2018-01-29 22:42:37,638 INFO L226 Difference]: Without dead ends: 84 [2018-01-29 22:42:37,639 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:42:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-29 22:42:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-01-29 22:42:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 22:42:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-29 22:42:37,651 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 36 [2018-01-29 22:42:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:37,652 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-29 22:42:37,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:42:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-29 22:42:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 22:42:37,653 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:37,653 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:37,653 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 477524069, now seen corresponding path program 1 times [2018-01-29 22:42:37,654 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:37,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:37,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,664 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:37,664 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:37,664 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:37,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:37,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:37,712 INFO L477 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 [2018-01-29 22:42:37,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:37,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:37,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:42:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:42:37,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:37,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:42:37,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:42:37,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:42:37,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:42:37,754 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 4 states. [2018-01-29 22:42:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:37,789 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-01-29 22:42:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:42:37,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-29 22:42:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:37,790 INFO L225 Difference]: With dead ends: 70 [2018-01-29 22:42:37,790 INFO L226 Difference]: Without dead ends: 69 [2018-01-29 22:42:37,791 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:42:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-29 22:42:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-29 22:42:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-29 22:42:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-29 22:42:37,798 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 37 [2018-01-29 22:42:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:37,799 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-29 22:42:37,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:42:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-29 22:42:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 22:42:37,800 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:37,800 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:37,800 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash 477524070, now seen corresponding path program 1 times [2018-01-29 22:42:37,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:37,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:37,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,808 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:37,809 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:37,809 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:37,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:37,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:37,846 INFO L477 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 10 treesize of output 9 [2018-01-29 22:42:37,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:37,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:37,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-29 22:42:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:42:37,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:37,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:42:37,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:42:37,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:42:37,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:42:37,914 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-01-29 22:42:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:38,066 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-29 22:42:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:42:38,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-29 22:42:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:38,068 INFO L225 Difference]: With dead ends: 86 [2018-01-29 22:42:38,068 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:42:38,068 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:42:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:42:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-01-29 22:42:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-29 22:42:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-29 22:42:38,083 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 37 [2018-01-29 22:42:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:38,083 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-29 22:42:38,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:42:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-29 22:42:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:42:38,084 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:38,084 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:38,084 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash -802558749, now seen corresponding path program 1 times [2018-01-29 22:42:38,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:38,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:38,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:38,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:38,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:38,093 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:38,093 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:38,093 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:38,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:38,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:38,166 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc2.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc2.base| 1))) (and (= |c_#valid| (store (store .cse0 |c_main_#t~malloc3.base| 1) |main_#t~malloc2.base| 0)) (= (select |c_old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |c_main_#t~malloc3.base|) 0)))) is different from true [2018-01-29 22:42:38,172 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc2.base| Int) (|main_#t~malloc3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc2.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc3.base| 1) |main_#t~malloc2.base| 0) |main_#t~malloc3.base| 0)) (= (select |c_old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |main_#t~malloc3.base|) 0)))) is different from true [2018-01-29 22:42:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:42:38,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:38,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:42:38,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:42:38,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:42:38,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=15, Unknown=2, NotChecked=14, Total=42 [2018-01-29 22:42:38,215 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 7 states. [2018-01-29 22:42:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:38,263 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-01-29 22:42:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:42:38,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-29 22:42:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:38,265 INFO L225 Difference]: With dead ends: 77 [2018-01-29 22:42:38,265 INFO L226 Difference]: Without dead ends: 70 [2018-01-29 22:42:38,265 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=15, Unknown=2, NotChecked=14, Total=42 [2018-01-29 22:42:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-29 22:42:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-29 22:42:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 22:42:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-29 22:42:38,280 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 41 [2018-01-29 22:42:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:38,280 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-29 22:42:38,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:42:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-29 22:42:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 22:42:38,281 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:38,282 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:38,282 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1488184429, now seen corresponding path program 2 times [2018-01-29 22:42:38,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:38,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:38,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:38,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:38,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:38,290 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:38,291 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:38,291 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:38,299 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:42:38,314 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:42:38,318 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:42:38,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:38,345 INFO L477 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 [2018-01-29 22:42:38,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,359 INFO L477 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 8 treesize of output 7 [2018-01-29 22:42:38,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-29 22:42:38,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:38,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:38,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:42:38,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-29 22:42:38,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:42:38,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-01-29 22:42:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 22:42:38,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:38,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:42:38,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:42:38,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:42:38,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:42:38,578 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2018-01-29 22:42:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:38,733 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-29 22:42:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:42:38,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-01-29 22:42:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:38,734 INFO L225 Difference]: With dead ends: 70 [2018-01-29 22:42:38,734 INFO L226 Difference]: Without dead ends: 69 [2018-01-29 22:42:38,735 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:42:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-29 22:42:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2018-01-29 22:42:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-29 22:42:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-29 22:42:38,743 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44 [2018-01-29 22:42:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:38,744 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-29 22:42:38,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:42:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-29 22:42:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:42:38,745 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:38,745 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:38,745 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:42:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2109076177, now seen corresponding path program 1 times [2018-01-29 22:42:38,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:38,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:38,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:38,747 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:42:38,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:38,754 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 22:42:38,754 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 22:42:38,755 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 22:42:38,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:38,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:38,784 INFO L477 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 10 treesize of output 9 [2018-01-29 22:42:38,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:38,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-29 22:42:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:42:38,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:42:38,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-01-29 22:42:38,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:42:38,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:42:38,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:42:38,898 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 8 states. [2018-01-29 22:42:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:39,076 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-29 22:42:39,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:42:39,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-29 22:42:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:39,076 INFO L225 Difference]: With dead ends: 51 [2018-01-29 22:42:39,076 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:42:39,077 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:42:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:42:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:42:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:42:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:42:39,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-29 22:42:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:39,078 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:42:39,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:42:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:42:39,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:42:39,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:42:39,521 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-01-29 22:42:41,809 WARN L146 SmtUtils]: Spent 2286ms on a formula simplification. DAG size of input: 70 DAG size of output 61 [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 556) the Hoare annotation is: true [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 556) the Hoare annotation is: true [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:42:41,812 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L552'''(line 552) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-29 22:42:41,813 INFO L399 ceAbstractionStarter]: For program point L552''(lines 552 554) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L549'''(lines 549 551) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L549''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-29 22:42:41,814 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 540 556) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 540 556) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 540 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L552''''''(lines 552 554) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L552''''(line 552) no Hoare annotation was computed. [2018-01-29 22:42:41,815 INFO L395 ceAbstractionStarter]: At program point L552'''''(lines 552 554) the Hoare annotation is: (let ((.cse0 (store |old(#valid)| |main_#t~malloc2.base| 1)) (.cse1 (* (* main_~length~2 main_~fac~2) 4)) (.cse2 (* 4 main_~length~2))) (and (= (select |#valid| main_~arr~2.base) 1) (<= main_~length~2 main_~i~2) (= main_~arr2~2.offset 0) (= |#valid| (store .cse0 |main_#t~malloc3.base| 1)) (not (= |main_#t~malloc2.base| 0)) (= 0 main_~arr~2.offset) (not (= main_~arr~2.base 0)) (= 0 |main_#t~malloc2.offset|) (= |main_#t~malloc3.offset| 0) (= (select |#length| main_~arr2~2.base) .cse1) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |main_#t~malloc3.base|) 0) (= 1 (select |#valid| main_~arr2~2.base)) (= (select |#length| main_~arr~2.base) .cse2) (= (select |#length| |main_#t~malloc3.base|) .cse1) (<= 0 main_~j~2) (exists ((|main_#t~malloc3.base| Int) (main_~length~2 Int) (main_~fac~2 Int)) (and (not (= main_~arr~2.base |main_#t~malloc3.base|)) (= (select |#length| main_~arr~2.base) (* 4 main_~length~2)) (= (select |#length| |main_#t~malloc3.base|) (* (* main_~length~2 main_~fac~2) 4)) (<= 1 main_~length~2))) (not (= |main_#t~malloc3.base| 0)) (= (select |#length| |main_#t~malloc2.base|) .cse2) (not (= main_~arr2~2.base 0)))) [2018-01-29 22:42:41,815 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L549'''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point mainErr6EnsuresViolation(lines 540 556) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L549'''''''(lines 549 551) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L552(lines 552 554) no Hoare annotation was computed. [2018-01-29 22:42:41,816 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-29 22:42:41,817 INFO L395 ceAbstractionStarter]: At program point L549''''''(lines 549 551) the Hoare annotation is: (let ((.cse18 (* 4 main_~length~2)) (.cse19 (* (* main_~length~2 main_~fac~2) 4)) (.cse20 (store |old(#valid)| |main_#t~malloc2.base| 1))) (let ((.cse0 (= (select |#valid| main_~arr~2.base) 1)) (.cse1 (= main_~arr2~2.offset 0)) (.cse2 (= |#valid| (store .cse20 |main_#t~malloc3.base| 1))) (.cse3 (= 0 |main_#t~malloc2.offset|)) (.cse4 (= |main_#t~malloc3.offset| 0)) (.cse5 (= (select |#length| main_~arr2~2.base) .cse19)) (.cse6 (not (= |main_#t~malloc3.base| 0))) (.cse7 (not (= |main_#t~malloc2.base| 0))) (.cse8 (= 0 main_~arr~2.offset)) (.cse9 (not (= main_~arr~2.base 0))) (.cse10 (= (select |old(#valid)| |main_#t~malloc2.base|) 0)) (.cse11 (= (select .cse20 |main_#t~malloc3.base|) 0)) (.cse12 (= 1 (select |#valid| main_~arr2~2.base))) (.cse13 (= (select |#length| main_~arr~2.base) .cse18)) (.cse14 (= (select |#length| |main_#t~malloc3.base|) .cse19)) (.cse15 (exists ((|main_#t~malloc3.base| Int) (main_~length~2 Int) (main_~fac~2 Int)) (and (not (= main_~arr~2.base |main_#t~malloc3.base|)) (= (select |#length| main_~arr~2.base) (* 4 main_~length~2)) (= (select |#length| |main_#t~malloc3.base|) (* (* main_~length~2 main_~fac~2) 4)) (<= 1 main_~length~2)))) (.cse16 (= (select |#length| |main_#t~malloc2.base|) .cse18)) (.cse17 (not (= main_~arr2~2.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 main_~i~2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~2 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2018-01-29 22:42:41,817 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-29 22:42:41,817 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-29 22:42:41,817 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-29 22:42:41,817 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-29 22:42:41,817 INFO L399 ceAbstractionStarter]: For program point L549'(lines 549 551) no Hoare annotation was computed. [2018-01-29 22:42:41,817 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-29 22:42:41,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,831 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,831 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,844 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,844 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,844 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,844 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,844 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,844 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,849 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,856 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:42:41 BoogieIcfgContainer [2018-01-29 22:42:41,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:42:41,859 INFO L168 Benchmark]: Toolchain (without parser) took 9036.59 ms. Allocated memory was 306.7 MB in the beginning and 513.8 MB in the end (delta: 207.1 MB). Free memory was 265.7 MB in the beginning and 340.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 132.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:41,861 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:42:41,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.68 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:41,861 INFO L168 Benchmark]: Boogie Preprocessor took 37.24 ms. Allocated memory is still 306.7 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:41,862 INFO L168 Benchmark]: RCFGBuilder took 283.79 ms. Allocated memory is still 306.7 MB. Free memory was 253.8 MB in the beginning and 235.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:41,862 INFO L168 Benchmark]: TraceAbstraction took 8497.14 ms. Allocated memory was 306.7 MB in the beginning and 513.8 MB in the end (delta: 207.1 MB). Free memory was 235.2 MB in the beginning and 340.2 MB in the end (delta: -105.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:41,864 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.68 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.24 ms. Allocated memory is still 306.7 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.79 ms. Allocated memory is still 306.7 MB. Free memory was 253.8 MB in the beginning and 235.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8497.14 ms. Allocated memory was 306.7 MB in the beginning and 513.8 MB in the end (delta: 207.1 MB). Free memory was 235.2 MB in the beginning and 340.2 MB in the end (delta: -105.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,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 #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 #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 #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 #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 #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 #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 #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 552]: Loop Invariant [2018-01-29 22:42:41,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((\valid[arr] == 1 && length <= i) && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && 0 <= j) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0) - InvariantResult [Line: 549]: Loop Invariant [2018-01-29 22:42:41,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,885 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,885 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,887 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,889 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,889 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,889 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-29 22:42:41,889 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,890 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-29 22:42:41,890 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-29 22:42:41,890 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,890 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,891 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,891 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,891 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,891 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,891 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,892 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,892 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,892 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,892 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:41,892 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((\valid[arr] == 1 && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && 1 <= i) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0)) || ((((((((((((((((((\valid[arr] == 1 && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && i == 0) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 62 locations, 7 error locations. SAFE Result, 8.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 411 SDtfs, 814 SDslu, 803 SDs, 0 SdLazy, 582 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 375 HoareAnnotationTreeSize, 6 FomulaSimplifications, 583 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 270 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 353 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 343 ConstructedInterpolants, 55 QuantifiedInterpolants, 125506 SizeOfPredicates, 41 NumberOfNonLiveVariables, 884 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 24/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-42-41-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-42-41-898.csv Received shutdown request...