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.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:28:40,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:28:40,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:28:40,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:28:40,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:28:40,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:28:40,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:28:40,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:28:40,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:28:40,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:28:40,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:28:40,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:28:40,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:28:40,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:28:40,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:28:40,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:28:40,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:28:40,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:28:40,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:28:40,897 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:28:40,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:28:40,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:28:40,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:28:40,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:28:40,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:28:40,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:28:40,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:28:40,904 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:28:40,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:28:40,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:28:40,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:28:40,905 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.epf [2018-01-20 23:28:40,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:28:40,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:28:40,917 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:28:40,917 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:28:40,917 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:28:40,918 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:28:40,918 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:28:40,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:28:40,919 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:28:40,919 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:28:40,919 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:28:40,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:28:40,919 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:28:40,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:28:40,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:28:40,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:28:40,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:28:40,920 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:28:40,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:28:40,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:28:40,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:28:40,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:28:40,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:28:40,922 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:28:40,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:28:40,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:28:40,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:28:40,923 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:28:40,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:28:40,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:28:40,923 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:28:40,923 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:28:40,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:28:40,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:28:40,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:28:40,924 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:28:40,925 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:28:40,925 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:28:40,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:28:40,968 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:28:40,971 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:28:40,972 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:28:40,972 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:28:40,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-01-20 23:28:41,140 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:28:41,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:28:41,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:28:41,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:28:41,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:28:41,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41741684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41, skipping insertion in model container [2018-01-20 23:28:41,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,167 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:28:41,203 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:28:41,311 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:28:41,327 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:28:41,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41 WrapperNode [2018-01-20 23:28:41,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:28:41,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:28:41,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:28:41,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:28:41,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... [2018-01-20 23:28:41,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:28:41,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:28:41,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:28:41,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:28:41,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:28:41,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:28:41,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:28:41,418 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 23:28:41,418 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:28:41,418 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:28:41,418 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:28:41,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:28:41,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:28:41,418 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:28:41,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:28:41,666 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:28:41,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:28:41 BoogieIcfgContainer [2018-01-20 23:28:41,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:28:41,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:28:41,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:28:41,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:28:41,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:28:41" (1/3) ... [2018-01-20 23:28:41,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:28:41, skipping insertion in model container [2018-01-20 23:28:41,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:28:41" (2/3) ... [2018-01-20 23:28:41,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:28:41, skipping insertion in model container [2018-01-20 23:28:41,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:28:41" (3/3) ... [2018-01-20 23:28:41,672 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-01-20 23:28:41,678 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:28:41,683 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:28:41,718 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:28:41,718 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:28:41,718 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:28:41,718 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:28:41,719 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:28:41,719 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:28:41,719 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:28:41,719 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:28:41,720 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:28:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:28:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:28:41,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:41,750 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:28:41,750 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:28:41,756 INFO L82 PathProgramCache]: Analyzing trace with hash 112439, now seen corresponding path program 1 times [2018-01-20 23:28:41,759 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:41,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:41,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:41,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:41,813 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:28:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:28:41,872 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:28:41,877 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:28:41,883 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:28:41,883 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:28:41,884 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:28:41,884 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:28:41,884 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:28:41,884 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:28:41,884 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:28:41,884 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:28:41,884 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:28:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:28:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 23:28:41,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:41,887 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:28:41,887 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:28:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1291770077, now seen corresponding path program 1 times [2018-01-20 23:28:41,888 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:41,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:41,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:41,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:41,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:28:41,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:28:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:28:41,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:28:41,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:28:41,946 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:28:41,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:28:41,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:28:41,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:28:41,969 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-20 23:28:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:28:42,059 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-20 23:28:42,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:28:42,060 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-20 23:28:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:28:42,068 INFO L225 Difference]: With dead ends: 87 [2018-01-20 23:28:42,069 INFO L226 Difference]: Without dead ends: 55 [2018-01-20 23:28:42,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:28:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-20 23:28:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-20 23:28:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 23:28:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-20 23:28:42,100 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 17 [2018-01-20 23:28:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:28:42,101 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-20 23:28:42,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:28:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-20 23:28:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:28:42,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:42,102 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-20 23:28:42,102 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:28:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -348822780, now seen corresponding path program 1 times [2018-01-20 23:28:42,103 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:42,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:42,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:42,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:42,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:28:42,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:28:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:28:42,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:28:42,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-20 23:28:42,364 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:28:42,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 23:28:42,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 23:28:42,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-20 23:28:42,366 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 8 states. [2018-01-20 23:28:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:28:42,604 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-20 23:28:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 23:28:42,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-20 23:28:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:28:42,609 INFO L225 Difference]: With dead ends: 79 [2018-01-20 23:28:42,609 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 23:28:42,611 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-20 23:28:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 23:28:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2018-01-20 23:28:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 23:28:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-20 23:28:42,624 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 37 [2018-01-20 23:28:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:28:42,624 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-20 23:28:42,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 23:28:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-20 23:28:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 23:28:42,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:42,626 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] [2018-01-20 23:28:42,626 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:28:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash -66466680, now seen corresponding path program 1 times [2018-01-20 23:28:42,627 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:42,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:42,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:42,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:42,628 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:28:42,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:28:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:28:42,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:28:42,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-20 23:28:42,877 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:28:42,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 23:28:42,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 23:28:42,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-20 23:28:42,878 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 12 states. [2018-01-20 23:28:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:28:43,183 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-01-20 23:28:43,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 23:28:43,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-01-20 23:28:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:28:43,184 INFO L225 Difference]: With dead ends: 62 [2018-01-20 23:28:43,185 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:28:43,185 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-20 23:28:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:28:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:28:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:28:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:28:43,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-20 23:28:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:28:43,187 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:28:43,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 23:28:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:28:43,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:28:43,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:28:43,191 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:28:43,191 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:28:43,191 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:28:43,191 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:28:43,191 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:28:43,191 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:28:43,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:28:43,192 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:28:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:28:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:28:43,194 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:43,194 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:28:43,194 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:28:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1065030161, now seen corresponding path program 1 times [2018-01-20 23:28:43,195 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:43,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:43,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,196 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:28:43,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:28:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:28:43,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:28:43,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:28:43,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:28:43,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:28:43,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:28:43,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:28:43,209 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-20 23:28:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:28:43,212 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-20 23:28:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:28:43,212 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-20 23:28:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:28:43,213 INFO L225 Difference]: With dead ends: 87 [2018-01-20 23:28:43,213 INFO L226 Difference]: Without dead ends: 53 [2018-01-20 23:28:43,214 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:28:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-20 23:28:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-20 23:28:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-20 23:28:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-20 23:28:43,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 15 [2018-01-20 23:28:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:28:43,218 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-20 23:28:43,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:28:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-20 23:28:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 23:28:43,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:43,219 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-20 23:28:43,219 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:28:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1313602040, now seen corresponding path program 1 times [2018-01-20 23:28:43,219 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:43,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:43,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,220 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:28:43,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:28:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:28:43,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:28:43,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-20 23:28:43,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:28:43,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 23:28:43,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 23:28:43,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-20 23:28:43,367 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 8 states. [2018-01-20 23:28:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:28:43,535 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-20 23:28:43,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 23:28:43,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-20 23:28:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:28:43,537 INFO L225 Difference]: With dead ends: 75 [2018-01-20 23:28:43,537 INFO L226 Difference]: Without dead ends: 60 [2018-01-20 23:28:43,537 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-20 23:28:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-20 23:28:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-20 23:28:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-20 23:28:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-20 23:28:43,542 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 35 [2018-01-20 23:28:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:28:43,543 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-20 23:28:43,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 23:28:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-20 23:28:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 23:28:43,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:43,545 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] [2018-01-20 23:28:43,545 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:28:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2055932804, now seen corresponding path program 1 times [2018-01-20 23:28:43,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:43,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:43,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,547 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:28:43,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:28:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:28:43,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:28:43,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-20 23:28:43,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:28:43,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 23:28:43,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 23:28:43,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-20 23:28:43,704 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 12 states. [2018-01-20 23:28:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:28:43,908 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-01-20 23:28:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 23:28:43,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-20 23:28:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:28:43,909 INFO L225 Difference]: With dead ends: 60 [2018-01-20 23:28:43,909 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:28:43,910 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-20 23:28:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:28:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:28:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:28:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:28:43,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-01-20 23:28:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:28:43,911 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:28:43,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 23:28:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:28:43,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:28:43,913 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:28:43,913 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:28:43,913 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:28:43,913 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:28:43,913 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:28:43,913 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:28:43,913 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:28:43,914 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 23:28:43,914 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:28:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:28:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:28:43,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:28:43,917 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-20 23:28:43,917 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-20 23:28:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1066206763, now seen corresponding path program 1 times [2018-01-20 23:28:43,917 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:28:43,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:28:43,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:28:43,919 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:28:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:28:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:28:43,952 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:28:43,984 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:28:43,989 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:28:44,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:28:44 BoogieIcfgContainer [2018-01-20 23:28:44,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:28:44,005 INFO L168 Benchmark]: Toolchain (without parser) took 2863.71 ms. Allocated memory was 306.2 MB in the beginning and 479.2 MB in the end (delta: 173.0 MB). Free memory was 264.5 MB in the beginning and 321.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 115.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:28:44,006 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:28:44,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.36 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:28:44,006 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:28:44,007 INFO L168 Benchmark]: RCFGBuilder took 295.14 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 230.9 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-20 23:28:44,007 INFO L168 Benchmark]: TraceAbstraction took 2336.64 ms. Allocated memory was 306.2 MB in the beginning and 479.2 MB in the end (delta: 173.0 MB). Free memory was 230.9 MB in the beginning and 321.7 MB in the end (delta: -90.9 MB). Peak memory consumption was 82.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:28:44,009 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.14 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.36 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.10 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.14 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 230.9 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2336.64 ms. Allocated memory was 306.2 MB in the beginning and 479.2 MB in the end (delta: 173.0 MB). Free memory was 230.9 MB in the beginning and 321.7 MB in the end (delta: -90.9 MB). Peak memory consumption was 82.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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, 59 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=59occurred 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, 59 locations, 4 error locations. SAFE Result, 1.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 88 SDslu, 238 SDs, 0 SdLazy, 292 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 22404 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, 59 locations, 4 error locations. SAFE Result, 0.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 88 SDslu, 230 SDs, 0 SdLazy, 292 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 21102 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)={13:0}, malloc(sizeof *item)={9: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)={13:0}, malloc(sizeof *item)={9: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)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L631] FCALL *plist = item VAL [item={9:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 59 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=59occurred 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_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-28-44-018.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-28-44-018.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-28-44-018.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-28-44-018.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-28-44-018.csv Received shutdown request...