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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:40:08,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:40:08,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:40:08,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:40:08,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:40:08,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:40:08,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:40:08,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:40:08,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:40:08,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:40:08,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:40:08,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:40:08,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:40:08,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:40:08,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:40:08,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:40:08,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:40:08,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:40:08,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:40:08,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:40:08,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:40:08,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:40:08,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:40:08,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:40:08,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:40:08,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:40:08,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:40:08,049 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:40:08,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:40:08,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:40:08,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:40:08,050 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:40:08,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:40:08,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:40:08,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:40:08,062 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:40:08,062 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:40:08,062 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:40:08,062 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:40:08,062 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:40:08,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:40:08,063 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:40:08,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:40:08,064 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:40:08,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:40:08,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:40:08,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:40:08,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:40:08,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:40:08,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:40:08,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:40:08,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:40:08,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:40:08,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:40:08,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:40:08,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:40:08,066 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:40:08,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:40:08,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:40:08,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:40:08,067 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:40:08,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:40:08,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:40:08,068 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:40:08,068 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:40:08,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:40:08,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:40:08,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:40:08,069 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:40:08,070 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:40:08,070 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:40:08,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:40:08,118 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:40:08,122 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:40:08,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:40:08,124 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:40:08,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_false-valid-deref.i [2018-01-21 00:40:08,312 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:40:08,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:40:08,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:40:08,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:40:08,321 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:40:08,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27608974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08, skipping insertion in model container [2018-01-21 00:40:08,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,341 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:40:08,380 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:40:08,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:40:08,545 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:40:08,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08 WrapperNode [2018-01-21 00:40:08,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:40:08,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:40:08,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:40:08,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:40:08,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (1/1) ... [2018-01-21 00:40:08,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:40:08,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:40:08,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:40:08,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:40:08,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (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:40:08,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:40:08,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:40:08,667 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-01-21 00:40:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-01-21 00:40:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 00:40:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:40:08,668 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:40:08,668 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:40:08,668 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-21 00:40:08,669 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:40:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-01-21 00:40:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-01-21 00:40:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 00:40:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:40:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:40:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:40:09,338 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:40:09,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:40:09 BoogieIcfgContainer [2018-01-21 00:40:09,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:40:09,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:40:09,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:40:09,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:40:09,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:40:08" (1/3) ... [2018-01-21 00:40:09,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e6d79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:40:09, skipping insertion in model container [2018-01-21 00:40:09,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:40:08" (2/3) ... [2018-01-21 00:40:09,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e6d79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:40:09, skipping insertion in model container [2018-01-21 00:40:09,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:40:09" (3/3) ... [2018-01-21 00:40:09,347 INFO L105 eAbstractionObserver]: Analyzing ICFG split_list_test05_false-valid-deref.i [2018-01-21 00:40:09,357 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:40:09,364 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 00:40:09,414 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:40:09,414 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:40:09,414 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:40:09,415 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:40:09,415 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:40:09,415 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:40:09,415 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:40:09,415 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:40:09,416 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:40:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-01-21 00:40:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:40:09,440 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:09,441 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:40:09,441 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:40:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 425620, now seen corresponding path program 1 times [2018-01-21 00:40:09,449 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:09,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:09,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:09,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:09,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:40:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:40:09,565 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:40:09,572 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:40:09,578 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:40:09,578 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:40:09,579 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:40:09,595 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:40:09,596 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:40:09,596 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:40:09,596 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:40:09,596 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == containsHeadErr0EnsuresViolation======== [2018-01-21 00:40:09,596 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:40:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-01-21 00:40:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-21 00:40:09,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:09,619 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:09,619 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr0EnsuresViolation]=== [2018-01-21 00:40:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 845880362, now seen corresponding path program 1 times [2018-01-21 00:40:09,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:09,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:09,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:09,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:09,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:09,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-01-21 00:40:09,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:40:09,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:40:09,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:09,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:40:09,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:40:09,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:40:09,987 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 2 states. [2018-01-21 00:40:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:10,035 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2018-01-21 00:40:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:40:10,036 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2018-01-21 00:40:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:10,042 INFO L225 Difference]: With dead ends: 381 [2018-01-21 00:40:10,042 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:40:10,048 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:40:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:40:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:40:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:40:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:40:10,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2018-01-21 00:40:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:10,068 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:40:10,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:40:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:40:10,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:40:10,072 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:40:10,072 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:40:10,072 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:40:10,072 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:40:10,072 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:40:10,073 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:40:10,073 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:40:10,073 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == containsBodyErr0EnsuresViolation======== [2018-01-21 00:40:10,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:40:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-01-21 00:40:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-01-21 00:40:10,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:10,084 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:10,084 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsBodyErr0EnsuresViolation]=== [2018-01-21 00:40:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -418021682, now seen corresponding path program 1 times [2018-01-21 00:40:10,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:10,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:10,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:10,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:10,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:10,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-01-21 00:40:10,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:40:10,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:40:10,210 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:10,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:40:10,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:40:10,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:40:10,212 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 2 states. [2018-01-21 00:40:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:10,236 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2018-01-21 00:40:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:40:10,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 201 [2018-01-21 00:40:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:10,237 INFO L225 Difference]: With dead ends: 381 [2018-01-21 00:40:10,237 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:40:10,240 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:40:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:40:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:40:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:40:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:40:10,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2018-01-21 00:40:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:10,241 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:40:10,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:40:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:40:10,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:40:10,244 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:40:10,244 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:40:10,244 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:40:10,245 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:40:10,245 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:40:10,245 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:40:10,245 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:40:10,245 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:40:10,245 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:40:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-01-21 00:40:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-01-21 00:40:10,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:10,251 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:10,251 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:40:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash -500451978, now seen corresponding path program 1 times [2018-01-21 00:40:10,252 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:10,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:10,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:10,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:10,253 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:10,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-01-21 00:40:10,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:40:10,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:40:10,364 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:10,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:40:10,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:40:10,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:40:10,365 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 2 states. [2018-01-21 00:40:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:10,382 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2018-01-21 00:40:10,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:40:10,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 194 [2018-01-21 00:40:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:10,389 INFO L225 Difference]: With dead ends: 381 [2018-01-21 00:40:10,389 INFO L226 Difference]: Without dead ends: 191 [2018-01-21 00:40:10,391 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:40:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-21 00:40:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-21 00:40:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-21 00:40:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2018-01-21 00:40:10,424 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 194 [2018-01-21 00:40:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:10,425 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2018-01-21 00:40:10,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:40:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2018-01-21 00:40:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-21 00:40:10,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:10,446 INFO L322 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:10,446 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:40:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1705669942, now seen corresponding path program 1 times [2018-01-21 00:40:10,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:10,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:10,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:10,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:10,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:10,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2018-01-21 00:40:10,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:40:10,659 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:40:10,660 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-01-21 00:40:10,663 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], [106], [110], [114], [122], [125], [140], [144], [148], [156], [159], [165], [166], [167], [168], [172], [175], [180], [181], [182], [183], [186], [265], [267], [268], [338], [339], [340], [341], [342], [343], [344], [351], [355], [356], [357], [358], [359], [369], [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], [403], [404], [405], [406] [2018-01-21 00:40:10,726 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:40:10,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:40:10,922 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:40:10,924 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:40:10,949 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:40:11,158 INFO L232 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 53.47% of their original sizes. [2018-01-21 00:40:11,158 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:40:11,528 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:40:11,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:40:11,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [3] total 19 [2018-01-21 00:40:11,529 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:11,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 00:40:11,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 00:40:11,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:40:11,532 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand 18 states. [2018-01-21 00:40:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:13,804 INFO L93 Difference]: Finished difference Result 220 states and 261 transitions. [2018-01-21 00:40:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:40:13,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 265 [2018-01-21 00:40:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:13,846 INFO L225 Difference]: With dead ends: 220 [2018-01-21 00:40:13,847 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:40:13,849 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 248 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:40:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:40:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:40:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:40:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:40:13,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-01-21 00:40:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:13,850 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:40:13,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 00:40:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:40:13,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:40:13,852 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:40:13,853 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:40:13,853 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:40:13,853 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:40:13,853 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:40:13,853 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:40:13,853 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:40:13,854 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:40:13,854 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:40:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-01-21 00:40:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-01-21 00:40:13,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:13,859 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,859 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:40:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1555826309, now seen corresponding path program 1 times [2018-01-21 00:40:13,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:13,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:13,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:13,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:13,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:13,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-01-21 00:40:13,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:40:13,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:40:13,960 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:13,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:40:13,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:40:13,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:40:13,961 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 2 states. [2018-01-21 00:40:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:13,975 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2018-01-21 00:40:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:40:13,976 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 192 [2018-01-21 00:40:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:13,978 INFO L225 Difference]: With dead ends: 381 [2018-01-21 00:40:13,978 INFO L226 Difference]: Without dead ends: 189 [2018-01-21 00:40:13,979 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:40:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-21 00:40:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-01-21 00:40:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-21 00:40:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 225 transitions. [2018-01-21 00:40:13,995 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 225 transitions. Word has length 192 [2018-01-21 00:40:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:13,995 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 225 transitions. [2018-01-21 00:40:13,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:40:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 225 transitions. [2018-01-21 00:40:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-01-21 00:40:13,998 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:13,999 INFO L322 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,999 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:40:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1597303857, now seen corresponding path program 1 times [2018-01-21 00:40:13,999 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:14,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:14,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:14,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:14,001 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:14,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2018-01-21 00:40:14,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:40:14,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:40:14,157 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-01-21 00:40:14,158 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], [106], [110], [114], [122], [125], [140], [144], [148], [156], [159], [165], [166], [167], [168], [172], [175], [180], [181], [182], [183], [186], [266], [267], [268], [339], [340], [341], [342], [343], [344], [351], [355], [356], [357], [358], [359], [369], [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], [403], [404], [405] [2018-01-21 00:40:14,161 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:40:14,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:40:14,219 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:40:14,219 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:40:14,221 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:40:14,326 INFO L232 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 53.47% of their original sizes. [2018-01-21 00:40:14,326 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:40:14,615 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:40:14,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:40:14,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [3] total 19 [2018-01-21 00:40:14,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:14,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 00:40:14,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 00:40:14,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:40:14,621 INFO L87 Difference]: Start difference. First operand 189 states and 225 transitions. Second operand 18 states. [2018-01-21 00:40:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:16,476 INFO L93 Difference]: Finished difference Result 218 states and 259 transitions. [2018-01-21 00:40:16,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:40:16,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 263 [2018-01-21 00:40:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:16,476 INFO L225 Difference]: With dead ends: 218 [2018-01-21 00:40:16,476 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:40:16,477 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2018-01-21 00:40:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:40:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:40:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:40:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:40:16,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2018-01-21 00:40:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:16,478 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:40:16,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 00:40:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:40:16,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:40:16,479 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:40:16,479 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:40:16,479 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:40:16,479 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:40:16,479 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:40:16,479 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:40:16,479 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:40:16,479 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 00:40:16,479 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:40:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-01-21 00:40:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:40:16,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:16,481 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:40:16,481 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 00:40:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 380673925, now seen corresponding path program 1 times [2018-01-21 00:40:16,481 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:16,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:16,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:16,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:16,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:16,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:16,492 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:40:16,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:40:16,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:40:16,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:16,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:40:16,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:40:16,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:40:16,493 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 2 states. [2018-01-21 00:40:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:16,501 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2018-01-21 00:40:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:40:16,501 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 00:40:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:16,502 INFO L225 Difference]: With dead ends: 381 [2018-01-21 00:40:16,502 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 00:40:16,503 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:40:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 00:40:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-21 00:40:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 00:40:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-01-21 00:40:16,511 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 25 [2018-01-21 00:40:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:16,511 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-01-21 00:40:16,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:40:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-01-21 00:40:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:40:16,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:16,512 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:40:16,512 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-21 00:40:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1002851180, now seen corresponding path program 1 times [2018-01-21 00:40:16,512 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:16,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:16,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:16,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:16,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:40:16,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:40:16,547 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:40:16,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:40:16,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:40:16,547 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:40:16,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:40:16,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:40:16,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:40:16,548 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 3 states. [2018-01-21 00:40:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:40:16,568 INFO L93 Difference]: Finished difference Result 119 states and 174 transitions. [2018-01-21 00:40:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:40:16,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-21 00:40:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:40:16,570 INFO L225 Difference]: With dead ends: 119 [2018-01-21 00:40:16,570 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 00:40:16,570 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:40:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 00:40:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-21 00:40:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-21 00:40:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2018-01-21 00:40:16,576 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 27 [2018-01-21 00:40:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:40:16,577 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-01-21 00:40:16,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:40:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2018-01-21 00:40:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:40:16,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:40:16,577 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:40:16,577 INFO L371 AbstractCegarLoop]: === Iteration 3 === [appendErr0EnsuresViolation]=== [2018-01-21 00:40:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash -23953007, now seen corresponding path program 1 times [2018-01-21 00:40:16,578 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:40:16,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:16,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:40:16,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:40:16,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:40:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:40:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:40:16,618 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:40:16,623 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:40:16,629 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:40:16,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:40:16 BoogieIcfgContainer [2018-01-21 00:40:16,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:40:16,642 INFO L168 Benchmark]: Toolchain (without parser) took 8330.33 ms. Allocated memory was 306.2 MB in the beginning and 712.5 MB in the end (delta: 406.3 MB). Free memory was 263.5 MB in the beginning and 547.2 MB in the end (delta: -283.7 MB). Peak memory consumption was 122.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:40:16,643 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:40:16,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.56 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 251.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:40:16,643 INFO L168 Benchmark]: Boogie Preprocessor took 51.30 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 247.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:40:16,643 INFO L168 Benchmark]: RCFGBuilder took 728.08 ms. Allocated memory is still 306.2 MB. Free memory was 247.6 MB in the beginning and 200.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:40:16,644 INFO L168 Benchmark]: TraceAbstraction took 7301.20 ms. Allocated memory was 306.2 MB in the beginning and 712.5 MB in the end (delta: 406.3 MB). Free memory was 200.6 MB in the beginning and 547.2 MB in the end (delta: -346.5 MB). Peak memory consumption was 59.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:40:16,645 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.56 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 251.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.30 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 247.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 728.08 ms. Allocated memory is still 306.2 MB. Free memory was 247.6 MB in the beginning and 200.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7301.20 ms. Allocated memory was 306.2 MB in the beginning and 712.5 MB in the end (delta: 406.3 MB). Free memory was 200.6 MB in the beginning and 547.2 MB in the end (delta: -346.5 MB). Peak memory consumption was 59.8 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.507220 RENAME_VARIABLES(MILLISECONDS) : 0.757202 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.458809 PROJECTAWAY(MILLISECONDS) : 0.053242 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001595 DISJOIN(MILLISECONDS) : 1.567682 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.806131 ADD_EQUALITY(MILLISECONDS) : 0.040665 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014673 #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.318627 RENAME_VARIABLES(MILLISECONDS) : 0.343218 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.279857 PROJECTAWAY(MILLISECONDS) : 0.033396 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001228 DISJOIN(MILLISECONDS) : 0.983029 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.375007 ADD_EQUALITY(MILLISECONDS) : 0.023573 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007842 #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, 197 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=197occurred 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, 197 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 11 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 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=197occurred 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, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 38809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 770/770 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, 197 locations, 6 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 11 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 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=197occurred 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, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 40000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 770/770 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, 197 locations, 6 error locations. SAFE Result, 3.6s OverallTime, 2 OverallIterations, 14 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 95 SDslu, 60 SDs, 0 SdLazy, 237 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 279 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.9937575204553815 AbsIntWeakeningRatio, 1.1893939393939394 AbsIntAvgWeakeningVarsNumRemoved, 0.4053030303030303 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, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 107209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1953/2044 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, 197 locations, 6 error locations. SAFE Result, 2.6s OverallTime, 2 OverallIterations, 14 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 92 SDslu, 71 SDs, 0 SdLazy, 248 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 277 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.9937098679397737 AbsIntWeakeningRatio, 1.1946564885496183 AbsIntAvgWeakeningVarsNumRemoved, 0.4083969465648855 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, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 105387 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1953/2044 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, 197 locations, 6 error locations. UNSAFE Result, 0.1s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 314 SDtfs, 0 SDslu, 78 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=197occurred 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_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-40-16-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-40-16-656.csv Received shutdown request...