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/test-0232_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:35:33,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:35:33,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:35:33,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:35:33,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:35:33,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:35:33,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:35:33,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:35:33,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:35:33,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:35:33,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:35:33,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:35:33,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:35:33,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:35:33,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:35:33,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:35:33,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:35:33,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:35:33,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:35:33,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:35:33,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:35:33,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:35:33,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:35:33,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:35:33,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:35:33,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:35:33,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:35:33,526 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:35:33,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:35:33,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:35:33,527 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:35:33,528 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:35:33,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:35:33,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:35:33,539 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:35:33,539 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:35:33,539 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:35:33,540 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:35:33,540 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:35:33,540 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:35:33,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:35:33,541 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:35:33,541 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:35:33,541 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:35:33,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:35:33,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:35:33,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:35:33,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:35:33,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:35:33,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:35:33,543 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:35:33,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:35:33,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:35:33,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:35:33,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:35:33,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:35:33,544 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:35:33,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:35:33,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:35:33,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:35:33,545 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:35:33,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:35:33,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:35:33,545 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:35:33,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:35:33,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:35:33,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:35:33,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:35:33,546 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:35:33,547 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:35:33,547 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:35:33,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:35:33,598 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:35:33,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:35:33,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:35:33,604 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:35:33,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i [2018-01-21 00:35:33,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:35:33,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:35:33,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:35:33,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:35:33,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:35:33,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:33,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3346b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33, skipping insertion in model container [2018-01-21 00:35:33,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:33,807 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:35:33,847 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:35:33,969 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:35:33,985 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:35:33,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33 WrapperNode [2018-01-21 00:35:33,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:35:33,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:35:33,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:35:33,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:35:34,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (1/1) ... [2018-01-21 00:35:34,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:35:34,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:35:34,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:35:34,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:35:34,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (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:35:34,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:35:34,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:35:34,075 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 00:35:34,075 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:35:34,075 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:35:34,076 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:35:34,076 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 00:35:34,076 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:35:34,076 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:35:34,076 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:35:34,311 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:35:34,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:35:34 BoogieIcfgContainer [2018-01-21 00:35:34,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:35:34,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:35:34,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:35:34,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:35:34,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:35:33" (1/3) ... [2018-01-21 00:35:34,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456fcddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:35:34, skipping insertion in model container [2018-01-21 00:35:34,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:35:33" (2/3) ... [2018-01-21 00:35:34,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456fcddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:35:34, skipping insertion in model container [2018-01-21 00:35:34,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:35:34" (3/3) ... [2018-01-21 00:35:34,318 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_true-valid-memsafety.i [2018-01-21 00:35:34,325 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:35:34,331 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:35:34,377 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:34,377 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:34,378 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:34,378 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:34,378 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:34,378 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:34,378 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:34,378 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:35:34,379 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:35:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:35:34,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:34,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:35:34,408 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:35:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 116283, now seen corresponding path program 1 times [2018-01-21 00:35:34,416 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:34,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:34,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:34,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:34,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:35:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:35:34,516 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:35:34,522 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:35:34,529 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:34,529 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:34,529 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:34,529 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:34,530 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:34,530 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:34,530 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:34,530 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:35:34,530 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:35:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:35:34,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:34,535 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:34,535 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:35:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1263850333, now seen corresponding path program 1 times [2018-01-21 00:35:34,535 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:34,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:34,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:34,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:34,537 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:34,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:34,593 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:35:34,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:34,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:35:34,595 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:34,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:35:34,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:35:34,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:35:34,616 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-21 00:35:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:34,718 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-01-21 00:35:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:35:34,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 00:35:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:34,734 INFO L225 Difference]: With dead ends: 95 [2018-01-21 00:35:34,734 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 00:35:34,737 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:35:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 00:35:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-21 00:35:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 00:35:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-21 00:35:34,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 17 [2018-01-21 00:35:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:34,773 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-21 00:35:34,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:35:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-21 00:35:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:35:34,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:34,775 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:34,775 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:35:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 748122116, now seen corresponding path program 1 times [2018-01-21 00:35:34,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:34,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:34,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:34,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:34,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:34,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:35,034 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:35:35,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:35,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:35:35,035 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:35,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:35:35,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:35:35,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:35:35,037 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 8 states. [2018-01-21 00:35:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:35,311 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-01-21 00:35:35,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:35:35,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-21 00:35:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:35,316 INFO L225 Difference]: With dead ends: 83 [2018-01-21 00:35:35,316 INFO L226 Difference]: Without dead ends: 66 [2018-01-21 00:35:35,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-21 00:35:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-21 00:35:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2018-01-21 00:35:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 00:35:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-21 00:35:35,329 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 37 [2018-01-21 00:35:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:35,329 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-21 00:35:35,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:35:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-21 00:35:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 00:35:35,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:35,331 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:35,331 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:35:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1631409154, now seen corresponding path program 1 times [2018-01-21 00:35:35,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:35,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:35,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:35,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:35,482 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:35:35,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:35,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:35:35,483 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:35,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:35:35,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:35:35,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:35:35,484 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2018-01-21 00:35:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:35,545 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-21 00:35:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:35:35,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-01-21 00:35:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:35,547 INFO L225 Difference]: With dead ends: 78 [2018-01-21 00:35:35,547 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:35:35,548 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:35:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:35:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:35:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:35:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:35:35,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-21 00:35:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:35,549 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:35:35,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:35:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:35:35,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:35:35,551 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:35,552 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:35,552 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:35,552 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:35,552 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:35,552 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:35,552 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:35,552 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:35:35,552 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:35:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:35:35,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:35,555 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:35,555 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:35:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 542096661, now seen corresponding path program 1 times [2018-01-21 00:35:35,555 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:35,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:35,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,556 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:35,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:35,571 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:35:35,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:35,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:35:35,571 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:35,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:35:35,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:35:35,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:35:35,573 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-21 00:35:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:35,578 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-01-21 00:35:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:35:35,579 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 00:35:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:35,580 INFO L225 Difference]: With dead ends: 95 [2018-01-21 00:35:35,580 INFO L226 Difference]: Without dead ends: 57 [2018-01-21 00:35:35,581 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:35:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-21 00:35:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-21 00:35:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 00:35:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-21 00:35:35,587 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-01-21 00:35:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:35,588 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-21 00:35:35,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:35:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-21 00:35:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:35:35,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:35,589 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:35,589 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:35:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1290840196, now seen corresponding path program 1 times [2018-01-21 00:35:35,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:35,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:35,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:35,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:35,727 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:35:35,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:35,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:35:35,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:35,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:35:35,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:35:35,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:35:35,729 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 8 states. [2018-01-21 00:35:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:35,897 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-21 00:35:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:35:35,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-21 00:35:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:35,898 INFO L225 Difference]: With dead ends: 79 [2018-01-21 00:35:35,899 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 00:35:35,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-21 00:35:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 00:35:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-01-21 00:35:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 00:35:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-21 00:35:35,904 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 35 [2018-01-21 00:35:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:35,904 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-21 00:35:35,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:35:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-21 00:35:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:35:35,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:35,905 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:35,905 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:35:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1194992378, now seen corresponding path program 1 times [2018-01-21 00:35:35,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:35,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:35,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:35,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:35,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:36,043 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:35:36,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:36,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:35:36,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:36,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:35:36,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:35:36,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:35:36,046 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-01-21 00:35:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:36,125 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-21 00:35:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:35:36,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 00:35:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:36,126 INFO L225 Difference]: With dead ends: 76 [2018-01-21 00:35:36,126 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:35:36,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:35:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:35:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:35:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:35:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:35:36,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 00:35:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:36,128 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:35:36,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:35:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:35:36,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:35:36,130 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:36,130 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:36,130 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:36,130 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:36,130 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:36,130 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:36,130 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:36,130 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 00:35:36,130 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:35:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:35:36,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:36,133 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:36,133 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 00:35:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1981238237, now seen corresponding path program 1 times [2018-01-21 00:35:36,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:36,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:36,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:36,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:36,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:35:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:35:36,167 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:35:36,173 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:35:36,177 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:35:36,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:35:36 BoogieIcfgContainer [2018-01-21 00:35:36,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:35:36,195 INFO L168 Benchmark]: Toolchain (without parser) took 2428.14 ms. Allocated memory was 300.4 MB in the beginning and 473.4 MB in the end (delta: 173.0 MB). Free memory was 258.7 MB in the beginning and 419.4 MB in the end (delta: -160.6 MB). Peak memory consumption was 12.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:36,196 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:35:36,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.16 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 247.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:36,197 INFO L168 Benchmark]: Boogie Preprocessor took 33.33 ms. Allocated memory is still 300.4 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:36,197 INFO L168 Benchmark]: RCFGBuilder took 284.60 ms. Allocated memory is still 300.4 MB. Free memory was 245.7 MB in the beginning and 224.1 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:36,197 INFO L168 Benchmark]: TraceAbstraction took 1880.87 ms. Allocated memory was 300.4 MB in the beginning and 473.4 MB in the end (delta: 173.0 MB). Free memory was 224.1 MB in the beginning and 419.4 MB in the end (delta: -195.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:35:36,199 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.23 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.16 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 247.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.33 ms. Allocated memory is still 300.4 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 284.60 ms. Allocated memory is still 300.4 MB. Free memory was 245.7 MB in the beginning and 224.1 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1880.87 ms. Allocated memory was 300.4 MB in the beginning and 473.4 MB in the end (delta: 173.0 MB). Free memory was 224.1 MB in the beginning and 419.4 MB in the end (delta: -195.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 63 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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: 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 4 procedures, 63 locations, 4 error locations. SAFE Result, 1.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 72 SDslu, 168 SDs, 0 SdLazy, 136 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 17859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 633]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 63 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 72 SDslu, 160 SDs, 0 SdLazy, 136 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 16803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 624]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={11:0}] [L637] CALL append(&list) VAL [plist={11:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628] EXPR, FCALL item->next VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L631] FCALL *plist = item VAL [item={9:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 63 locations, 4 error locations. UNSAFE Result, 0.0s 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=63occurred 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, 23 NumberOfCodeBlocks, 23 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-35-36-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-35-36-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-35-36-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-35-36-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-35-36-209.csv Received shutdown request...