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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:42:00,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:42:00,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:42:00,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:42:00,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:42:00,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:42:00,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:42:00,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:42:00,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:42:00,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:42:00,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:42:00,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:42:00,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:42:00,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:42:00,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:42:00,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:42:00,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:42:00,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:42:00,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:42:00,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:42:00,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:42:00,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:42:00,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:42:00,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:42:00,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:42:00,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:42:00,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:42:00,603 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:42:00,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:42:00,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:42:00,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:42:00,604 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:42:00,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:42:00,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:42:00,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:42:00,615 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:42:00,615 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:42:00,616 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:42:00,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:42:00,616 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:42:00,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:42:00,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:42:00,617 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:42:00,617 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:42:00,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:42:00,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:42:00,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:42:00,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:42:00,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:42:00,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:42:00,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:42:00,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:42:00,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:42:00,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:42:00,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:42:00,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:42:00,620 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:42:00,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:42:00,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:00,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:42:00,620 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:42:00,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:42:00,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:42:00,621 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:42:00,621 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:42:00,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:42:00,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:42:00,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:42:00,622 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:42:00,623 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:42:00,623 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:42:00,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:42:00,670 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:42:00,673 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:42:00,675 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:42:00,675 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:42:00,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-01-21 00:42:00,861 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:42:00,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:42:00,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:00,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:42:00,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:42:00,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:00" (1/1) ... [2018-01-21 00:42:00,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41741684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:00, skipping insertion in model container [2018-01-21 00:42:00,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:00" (1/1) ... [2018-01-21 00:42:00,896 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:00,939 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:01,071 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:01,100 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:01,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01 WrapperNode [2018-01-21 00:42:01,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:01,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:42:01,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:42:01,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:42:01,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (1/1) ... [2018-01-21 00:42:01,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:42:01,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:42:01,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:42:01,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:42:01,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (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-21 00:42:01,211 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:42:01,211 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:42:01,212 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-01-21 00:42:01,212 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-01-21 00:42:01,212 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 00:42:01,212 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:42:01,212 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:42:01,212 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:42:01,212 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:42:01,213 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:42:01,213 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:42:01,213 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:42:01,213 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:42:01,213 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:42:01,213 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:42:01,214 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:42:01,777 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:42:01,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:01 BoogieIcfgContainer [2018-01-21 00:42:01,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:42:01,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:42:01,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:42:01,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:42:01,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:42:00" (1/3) ... [2018-01-21 00:42:01,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467c7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:01, skipping insertion in model container [2018-01-21 00:42:01,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:01" (2/3) ... [2018-01-21 00:42:01,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467c7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:01, skipping insertion in model container [2018-01-21 00:42:01,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:01" (3/3) ... [2018-01-21 00:42:01,789 INFO L105 eAbstractionObserver]: Analyzing ICFG split_list_test05_true-valid-memsafety.i [2018-01-21 00:42:01,797 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:42:01,804 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 00:42:01,844 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:01,844 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:01,844 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:01,844 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:01,844 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:01,844 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:01,844 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:01,845 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:42:01,845 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-01-21 00:42:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:42:01,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:01,871 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:42:01,871 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:42:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 425556, now seen corresponding path program 1 times [2018-01-21 00:42:01,876 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:01,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:01,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:01,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:01,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:01,967 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:01,973 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:01,981 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:01,981 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:01,982 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:02,001 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:02,001 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:02,001 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:02,001 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:02,002 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == containsHeadErr0EnsuresViolation======== [2018-01-21 00:42:02,002 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-01-21 00:42:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-01-21 00:42:02,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:02,029 INFO L322 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:42:02,029 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr0EnsuresViolation]=== [2018-01-21 00:42:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1454005036, now seen corresponding path program 1 times [2018-01-21 00:42:02,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:02,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:02,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:02,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-01-21 00:42:02,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:02,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:02,407 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:02,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:02,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:02,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:02,420 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 2 states. [2018-01-21 00:42:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:02,460 INFO L93 Difference]: Finished difference Result 383 states and 479 transitions. [2018-01-21 00:42:02,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:02,461 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 213 [2018-01-21 00:42:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:02,467 INFO L225 Difference]: With dead ends: 383 [2018-01-21 00:42:02,467 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:02,473 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-21 00:42:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:02,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2018-01-21 00:42:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:02,493 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:02,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:02,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:02,495 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:02,496 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:02,496 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:02,496 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:02,496 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:02,496 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:02,496 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:02,496 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == containsBodyErr0EnsuresViolation======== [2018-01-21 00:42:02,496 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-01-21 00:42:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-01-21 00:42:02,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:02,508 INFO L322 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:42:02,508 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsBodyErr0EnsuresViolation]=== [2018-01-21 00:42:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2074036853, now seen corresponding path program 1 times [2018-01-21 00:42:02,508 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:02,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:02,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:02,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-01-21 00:42:02,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:02,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:02,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:02,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:02,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:02,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:02,701 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 2 states. [2018-01-21 00:42:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:02,717 INFO L93 Difference]: Finished difference Result 383 states and 479 transitions. [2018-01-21 00:42:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:02,717 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 216 [2018-01-21 00:42:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:02,717 INFO L225 Difference]: With dead ends: 383 [2018-01-21 00:42:02,717 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:02,719 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-21 00:42:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:02,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-01-21 00:42:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:02,721 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:02,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:02,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:02,722 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:02,722 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:02,722 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:02,723 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:02,723 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:02,723 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:02,723 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:02,723 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:42:02,723 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-01-21 00:42:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-21 00:42:02,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:02,729 INFO L322 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:42:02,729 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1555624233, now seen corresponding path program 1 times [2018-01-21 00:42:02,730 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:02,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:02,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,731 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:02,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-01-21 00:42:02,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:02,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:02,877 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:02,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:02,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:02,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:02,878 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 2 states. [2018-01-21 00:42:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:02,893 INFO L93 Difference]: Finished difference Result 383 states and 479 transitions. [2018-01-21 00:42:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:02,893 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 209 [2018-01-21 00:42:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:02,901 INFO L225 Difference]: With dead ends: 383 [2018-01-21 00:42:02,901 INFO L226 Difference]: Without dead ends: 192 [2018-01-21 00:42:02,902 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-21 00:42:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-21 00:42:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-01-21 00:42:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-21 00:42:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2018-01-21 00:42:02,932 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 209 [2018-01-21 00:42:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:02,933 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2018-01-21 00:42:02,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2018-01-21 00:42:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-01-21 00:42:02,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:02,940 INFO L322 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:42:02,940 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash -258479386, now seen corresponding path program 1 times [2018-01-21 00:42:02,941 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:02,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:02,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:02,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:02,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2018-01-21 00:42:03,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:42:03,160 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:42:03,161 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-01-21 00:42:03,164 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [10], [12], [21], [23], [33], [35], [46], [48], [60], [62], [63], [65], [66], [67], [68], [69], [73], [77], [81], [89], [92], [107], [111], [115], [123], [126], [141], [145], [149], [157], [160], [166], [167], [168], [169], [173], [176], [179], [189], [193], [196], [210], [213], [216], [226], [230], [233], [247], [251], [261], [262], [263], [265], [266], [268], [269], [270], [278], [280], [289], [291], [301], [303], [314], [316], [328], [330], [331], [336], [337], [338], [339], [340], [341], [342], [349], [353], [354], [355], [356], [357], [367], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406] [2018-01-21 00:42:03,230 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:42:03,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:42:03,424 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:42:03,425 INFO L268 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 40 variables. [2018-01-21 00:42:03,432 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:42:03,670 INFO L232 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 53.47% of their original sizes. [2018-01-21 00:42:03,671 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:42:04,040 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:42:04,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:42:04,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [3] total 19 [2018-01-21 00:42:04,041 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:04,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 00:42:04,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 00:42:04,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:42:04,044 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand 18 states. [2018-01-21 00:42:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:05,729 INFO L93 Difference]: Finished difference Result 221 states and 262 transitions. [2018-01-21 00:42:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:42:05,729 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 305 [2018-01-21 00:42:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:05,730 INFO L225 Difference]: With dead ends: 221 [2018-01-21 00:42:05,730 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:05,732 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 317 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2018-01-21 00:42:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:05,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2018-01-21 00:42:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:05,733 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:05,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 00:42:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:05,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:05,735 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:05,735 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:05,736 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:05,736 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:05,736 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:05,736 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:05,736 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:05,736 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:42:05,736 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-01-21 00:42:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-01-21 00:42:05,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:05,740 INFO L322 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:42:05,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2031898526, now seen corresponding path program 1 times [2018-01-21 00:42:05,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:05,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:05,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:05,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:05,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:05,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-01-21 00:42:05,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:05,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:05,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:05,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:05,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:05,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:05,820 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 2 states. [2018-01-21 00:42:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:05,831 INFO L93 Difference]: Finished difference Result 383 states and 479 transitions. [2018-01-21 00:42:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:05,831 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 207 [2018-01-21 00:42:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:05,833 INFO L225 Difference]: With dead ends: 383 [2018-01-21 00:42:05,834 INFO L226 Difference]: Without dead ends: 190 [2018-01-21 00:42:05,835 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-21 00:42:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-21 00:42:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-01-21 00:42:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-21 00:42:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2018-01-21 00:42:05,850 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 207 [2018-01-21 00:42:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:05,850 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2018-01-21 00:42:05,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-01-21 00:42:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-21 00:42:05,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:05,852 INFO L322 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:42:05,852 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:05,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1438835565, now seen corresponding path program 1 times [2018-01-21 00:42:05,853 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:05,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:05,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:05,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:05,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:05,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2018-01-21 00:42:05,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:42:05,965 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:42:05,966 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-01-21 00:42:05,966 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [10], [12], [21], [23], [33], [35], [46], [48], [60], [62], [63], [65], [66], [67], [68], [69], [73], [77], [81], [89], [92], [107], [111], [115], [123], [126], [141], [145], [149], [157], [160], [166], [167], [168], [169], [173], [176], [179], [189], [193], [196], [210], [213], [216], [226], [230], [233], [247], [251], [261], [262], [264], [265], [266], [268], [269], [270], [278], [280], [289], [291], [301], [303], [314], [316], [328], [330], [331], [337], [338], [339], [340], [341], [342], [349], [353], [354], [355], [356], [357], [367], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403], [404], [405] [2018-01-21 00:42:05,969 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:42:05,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:42:06,010 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:42:06,011 INFO L268 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 40 variables. [2018-01-21 00:42:06,019 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:42:06,145 INFO L232 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 53.47% of their original sizes. [2018-01-21 00:42:06,145 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:42:06,439 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:42:06,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:42:06,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [3] total 19 [2018-01-21 00:42:06,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:06,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 00:42:06,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 00:42:06,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:42:06,441 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand 18 states. [2018-01-21 00:42:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:08,460 INFO L93 Difference]: Finished difference Result 219 states and 260 transitions. [2018-01-21 00:42:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:42:08,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 303 [2018-01-21 00:42:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:08,461 INFO L225 Difference]: With dead ends: 219 [2018-01-21 00:42:08,461 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:08,462 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 315 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2018-01-21 00:42:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:08,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2018-01-21 00:42:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:08,463 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:08,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 00:42:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:08,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:08,465 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:08,465 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:08,465 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:08,465 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:08,465 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:08,465 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:08,466 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:08,466 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 00:42:08,466 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-01-21 00:42:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:42:08,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:08,468 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-21 00:42:08,469 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 00:42:08,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1646960005, now seen corresponding path program 1 times [2018-01-21 00:42:08,469 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:08,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:08,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:08,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:08,470 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:08,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:08,481 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-21 00:42:08,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:08,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:08,482 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:08,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:08,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:08,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:08,482 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 2 states. [2018-01-21 00:42:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:08,495 INFO L93 Difference]: Finished difference Result 383 states and 479 transitions. [2018-01-21 00:42:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:08,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 00:42:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:08,496 INFO L225 Difference]: With dead ends: 383 [2018-01-21 00:42:08,496 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 00:42:08,497 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-21 00:42:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 00:42:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-21 00:42:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-21 00:42:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2018-01-21 00:42:08,505 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 25 [2018-01-21 00:42:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:08,505 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2018-01-21 00:42:08,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2018-01-21 00:42:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:42:08,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:08,506 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-21 00:42:08,506 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-21 00:42:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1878605164, now seen corresponding path program 1 times [2018-01-21 00:42:08,506 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:08,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:08,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:08,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:08,508 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:08,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:08,550 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-21 00:42:08,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:08,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:42:08,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:08,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:42:08,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:42:08,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:08,551 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 3 states. [2018-01-21 00:42:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:08,574 INFO L93 Difference]: Finished difference Result 121 states and 179 transitions. [2018-01-21 00:42:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:42:08,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-21 00:42:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:08,576 INFO L225 Difference]: With dead ends: 121 [2018-01-21 00:42:08,576 INFO L226 Difference]: Without dead ends: 66 [2018-01-21 00:42:08,577 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-21 00:42:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-21 00:42:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-21 00:42:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2018-01-21 00:42:08,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 27 [2018-01-21 00:42:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:08,584 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2018-01-21 00:42:08,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:42:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2018-01-21 00:42:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:42:08,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:08,585 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-21 00:42:08,585 INFO L371 AbstractCegarLoop]: === Iteration 3 === [appendErr0EnsuresViolation]=== [2018-01-21 00:42:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 190058321, now seen corresponding path program 1 times [2018-01-21 00:42:08,585 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:08,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:08,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:08,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:08,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:08,628 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:08,633 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:08,637 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:08,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:42:08 BoogieIcfgContainer [2018-01-21 00:42:08,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:42:08,650 INFO L168 Benchmark]: Toolchain (without parser) took 7788.07 ms. Allocated memory was 303.0 MB in the beginning and 679.0 MB in the end (delta: 375.9 MB). Free memory was 261.4 MB in the beginning and 334.4 MB in the end (delta: -73.1 MB). Peak memory consumption was 302.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:08,650 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:42:08,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.35 ms. Allocated memory is still 303.0 MB. Free memory was 260.3 MB in the beginning and 248.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:08,651 INFO L168 Benchmark]: Boogie Preprocessor took 48.77 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 245.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:08,651 INFO L168 Benchmark]: RCFGBuilder took 615.42 ms. Allocated memory is still 303.0 MB. Free memory was 245.3 MB in the beginning and 197.2 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:08,651 INFO L168 Benchmark]: TraceAbstraction took 6868.70 ms. Allocated memory was 303.0 MB in the beginning and 679.0 MB in the end (delta: 375.9 MB). Free memory was 197.2 MB in the beginning and 334.4 MB in the end (delta: -137.2 MB). Peak memory consumption was 238.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:08,653 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.35 ms. Allocated memory is still 303.0 MB. Free memory was 260.3 MB in the beginning and 248.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.77 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 245.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 615.42 ms. Allocated memory is still 303.0 MB. Free memory was 245.3 MB in the beginning and 197.2 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6868.70 ms. Allocated memory was 303.0 MB in the beginning and 679.0 MB in the end (delta: 375.9 MB). Free memory was 197.2 MB in the beginning and 334.4 MB in the end (delta: -137.2 MB). Peak memory consumption was 238.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 231 LocStat_NO_SUPPORTING_DISEQUALITIES : 102 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.606023 RENAME_VARIABLES(MILLISECONDS) : 0.876200 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.553924 PROJECTAWAY(MILLISECONDS) : 0.053510 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001708 DISJOIN(MILLISECONDS) : 1.398764 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.930717 ADD_EQUALITY(MILLISECONDS) : 0.035599 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013934 #CONJOIN_DISJUNCTIVE : 46 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 231 LocStat_NO_SUPPORTING_DISEQUALITIES : 102 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.164695 RENAME_VARIABLES(MILLISECONDS) : 0.279184 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.146069 PROJECTAWAY(MILLISECONDS) : 0.028240 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000642 DISJOIN(MILLISECONDS) : 1.090546 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.302471 ADD_EQUALITY(MILLISECONDS) : 0.019806 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004596 #CONJOIN_DISJUNCTIVE : 46 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 58 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * 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) * 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 6 procedures, 198 locations, 6 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=198occurred 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: 539]: 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: containsHeadErr0EnsuresViolation CFG has 6 procedures, 198 locations, 6 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 12 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 44944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 543]: 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: containsBodyErr0EnsuresViolation CFG has 6 procedures, 198 locations, 6 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 12 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 46225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: 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: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 198 locations, 6 error locations. SAFE Result, 3.0s OverallTime, 2 OverallIterations, 15 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 245 SDtfs, 96 SDslu, 47 SDs, 0 SdLazy, 185 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 319 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9945788993428311 AbsIntWeakeningRatio, 1.2664473684210527 AbsIntAvgWeakeningVarsNumRemoved, 0.3519736842105263 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 135984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2296/2394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 562]: 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 6 procedures, 198 locations, 6 error locations. SAFE Result, 2.7s OverallTime, 2 OverallIterations, 15 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 245 SDtfs, 93 SDslu, 60 SDs, 0 SdLazy, 235 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 317 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred 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, 1 AbstIntIterations, 1 AbstIntStrong, 0.9945429980139757 AbsIntWeakeningRatio, 1.271523178807947 AbsIntAvgWeakeningVarsNumRemoved, 0.3543046357615894 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 133942 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2296/2394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 547]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) VAL [malloc(sizeof *list)={16:0}] [L563] struct list_t *list = malloc(sizeof *list); VAL [list={16:0}, malloc(sizeof *list)={16:0}] [L564] FCALL list->first = ((void *)0) VAL [list={16:0}, malloc(sizeof *list)={16:0}] [L565] FCALL list->last = ((void *)0) VAL [list={16:0}, malloc(sizeof *list)={16:0}] [L566] char userInput; VAL [list={16:0}, malloc(sizeof *list)={16:0}] [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) VAL [list={16:0}, malloc(sizeof *list)={16:0}, userInput=0] [L572] CALL append(list, userInput) VAL [\old(input)=0, head={16:0}] [L548] EXPR, FCALL malloc(sizeof *node) VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}] [L548] struct node_t *node = malloc(sizeof *node); VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L549] FCALL node->data = input VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L550] EXPR, FCALL head->first VAL [\old(input)=0, head={16:0}, head={16:0}, head->first={0:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L550] head->first == ((void *)0) && head->last == ((void *)0) VAL [\old(input)=0, head={16:0}, head={16:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L550] EXPR, FCALL head->last VAL [\old(input)=0, head={16:0}, head={16:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, head->last={0:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L550] head->first == ((void *)0) && head->last == ((void *)0) VAL [\old(input)=0, head={16:0}, head={16:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, head->last={0:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L552] FCALL head->last= node VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L553] FCALL node->prev = ((void *)0) VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] [L554] FCALL node->next = ((void *)0) VAL [\old(input)=0, head={16:0}, head={16:0}, input=0, malloc(sizeof *node)={13:0}, node={13:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 6 procedures, 198 locations, 6 error locations. UNSAFE Result, 0.1s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 317 SDtfs, 0 SDslu, 80 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-42-08-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-42-08-665.csv Received shutdown request...