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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/knapsack_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:54:35,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:54:35,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:54:35,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:54:35,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:54:35,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:54:35,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:54:35,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:54:35,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:54:35,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:54:35,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:54:35,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:54:35,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:54:35,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:54:35,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:54:35,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:54:35,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:54:35,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:54:35,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:54:35,598 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:54:35,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:54:35,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:54:35,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:54:35,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:54:35,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:54:35,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:54:35,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:54:35,605 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:54:35,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:54:35,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:54:35,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:54:35,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 21:54:35,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:54:35,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:54:35,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:54:35,616 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:54:35,616 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:54:35,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:54:35,617 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:54:35,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:54:35,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:54:35,617 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:54:35,617 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:54:35,618 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:54:35,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:54:35,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:54:35,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:54:35,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:54:35,619 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:54:35,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:54:35,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:54:35,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:54:35,620 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:54:35,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:54:35,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:54:35,620 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:54:35,621 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:54:35,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:54:35,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:54:35,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:54:35,622 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:54:35,622 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:54:35,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:54:35,663 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:54:35,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:54:35,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:54:35,668 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:54:35,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/knapsack_alloca_unsafe_false-valid-deref.i [2018-01-20 21:54:35,834 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:54:35,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:54:35,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:54:35,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:54:35,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:54:35,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:54:35" (1/1) ... [2018-01-20 21:54:35,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f014c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:35, skipping insertion in model container [2018-01-20 21:54:35,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:54:35" (1/1) ... [2018-01-20 21:54:35,864 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:54:35,903 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:54:36,028 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:54:36,052 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:54:36,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36 WrapperNode [2018-01-20 21:54:36,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:54:36,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:54:36,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:54:36,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:54:36,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (1/1) ... [2018-01-20 21:54:36,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:54:36,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:54:36,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:54:36,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:54:36,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (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-20 21:54:36,147 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:54:36,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:54:36,148 INFO L136 BoogieDeclarations]: Found implementation of procedure knapsack [2018-01-20 21:54:36,148 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:54:36,148 INFO L128 BoogieDeclarations]: Found specification of procedure knapsack [2018-01-20 21:54:36,149 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:54:36,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:54:36,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:54:36,393 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:54:36,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:54:36 BoogieIcfgContainer [2018-01-20 21:54:36,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:54:36,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:54:36,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:54:36,397 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:54:36,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:54:35" (1/3) ... [2018-01-20 21:54:36,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c4a1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:54:36, skipping insertion in model container [2018-01-20 21:54:36,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:36" (2/3) ... [2018-01-20 21:54:36,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c4a1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:54:36, skipping insertion in model container [2018-01-20 21:54:36,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:54:36" (3/3) ... [2018-01-20 21:54:36,400 INFO L105 eAbstractionObserver]: Analyzing ICFG knapsack_alloca_unsafe_false-valid-deref.i [2018-01-20 21:54:36,407 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:54:36,413 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 21:54:36,458 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:36,459 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:36,459 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:36,459 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:36,459 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:36,459 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:36,459 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:36,459 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:54:36,460 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 21:54:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:54:36,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:36,489 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:54:36,489 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:54:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-20 21:54:36,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:36,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:36,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:36,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:36,606 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:54:36,611 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:36,618 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:36,618 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:36,618 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:36,618 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:36,618 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:36,618 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:36,618 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:36,618 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == knapsackErr0EnsuresViolation======== [2018-01-20 21:54:36,618 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 21:54:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 21:54:36,621 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:36,621 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:36,621 INFO L371 AbstractCegarLoop]: === Iteration 1 === [knapsackErr0EnsuresViolation]=== [2018-01-20 21:54:36,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1365807540, now seen corresponding path program 1 times [2018-01-20 21:54:36,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:36,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:36,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:36,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:36,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:36,712 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-20 21:54:36,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:36,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:36,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:36,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:36,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:36,733 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-20 21:54:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:36,829 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-20 21:54:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:36,830 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 21:54:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:36,836 INFO L225 Difference]: With dead ends: 92 [2018-01-20 21:54:36,836 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:54:36,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:54:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:54:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:54:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:54:36,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-20 21:54:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:36,861 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:54:36,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:54:36,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:54:36,864 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:36,864 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:36,864 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:36,864 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:36,865 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:36,865 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:36,865 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:36,865 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:54:36,865 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 21:54:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 21:54:36,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:36,869 INFO L322 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, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:36,870 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1369908330, now seen corresponding path program 1 times [2018-01-20 21:54:36,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:36,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:36,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:36,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:36,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:36,928 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-20 21:54:36,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:36,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:36,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:36,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:36,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:36,930 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-20 21:54:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:36,936 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-20 21:54:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:36,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-20 21:54:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:36,940 INFO L225 Difference]: With dead ends: 92 [2018-01-20 21:54:36,940 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 21:54:36,941 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 21:54:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-20 21:54:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 21:54:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-20 21:54:36,954 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 33 [2018-01-20 21:54:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:36,955 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-20 21:54:36,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-20 21:54:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 21:54:36,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:36,957 INFO L322 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:36,957 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1841804872, now seen corresponding path program 1 times [2018-01-20 21:54:36,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:36,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:36,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:36,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:36,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:37,099 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-20 21:54:37,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:37,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:54:37,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:54:37,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:54:37,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:54:37,102 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-20 21:54:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:37,239 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-20 21:54:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:54:37,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-20 21:54:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:37,241 INFO L225 Difference]: With dead ends: 86 [2018-01-20 21:54:37,242 INFO L226 Difference]: Without dead ends: 71 [2018-01-20 21:54:37,243 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:54:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-20 21:54:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-01-20 21:54:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 21:54:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-20 21:54:37,250 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2018-01-20 21:54:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:37,251 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-20 21:54:37,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:54:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-20 21:54:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 21:54:37,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:37,252 INFO L322 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] [2018-01-20 21:54:37,252 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1329272689, now seen corresponding path program 1 times [2018-01-20 21:54:37,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:37,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:37,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:37,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:37,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:37,387 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-20 21:54:37,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:37,387 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:37,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:37,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:37,497 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-20 21:54:37,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:37,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-20 21:54:37,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:54:37,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:54:37,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:54:37,524 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 7 states. [2018-01-20 21:54:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:37,704 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2018-01-20 21:54:37,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 21:54:37,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-20 21:54:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:37,706 INFO L225 Difference]: With dead ends: 125 [2018-01-20 21:54:37,707 INFO L226 Difference]: Without dead ends: 70 [2018-01-20 21:54:37,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:54:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-20 21:54:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-01-20 21:54:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 21:54:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-20 21:54:37,716 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 39 [2018-01-20 21:54:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:37,716 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-20 21:54:37,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:54:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-20 21:54:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 21:54:37,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:37,718 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-20 21:54:37,718 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -604724168, now seen corresponding path program 1 times [2018-01-20 21:54:37,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:37,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:37,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:37,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:37,784 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:54:37,799 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:37,808 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:37,811 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:37,811 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:37,828 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:37,828 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:37,828 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:37,828 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:37,828 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:37,829 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:37,829 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:37,829 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:54:37,829 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 21:54:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 21:54:37,831 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:37,831 INFO L322 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, 1, 1, 1, 1] [2018-01-20 21:54:37,831 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2039412068, now seen corresponding path program 1 times [2018-01-20 21:54:37,831 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:37,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:37,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:37,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:37,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:37,856 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-20 21:54:37,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:37,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:37,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:37,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:37,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:37,857 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-20 21:54:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:37,862 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-20 21:54:37,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:37,863 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-20 21:54:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:37,864 INFO L225 Difference]: With dead ends: 92 [2018-01-20 21:54:37,864 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 21:54:37,864 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 21:54:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-20 21:54:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 21:54:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-20 21:54:37,870 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 31 [2018-01-20 21:54:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:37,870 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-20 21:54:37,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-20 21:54:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:37,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:37,872 INFO L322 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, 1, 1, 1, 1, 1] [2018-01-20 21:54:37,872 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash 976853310, now seen corresponding path program 1 times [2018-01-20 21:54:37,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:37,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:37,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:37,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:37,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:37,948 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-20 21:54:37,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:37,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:54:37,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:54:37,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:54:37,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:54:37,949 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-20 21:54:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:38,050 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-01-20 21:54:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:54:38,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-20 21:54:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:38,051 INFO L225 Difference]: With dead ends: 82 [2018-01-20 21:54:38,051 INFO L226 Difference]: Without dead ends: 69 [2018-01-20 21:54:38,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:54:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-20 21:54:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-01-20 21:54:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 21:54:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-20 21:54:38,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 32 [2018-01-20 21:54:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:38,057 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-20 21:54:38,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:54:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-20 21:54:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:54:38,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:38,059 INFO L322 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-20 21:54:38,059 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash -935460395, now seen corresponding path program 1 times [2018-01-20 21:54:38,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:38,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:38,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:38,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:38,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:38,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:38,159 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-20 21:54:38,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:38,160 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:38,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:38,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:38,270 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-20 21:54:38,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:38,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-20 21:54:38,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:54:38,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:54:38,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:54:38,304 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2018-01-20 21:54:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:38,466 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-01-20 21:54:38,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 21:54:38,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-20 21:54:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:38,468 INFO L225 Difference]: With dead ends: 121 [2018-01-20 21:54:38,468 INFO L226 Difference]: Without dead ends: 68 [2018-01-20 21:54:38,468 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:54:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-20 21:54:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-01-20 21:54:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 21:54:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-20 21:54:38,473 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 37 [2018-01-20 21:54:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:38,473 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-20 21:54:38,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:54:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-20 21:54:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 21:54:38,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:38,474 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-20 21:54:38,475 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1001745474, now seen corresponding path program 1 times [2018-01-20 21:54:38,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:38,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:38,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:38,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:38,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:38,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 21:54:39,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:39,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-20 21:54:39,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 21:54:39,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 21:54:39,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-20 21:54:39,256 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 10 states. [2018-01-20 21:54:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:39,516 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-20 21:54:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-20 21:54:39,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-20 21:54:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:39,517 INFO L225 Difference]: With dead ends: 54 [2018-01-20 21:54:39,517 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:54:39,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-20 21:54:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:54:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:54:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:54:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:54:39,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-01-20 21:54:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:39,519 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:54:39,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 21:54:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:54:39,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:54:39,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:54:39 BoogieIcfgContainer [2018-01-20 21:54:39,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:54:39,523 INFO L168 Benchmark]: Toolchain (without parser) took 3688.17 ms. Allocated memory was 303.6 MB in the beginning and 519.0 MB in the end (delta: 215.5 MB). Free memory was 263.5 MB in the beginning and 428.0 MB in the end (delta: -164.5 MB). Peak memory consumption was 51.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:39,525 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:54:39,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.70 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:39,526 INFO L168 Benchmark]: Boogie Preprocessor took 39.12 ms. Allocated memory is still 303.6 MB. Free memory was 252.5 MB in the beginning and 250.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:39,526 INFO L168 Benchmark]: RCFGBuilder took 294.18 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 230.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:39,526 INFO L168 Benchmark]: TraceAbstraction took 3126.89 ms. Allocated memory was 303.6 MB in the beginning and 519.0 MB in the end (delta: 215.5 MB). Free memory was 230.4 MB in the beginning and 428.0 MB in the end (delta: -197.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:39,528 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.20 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.70 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.12 ms. Allocated memory is still 303.6 MB. Free memory was 252.5 MB in the beginning and 250.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 294.18 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 230.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3126.89 ms. Allocated memory was 303.6 MB in the beginning and 519.0 MB in the end (delta: 215.5 MB). Free memory was 230.4 MB in the beginning and 428.0 MB in the end (delta: -197.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: knapsackErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) VAL [M=0, N=1] [L560] COND TRUE M < 1 [L561] M = 1 VAL [M=1, N=1] [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) VAL [__builtin_alloca (N * sizeof(int))={6:0}, M=1, N=1] [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); VAL [__builtin_alloca (N * sizeof(int))={6:0}, M=1, N=1, size={6:0}] [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) VAL [__builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, M=1, N=1, size={6:0}] [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); VAL [__builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, M=1, N=1, size={6:0}, val={10:0}] [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, M=1, N=1, size={6:0}, val={10:0}] [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) VAL [__builtin_alloca (M * sizeof(int))={7:0}, __builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); VAL [__builtin_alloca (M * sizeof(int))={7:0}, __builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, best={7:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L567] CALL knapsack(size, val, N, cost, best, M) VAL [\old(M)=1, \old(N)=1, best={7:0}, cost={8:0}, size={6:0}, val={10:0}] [L542] int i, j; [L543] j = 1 VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L543] COND TRUE j <= N [L544] i = 1 VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=1, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L544] COND TRUE i <= M VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=1, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L545] EXPR, FCALL size[j] VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=1, j=1, M=1, N=1, size={6:0}, size={6:0}, size[j]=2, val={10:0}, val={10:0}] [L545] COND FALSE !(i >= size[j]) [L544] i++ VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L544] COND FALSE !(i <= M) VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L543] j++ VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=2, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L543] COND FALSE, RET !(j <= N) VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=2, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L567] knapsack(size, val, N, cost, best, M) VAL [__builtin_alloca (M * sizeof(int))={7:0}, __builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, best={7:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L568] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 SDtfs, 147 SDslu, 273 SDs, 0 SdLazy, 133 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 9533 SizeOfPredicates, 3 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. SAFE Result, 1.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 174 SDslu, 313 SDs, 0 SdLazy, 469 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 28458 SizeOfPredicates, 3 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_21-54-39-539.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_21-54-39-539.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_21-54-39-539.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_21-54-39-539.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_21-54-39-539.csv Received shutdown request...