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/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:56:50,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:56:50,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:56:50,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:56:50,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:56:50,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:56:50,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:56:50,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:56:50,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:56:50,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:56:50,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:56:50,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:56:50,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:56:50,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:56:50,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:56:50,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:56:50,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:56:50,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:56:50,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:56:50,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:56:50,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:56:50,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:56:50,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:56:50,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:56:50,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:56:50,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:56:50,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:56:50,611 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:56:50,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:56:50,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:56:50,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:56:50,612 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-23 14:56:50,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:56:50,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:56:50,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:56:50,622 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:56:50,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:56:50,623 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:56:50,623 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:56:50,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:56:50,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:56:50,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:56:50,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:56:50,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:56:50,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:56:50,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:56:50,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:56:50,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:56:50,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:56:50,626 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:56:50,626 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:56:50,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:56:50,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:56:50,626 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:56:50,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:56:50,628 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:56:50,628 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:56:50,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:56:50,676 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:56:50,680 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:56:50,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:56:50,682 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:56:50,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:56:50,882 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:56:50,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:56:50,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:56:50,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:56:50,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:56:50,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:56:50" (1/1) ... [2018-01-23 14:56:50,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167329f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:50, skipping insertion in model container [2018-01-23 14:56:50,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:56:50" (1/1) ... [2018-01-23 14:56:50,918 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:56:50,961 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:56:51,072 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:56:51,091 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:56:51,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51 WrapperNode [2018-01-23 14:56:51,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:56:51,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:56:51,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:56:51,103 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:56:51,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (1/1) ... [2018-01-23 14:56:51,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:56:51,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:56:51,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:56:51,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:56:51,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (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-23 14:56:51,196 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:56:51,197 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:56:51,197 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:56:51,197 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:56:51,197 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:56:51,197 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:56:51,197 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:56:51,197 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:56:51,197 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:56:51,198 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:56:51,199 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:56:51,565 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:56:51,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:56:51 BoogieIcfgContainer [2018-01-23 14:56:51,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:56:51,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:56:51,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:56:51,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:56:51,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:56:50" (1/3) ... [2018-01-23 14:56:51,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bd672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:56:51, skipping insertion in model container [2018-01-23 14:56:51,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:56:51" (2/3) ... [2018-01-23 14:56:51,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bd672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:56:51, skipping insertion in model container [2018-01-23 14:56:51,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:56:51" (3/3) ... [2018-01-23 14:56:51,578 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:56:51,587 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:56:51,595 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:56:51,634 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:56:51,634 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:56:51,634 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:56:51,634 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:56:51,635 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:56:51,635 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:56:51,635 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:56:51,635 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:56:51,636 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:56:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-23 14:56:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:56:51,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:51,662 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:56:51,663 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:56:51,668 INFO L82 PathProgramCache]: Analyzing trace with hash 195400, now seen corresponding path program 1 times [2018-01-23 14:56:51,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:51,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:51,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:51,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:51,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:56:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:56:51,773 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:56:51,778 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:51,784 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:56:51,784 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:56:51,785 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:56:51,785 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:56:51,785 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:56:51,785 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:56:51,785 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:56:51,785 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:56:51,785 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:56:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-23 14:56:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:56:51,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:51,789 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] [2018-01-23 14:56:51,789 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash 499029481, now seen corresponding path program 1 times [2018-01-23 14:56:51,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:51,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:51,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:51,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:51,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:51,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:51,950 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-23 14:56:51,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:51,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:56:51,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:56:51,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:56:51,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:56:51,972 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-23 14:56:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:51,997 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-01-23 14:56:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:56:51,998 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-23 14:56:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:52,009 INFO L225 Difference]: With dead ends: 124 [2018-01-23 14:56:52,009 INFO L226 Difference]: Without dead ends: 81 [2018-01-23 14:56:52,012 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-23 14:56:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-23 14:56:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-23 14:56:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-23 14:56:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-23 14:56:52,056 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 23 [2018-01-23 14:56:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:52,057 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-23 14:56:52,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:56:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-23 14:56:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:56:52,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:52,058 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] [2018-01-23 14:56:52,058 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash -245872207, now seen corresponding path program 1 times [2018-01-23 14:56:52,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:52,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:52,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:52,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:52,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:52,165 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-23 14:56:52,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:52,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:56:52,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:56:52,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:56:52,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:56:52,168 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 5 states. [2018-01-23 14:56:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:52,365 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-01-23 14:56:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:56:52,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-23 14:56:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:52,371 INFO L225 Difference]: With dead ends: 141 [2018-01-23 14:56:52,371 INFO L226 Difference]: Without dead ends: 125 [2018-01-23 14:56:52,372 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:56:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-23 14:56:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-01-23 14:56:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-23 14:56:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-23 14:56:52,385 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 27 [2018-01-23 14:56:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:52,386 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-23 14:56:52,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:56:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-23 14:56:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:56:52,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:52,388 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-23 14:56:52,388 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash -130557319, now seen corresponding path program 1 times [2018-01-23 14:56:52,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:52,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:52,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:52,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:52,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:56:52,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:52,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:56:52,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:56:52,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:56:52,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:56:52,477 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-23 14:56:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:52,523 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-01-23 14:56:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:56:52,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-23 14:56:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:52,525 INFO L225 Difference]: With dead ends: 129 [2018-01-23 14:56:52,526 INFO L226 Difference]: Without dead ends: 90 [2018-01-23 14:56:52,527 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:56:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-23 14:56:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-01-23 14:56:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-23 14:56:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-23 14:56:52,535 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 48 [2018-01-23 14:56:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:52,535 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-23 14:56:52,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:56:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-23 14:56:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:56:52,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:52,538 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, 1, 1] [2018-01-23 14:56:52,538 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1094978108, now seen corresponding path program 1 times [2018-01-23 14:56:52,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:52,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:52,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:52,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:56:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:56:52,608 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:56:52,618 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:52,624 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:52,624 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:52,636 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:56:52,636 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:56:52,636 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:56:52,637 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:56:52,637 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:56:52,637 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:56:52,637 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:56:52,637 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:56:52,637 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:56:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-23 14:56:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-23 14:56:52,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:52,639 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] [2018-01-23 14:56:52,639 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1898919954, now seen corresponding path program 1 times [2018-01-23 14:56:52,640 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:52,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:52,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:52,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:52,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:52,665 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-23 14:56:52,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:52,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:56:52,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:56:52,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:56:52,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:56:52,666 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-23 14:56:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:52,672 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-01-23 14:56:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:56:52,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-23 14:56:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:52,674 INFO L225 Difference]: With dead ends: 124 [2018-01-23 14:56:52,674 INFO L226 Difference]: Without dead ends: 79 [2018-01-23 14:56:52,675 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-23 14:56:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-23 14:56:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-23 14:56:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:56:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-01-23 14:56:52,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 21 [2018-01-23 14:56:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:52,681 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-01-23 14:56:52,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:56:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-01-23 14:56:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:56:52,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:52,683 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] [2018-01-23 14:56:52,683 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1934937526, now seen corresponding path program 1 times [2018-01-23 14:56:52,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:52,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:52,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:52,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:52,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:52,753 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-23 14:56:52,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:52,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:56:52,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:56:52,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:56:52,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:56:52,754 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 5 states. [2018-01-23 14:56:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:52,922 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2018-01-23 14:56:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:56:52,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-23 14:56:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:52,925 INFO L225 Difference]: With dead ends: 137 [2018-01-23 14:56:52,925 INFO L226 Difference]: Without dead ends: 123 [2018-01-23 14:56:52,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:56:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-23 14:56:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2018-01-23 14:56:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-23 14:56:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-23 14:56:52,934 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 25 [2018-01-23 14:56:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:52,935 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-23 14:56:52,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:56:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-23 14:56:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:56:52,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:52,936 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-23 14:56:52,937 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1827795070, now seen corresponding path program 1 times [2018-01-23 14:56:52,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:52,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:52,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:52,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:52,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:56:52,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:52,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:56:52,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:56:52,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:56:52,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:56:52,996 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-01-23 14:56:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:53,032 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-01-23 14:56:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:56:53,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-23 14:56:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:53,034 INFO L225 Difference]: With dead ends: 125 [2018-01-23 14:56:53,034 INFO L226 Difference]: Without dead ends: 88 [2018-01-23 14:56:53,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:56:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-23 14:56:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-01-23 14:56:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-23 14:56:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-23 14:56:53,042 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2018-01-23 14:56:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:53,043 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-23 14:56:53,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:56:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-23 14:56:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:56:53,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:53,045 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-23 14:56:53,045 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1002255617, now seen corresponding path program 1 times [2018-01-23 14:56:53,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:53,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:53,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:53,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:53,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:53,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:56:53,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:53,248 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-23 14:56:53,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:53,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:53,590 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~head~5.base Int)) (and (= (store |c_old(#valid)| main_~head~5.base 0) |c_#valid|) (not (= 0 main_~head~5.base)) (= 0 (select |c_old(#valid)| main_~head~5.base)))) is different from true [2018-01-23 14:56:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-23 14:56:53,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:53,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-23 14:56:53,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:56:53,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:56:53,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-23 14:56:53,628 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 11 states. [2018-01-23 14:56:54,002 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 36 DAG size of output 18 [2018-01-23 14:56:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:54,270 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2018-01-23 14:56:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:56:54,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-01-23 14:56:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:54,271 INFO L225 Difference]: With dead ends: 159 [2018-01-23 14:56:54,271 INFO L226 Difference]: Without dead ends: 156 [2018-01-23 14:56:54,272 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2018-01-23 14:56:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-23 14:56:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 123. [2018-01-23 14:56:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-23 14:56:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-01-23 14:56:54,281 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 48 [2018-01-23 14:56:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:54,282 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-01-23 14:56:54,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:56:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-01-23 14:56:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:56:54,283 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:54,284 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, 1, 1, 1] [2018-01-23 14:56:54,284 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -485947440, now seen corresponding path program 1 times [2018-01-23 14:56:54,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:54,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:54,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:54,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:54,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:54,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:54,417 ERROR L119 erpolLogProxyWrapper]: Interpolant 35 not inductive: (Check returned sat) [2018-01-23 14:56:54,421 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-23 14:56:54,426 INFO L168 Benchmark]: Toolchain (without parser) took 3542.95 ms. Allocated memory was 303.6 MB in the beginning and 480.8 MB in the end (delta: 177.2 MB). Free memory was 260.3 MB in the beginning and 334.9 MB in the end (delta: -74.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:54,427 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:56:54,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.59 ms. Allocated memory is still 303.6 MB. Free memory was 260.3 MB in the beginning and 248.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:54,428 INFO L168 Benchmark]: Boogie Preprocessor took 41.13 ms. Allocated memory is still 303.6 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:54,428 INFO L168 Benchmark]: RCFGBuilder took 423.98 ms. Allocated memory is still 303.6 MB. Free memory was 246.4 MB in the beginning and 219.4 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:54,428 INFO L168 Benchmark]: TraceAbstraction took 2855.61 ms. Allocated memory was 303.6 MB in the beginning and 480.8 MB in the end (delta: 177.2 MB). Free memory was 219.4 MB in the beginning and 334.9 MB in the end (delta: -115.5 MB). Peak memory consumption was 61.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:54,430 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 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.59 ms. Allocated memory is still 303.6 MB. Free memory was 260.3 MB in the beginning and 248.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.13 ms. Allocated memory is still 303.6 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 423.98 ms. Allocated memory is still 303.6 MB. Free memory was 246.4 MB in the beginning and 219.4 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2855.61 ms. Allocated memory was 303.6 MB in the beginning and 480.8 MB in the end (delta: 177.2 MB). Free memory was 219.4 MB in the beginning and 334.9 MB in the end (delta: -115.5 MB). Peak memory consumption was 61.7 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) * 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 3 procedures, 84 locations, 3 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=84occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L985] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={18:0}] [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L986] FCALL head->next = ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L987] COND FALSE !(__VERIFIER_nondet_int()) [L987] COND TRUE __VERIFIER_nondet_int() [L987] FCALL head->data = 1 VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L987] FCALL head->opt = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L988] SLL* x = head; VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L994] COND TRUE x != ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L996] EXPR, FCALL x->data VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1] [L996] EXPR x->data == 2 && x->opt != x VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0] [L996] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L996] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L996] EXPR, FCALL x->opt VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={18:0}] [L996] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=1, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={18:0}] [L996] COND FALSE !(!((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x)) [L996] COND FALSE !(0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L997] EXPR, FCALL x->next VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->next={0:0}] [L997] x = x->next [L994] COND FALSE !(x != ((void*)0)) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1000] x = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1002] COND TRUE x != ((void*)0) [L1004] head = x VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1005] EXPR, FCALL x->next VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->next={0:0}] [L1005] x = x->next [L1006] EXPR, FCALL head->data VAL [head={18:0}, head->data=1, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1006] COND FALSE !(head->data == 2) [L1008] FCALL free(head) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1002] COND FALSE !(x != ((void*)0)) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1011] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 84 locations, 3 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 269 SDslu, 246 SDs, 0 SdLazy, 79 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 4555 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 - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-56-54-439.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-56-54-439.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-56-54-439.csv Received shutdown request...