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/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:55:35,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:55:35,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:55:35,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:55:35,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:55:35,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:55:35,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:55:35,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:55:35,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:55:35,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:55:35,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:55:35,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:55:35,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:55:35,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:55:35,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:55:35,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:55:35,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:55:35,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:55:35,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:55:35,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:55:35,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:55:35,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:55:35,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:55:35,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:55:35,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:55:35,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:55:35,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:55:35,654 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:55:35,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:55:35,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:55:35,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:55:35,655 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:55:35,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:55:35,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:55:35,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:55:35,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:55:35,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:55:35,664 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:55:35,664 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:55:35,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:55:35,665 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:55:35,665 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:55:35,665 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:55:35,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:55:35,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:55:35,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:55:35,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:55:35,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:55:35,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:55:35,668 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:55:35,668 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:55:35,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:55:35,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:55:35,668 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:55:35,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:55:35,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:55:35,669 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:55:35,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:55:35,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:55:35,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:55:35,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:55:35,670 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:55:35,670 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:55:35,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:55:35,713 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:55:35,717 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:55:35,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:55:35,718 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:55:35,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-20 21:55:35,895 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:55:35,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:55:35,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:55:35,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:55:35,905 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:55:35,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:55:35" (1/1) ... [2018-01-20 21:55:35,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcefd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:35, skipping insertion in model container [2018-01-20 21:55:35,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:55:35" (1/1) ... [2018-01-20 21:55:35,923 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:55:35,963 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:55:36,079 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:55:36,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:55:36,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36 WrapperNode [2018-01-20 21:55:36,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:55:36,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:55:36,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:55:36,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:55:36,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (1/1) ... [2018-01-20 21:55:36,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:55:36,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:55:36,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:55:36,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:55:36,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55: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:55:36,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:55:36,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:55:36,185 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-20 21:55:36,185 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:55:36,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:55:36,185 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:55:36,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:55:36,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:55:36,186 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:55:36,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:55:36,186 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-20 21:55:36,186 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:55:36,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:55:36,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:55:36,416 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:55:36,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:55:36 BoogieIcfgContainer [2018-01-20 21:55:36,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:55:36,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:55:36,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:55:36,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:55:36,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:55:35" (1/3) ... [2018-01-20 21:55:36,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9ea276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:55:36, skipping insertion in model container [2018-01-20 21:55:36,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:36" (2/3) ... [2018-01-20 21:55:36,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9ea276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:55:36, skipping insertion in model container [2018-01-20 21:55:36,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:55:36" (3/3) ... [2018-01-20 21:55:36,422 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-20 21:55:36,429 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:55:36,435 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 21:55:36,481 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:36,481 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:36,481 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:36,481 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:36,482 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:36,482 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:36,482 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:36,482 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:55:36,483 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 21:55:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:55:36,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:36,513 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:55:36,513 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:55:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 147035, now seen corresponding path program 1 times [2018-01-20 21:55:36,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:36,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:36,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:36,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:36,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:36,629 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:55:36,635 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:36,641 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:36,641 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:36,641 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:36,641 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:36,641 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:36,641 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:36,641 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:36,641 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == lisErr0EnsuresViolation======== [2018-01-20 21:55:36,641 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 21:55:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 21:55:36,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:36,645 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] [2018-01-20 21:55:36,645 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr0EnsuresViolation]=== [2018-01-20 21:55:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -532715498, now seen corresponding path program 1 times [2018-01-20 21:55:36,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:36,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:36,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:36,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:36,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:36,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:36,730 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:55:36,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:36,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:55:36,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:55:36,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:55:36,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:55:36,827 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 21:55:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:36,848 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-20 21:55:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:55:36,850 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-20 21:55:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:36,862 INFO L225 Difference]: With dead ends: 109 [2018-01-20 21:55:36,863 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 21:55:36,866 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:55:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 21:55:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 21:55:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 21:55:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-20 21:55:36,902 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 26 [2018-01-20 21:55:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:36,902 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-20 21:55:36,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:55:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-20 21:55:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 21:55:36,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:36,903 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] [2018-01-20 21:55:36,903 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr0EnsuresViolation]=== [2018-01-20 21:55:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 200361856, now seen corresponding path program 1 times [2018-01-20 21:55:36,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:36,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:36,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:36,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:36,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:36,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:37,047 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:55:37,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:37,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 21:55:37,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 21:55:37,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 21:55:37,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:55:37,051 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2018-01-20 21:55:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:37,175 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-01-20 21:55:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 21:55:37,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-20 21:55:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:37,177 INFO L225 Difference]: With dead ends: 100 [2018-01-20 21:55:37,177 INFO L226 Difference]: Without dead ends: 66 [2018-01-20 21:55:37,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-20 21:55:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-20 21:55:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-01-20 21:55:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-20 21:55:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-20 21:55:37,186 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 29 [2018-01-20 21:55:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:37,187 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-20 21:55:37,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 21:55:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-20 21:55:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 21:55:37,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:37,189 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] [2018-01-20 21:55:37,189 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr0EnsuresViolation]=== [2018-01-20 21:55:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1926411264, now seen corresponding path program 1 times [2018-01-20 21:55:37,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:37,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:37,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:37,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:37,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:37,526 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:55:37,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:37,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 21:55:37,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:55:37,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:55:37,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:55:37,527 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 7 states. [2018-01-20 21:55:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:37,624 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-20 21:55:37,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:55:37,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-20 21:55:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:37,625 INFO L225 Difference]: With dead ends: 58 [2018-01-20 21:55:37,625 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:55:37,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:55:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:55:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:55:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:55:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:55:37,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-20 21:55:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:37,626 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:55:37,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:55:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:55:37,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:55:37,629 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:37,629 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:37,629 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:37,629 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:37,630 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:37,630 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:37,630 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:37,630 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:55:37,630 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 21:55:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 21:55:37,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:37,633 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:55:37,633 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash 925461465, now seen corresponding path program 1 times [2018-01-20 21:55:37,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:37,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:37,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:37,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:37,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:37,662 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:55:37,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:37,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:55:37,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:55:37,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:55:37,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:55:37,663 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 21:55:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:37,670 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-20 21:55:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:55:37,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-20 21:55:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:37,672 INFO L225 Difference]: With dead ends: 109 [2018-01-20 21:55:37,672 INFO L226 Difference]: Without dead ends: 61 [2018-01-20 21:55:37,673 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:55:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-20 21:55:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-20 21:55:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-20 21:55:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-20 21:55:37,680 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2018-01-20 21:55:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:37,680 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-20 21:55:37,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:55:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-20 21:55:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 21:55:37,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:37,682 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, 1, 1] [2018-01-20 21:55:37,683 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash -609533649, now seen corresponding path program 1 times [2018-01-20 21:55:37,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:37,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:37,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:37,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:37,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:37,758 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:55:37,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:37,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 21:55:37,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 21:55:37,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 21:55:37,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:55:37,759 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-01-20 21:55:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:37,891 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2018-01-20 21:55:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 21:55:37,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-20 21:55:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:37,892 INFO L225 Difference]: With dead ends: 128 [2018-01-20 21:55:37,892 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 21:55:37,893 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-20 21:55:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 21:55:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-01-20 21:55:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-20 21:55:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-01-20 21:55:37,898 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 36 [2018-01-20 21:55:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:37,899 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-01-20 21:55:37,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 21:55:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-01-20 21:55:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 21:55:37,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:37,900 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, 1, 1] [2018-01-20 21:55:37,900 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:37,900 INFO L82 PathProgramCache]: Analyzing trace with hash 355386543, now seen corresponding path program 1 times [2018-01-20 21:55:37,900 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:37,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:37,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:37,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:37,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:55:38,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:55:38,490 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:55:38,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:38,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:55:38,589 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-20 21:55:38,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 21:55:38,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:55:38,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:55:38,625 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-20 21:55:38,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-20 21:55:38,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-20 21:55:38,680 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 12 treesize of output 11 [2018-01-20 21:55:38,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-20 21:55:38,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-20 21:55:38,744 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-20 21:55:38,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 21:55:38,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-20 21:55:38,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-20 21:55:38,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-01-20 21:55:38,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-01-20 21:55:38,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:55:38,897 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-20 21:55:38,932 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-20 21:55:38,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:55:38,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2018-01-20 21:55:38,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-20 21:55:38,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-20 21:55:38,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-01-20 21:55:38,969 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 25 states. [2018-01-20 21:55:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:39,854 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2018-01-20 21:55:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-20 21:55:39,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-20 21:55:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:39,857 INFO L225 Difference]: With dead ends: 137 [2018-01-20 21:55:39,858 INFO L226 Difference]: Without dead ends: 116 [2018-01-20 21:55:39,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 21:55:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-20 21:55:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2018-01-20 21:55:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-20 21:55:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-01-20 21:55:39,871 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 46 [2018-01-20 21:55:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:39,871 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-01-20 21:55:39,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-20 21:55:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-01-20 21:55:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 21:55:39,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:39,873 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, 1, 1, 1, 1] [2018-01-20 21:55:39,873 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:39,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1901286964, now seen corresponding path program 1 times [2018-01-20 21:55:39,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:39,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:39,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:39,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:39,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:39,922 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:55:39,933 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:39,945 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:39,946 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:39,946 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:39,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:39,968 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:39,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:39,968 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:39,968 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:39,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:39,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:39,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:55:39,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 21:55:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 21:55:39,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:39,972 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:55:39,972 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:39,972 INFO L82 PathProgramCache]: Analyzing trace with hash 304873293, now seen corresponding path program 1 times [2018-01-20 21:55:39,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:39,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:39,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:39,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:39,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:39,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:39,989 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:55:39,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:39,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:55:39,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:55:39,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:55:39,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:55:39,990 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 21:55:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:39,994 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-20 21:55:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:55:39,994 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-20 21:55:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:39,995 INFO L225 Difference]: With dead ends: 109 [2018-01-20 21:55:39,995 INFO L226 Difference]: Without dead ends: 59 [2018-01-20 21:55:39,996 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:55:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-20 21:55:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-20 21:55:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-20 21:55:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-20 21:55:40,001 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 31 [2018-01-20 21:55:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:40,002 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-20 21:55:40,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:55:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-20 21:55:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 21:55:40,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:40,003 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:55:40,003 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash -894488029, now seen corresponding path program 1 times [2018-01-20 21:55:40,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:40,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:40,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:40,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:40,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:40,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:40,106 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:55:40,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:40,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 21:55:40,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 21:55:40,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 21:55:40,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:55:40,107 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-01-20 21:55:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:40,251 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-01-20 21:55:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 21:55:40,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-20 21:55:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:40,253 INFO L225 Difference]: With dead ends: 124 [2018-01-20 21:55:40,253 INFO L226 Difference]: Without dead ends: 71 [2018-01-20 21:55:40,254 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-20 21:55:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-20 21:55:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-01-20 21:55:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-20 21:55:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-20 21:55:40,260 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 34 [2018-01-20 21:55:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:40,261 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-20 21:55:40,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 21:55:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-20 21:55:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 21:55:40,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:40,262 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:55:40,262 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1371695709, now seen corresponding path program 1 times [2018-01-20 21:55:40,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:40,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:40,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:40,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:40,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:40,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:40,354 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:55:40,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:40,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:55:40,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:40,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:40,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:40,355 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2018-01-20 21:55:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:40,461 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-01-20 21:55:40,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:55:40,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-20 21:55:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:40,462 INFO L225 Difference]: With dead ends: 63 [2018-01-20 21:55:40,462 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:55:40,463 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-20 21:55:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:55:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:55:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:55:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:55:40,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-20 21:55:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:40,464 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:55:40,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:55:40,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:55:40,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:55:40 BoogieIcfgContainer [2018-01-20 21:55:40,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:55:40,468 INFO L168 Benchmark]: Toolchain (without parser) took 4572.91 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 260.8 MB in the beginning and 350.8 MB in the end (delta: -89.9 MB). Peak memory consumption was 124.5 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:40,469 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:55:40,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.12 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:40,470 INFO L168 Benchmark]: Boogie Preprocessor took 30.46 ms. Allocated memory is still 302.5 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:40,470 INFO L168 Benchmark]: RCFGBuilder took 280.50 ms. Allocated memory is still 302.5 MB. Free memory was 247.7 MB in the beginning and 228.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:40,471 INFO L168 Benchmark]: TraceAbstraction took 4050.12 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 227.1 MB in the beginning and 350.8 MB in the end (delta: -123.6 MB). Peak memory consumption was 90.8 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:40,472 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.16 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.12 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.46 ms. Allocated memory is still 302.5 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.50 ms. Allocated memory is still 302.5 MB. Free memory was 247.7 MB in the beginning and 228.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4050.12 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 227.1 MB in the beginning and 350.8 MB in the end (delta: -123.6 MB). Peak memory consumption was 90.8 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, 65 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=65occurred 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: lisErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 155 SDslu, 223 SDs, 0 SdLazy, 110 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 15645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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: [L557] int array_size = __VERIFIER_nondet_int(); [L558] COND FALSE !(array_size < 1 || array_size >= 2147483647 / sizeof(int)) VAL [array_size=1] [L561] EXPR, FCALL __builtin_alloca (array_size * sizeof(int)) VAL [__builtin_alloca (array_size * sizeof(int))={7:0}, array_size=1] [L561] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); VAL [__builtin_alloca (array_size * sizeof(int))={7:0}, array_size=1, numbers={7:0}] [L562] CALL, EXPR lis(numbers, array_size) VAL [\old(N)=1, a={7:0}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=1, a={7:0}, a={7:0}, max=0, N=1] [L543] EXPR, FCALL __builtin_alloca (sizeof(int) * N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, max=0, N=1] [L543] best = (int*) __builtin_alloca (sizeof(int) * N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, max=0, N=1] [L544] EXPR, FCALL __builtin_alloca (sizeof(int) * N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, max=0, N=1] [L544] prev = (int*) __builtin_alloca (sizeof(int) * N) [L545] i = 0 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, __builtin_alloca (sizeof(int) * N)={6:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L545] COND TRUE i < N VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, __builtin_alloca (sizeof(int) * N)={6:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, __builtin_alloca (sizeof(int) * N)={6:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L546] FCALL prev[i] = i VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L545] i++ VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L547] i = 1 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L547] COND FALSE !(i < N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L551] i = 0 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, __builtin_alloca (sizeof(int) * N)={6:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L551] COND TRUE i < N VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L552] EXPR, FCALL best[i] VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, best[i]=1, i=0, max=0, N=1, prev={6:0}] [L552] COND TRUE max < best[i] [L553] EXPR, FCALL best[i] VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, best[i]=1, i=0, max=0, N=1, prev={6:0}] [L553] max = best[i] [L551] i++ VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, __builtin_alloca (sizeof(int) * N)={6:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=1, N=1, prev={6:0}] [L551] COND FALSE !(i < N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=1, N=1, prev={6:0}] [L554] RET return max; VAL [\old(N)=1, \result=1, __builtin_alloca (sizeof(int) * N)={8:0}, __builtin_alloca (sizeof(int) * N)={6:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=1, N=1, prev={6:0}] [L562] EXPR lis(numbers, array_size) VAL [__builtin_alloca (array_size * sizeof(int))={7:0}, array_size=1, lis(numbers, array_size)=1, numbers={7:0}] [L562] return lis(numbers, array_size); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. UNSAFE Result, 2.3s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 631 SDslu, 620 SDs, 0 SdLazy, 570 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=3, 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, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 157 ConstructedInterpolants, 10 QuantifiedInterpolants, 39619 SizeOfPredicates, 10 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 556]: 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, 65 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 181 SDtfs, 177 SDslu, 221 SDs, 0 SdLazy, 102 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 7016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_21-55-40-481.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_21-55-40-481.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_21-55-40-481.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_21-55-40-481.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_21-55-40-481.csv Received shutdown request...