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_precise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:54:17,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:54:17,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:54:17,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:54:17,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:54:17,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:54:17,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:54:17,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:54:17,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:54:17,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:54:17,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:54:17,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:54:17,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:54:17,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:54:17,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:54:17,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:54:17,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:54:17,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:54:17,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:54:17,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:54:17,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:54:17,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:54:17,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:54:17,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:54:17,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:54:17,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:54:17,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:54:17,418 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:54:17,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:54:17,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:54:17,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:54:17,420 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_precise.epf [2018-01-21 05:54:17,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:54:17,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:54:17,430 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:54:17,430 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:54:17,430 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:54:17,430 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:54:17,431 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:54:17,431 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:54:17,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:54:17,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:54:17,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:54:17,431 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:54:17,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:54:17,433 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:54:17,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:54:17,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:54:17,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:54:17,433 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:54:17,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:54:17,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:54:17,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:54:17,434 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:54:17,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:54:17,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:54:17,434 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:54:17,435 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:54:17,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:54:17,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:54:17,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:54:17,435 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:54:17,436 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:54:17,436 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:54:17,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:54:17,480 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:54:17,483 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:54:17,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:54:17,484 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:54:17,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i [2018-01-21 05:54:17,651 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:54:17,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:54:17,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:54:17,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:54:17,662 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:54:17,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c86d839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17, skipping insertion in model container [2018-01-21 05:54:17,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,680 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:54:17,716 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:54:17,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:54:17,850 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:54:17,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17 WrapperNode [2018-01-21 05:54:17,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:54:17,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:54:17,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:54:17,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:54:17,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (1/1) ... [2018-01-21 05:54:17,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:54:17,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:54:17,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:54:17,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:54:17,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (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 05:54:17,941 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:54:17,941 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:54:17,942 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-21 05:54:17,942 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:54:17,942 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 05:54:17,942 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 05:54:17,942 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:54:17,942 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:54:17,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:54:17,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:54:18,128 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:54:18,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:54:18 BoogieIcfgContainer [2018-01-21 05:54:18,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:54:18,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:54:18,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:54:18,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:54:18,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:54:17" (1/3) ... [2018-01-21 05:54:18,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c33cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:54:18, skipping insertion in model container [2018-01-21 05:54:18,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:54:17" (2/3) ... [2018-01-21 05:54:18,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c33cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:54:18, skipping insertion in model container [2018-01-21 05:54:18,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:54:18" (3/3) ... [2018-01-21 05:54:18,134 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-deref.i [2018-01-21 05:54:18,141 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:54:18,147 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 05:54:18,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:54:18,186 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:54:18,186 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:54:18,186 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:54:18,186 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:54:18,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:54:18,187 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:54:18,187 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:54:18,188 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:54:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 05:54:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:54:18,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:18,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:54:18,216 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:54:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash 103790, now seen corresponding path program 1 times [2018-01-21 05:54:18,222 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:18,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:18,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:54:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:54:18,329 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:54:18,338 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:54:18,346 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:54:18,346 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:54:18,346 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:54:18,346 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:54:18,346 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:54:18,347 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:54:18,347 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:54:18,347 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-21 05:54:18,347 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:54:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 05:54:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 05:54:18,349 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:18,349 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:54:18,349 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-21 05:54:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash -568733067, now seen corresponding path program 1 times [2018-01-21 05:54:18,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:18,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:18,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,351 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:54:18,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:54:18,405 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 05:54:18,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:54:18,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:54:18,407 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:54:18,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:54:18,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:54:18,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:54:18,424 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 05:54:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:54:18,453 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-01-21 05:54:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:54:18,455 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 05:54:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:54:18,534 INFO L225 Difference]: With dead ends: 75 [2018-01-21 05:54:18,534 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:54:18,538 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 05:54:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:54:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:54:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:54:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:54:18,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 05:54:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:54:18,560 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:54:18,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:54:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:54:18,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:54:18,563 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:54:18,564 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:54:18,564 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:54:18,564 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:54:18,564 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:54:18,564 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:54:18,564 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:54:18,564 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:54:18,564 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:54:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 05:54:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 05:54:18,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:18,568 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] [2018-01-21 05:54:18,568 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:54:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash 100681403, now seen corresponding path program 1 times [2018-01-21 05:54:18,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:18,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:18,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:54:18,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:54:18,607 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 05:54:18,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:54:18,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:54:18,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:54:18,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:54:18,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:54:18,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:54:18,609 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 05:54:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:54:18,615 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-01-21 05:54:18,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:54:18,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-01-21 05:54:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:54:18,618 INFO L225 Difference]: With dead ends: 75 [2018-01-21 05:54:18,618 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 05:54:18,619 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 05:54:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 05:54:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-21 05:54:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-21 05:54:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-21 05:54:18,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 28 [2018-01-21 05:54:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:54:18,630 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-21 05:54:18,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:54:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-21 05:54:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 05:54:18,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:18,631 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] [2018-01-21 05:54:18,631 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:54:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1417341781, now seen corresponding path program 1 times [2018-01-21 05:54:18,632 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:18,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:18,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:54:18,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:54:18,758 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 05:54:18,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:54:18,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:54:18,759 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:54:18,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:54:18,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:54:18,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:54:18,761 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-21 05:54:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:54:18,905 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-01-21 05:54:18,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:54:18,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 05:54:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:54:18,910 INFO L225 Difference]: With dead ends: 67 [2018-01-21 05:54:18,910 INFO L226 Difference]: Without dead ends: 49 [2018-01-21 05:54:18,912 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:54:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-21 05:54:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-01-21 05:54:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 05:54:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-21 05:54:18,919 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2018-01-21 05:54:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:54:18,919 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-21 05:54:18,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:54:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-21 05:54:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 05:54:18,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:18,921 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:54:18,921 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:54:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1542466606, now seen corresponding path program 1 times [2018-01-21 05:54:18,921 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:18,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:18,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:18,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:54:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:54:18,991 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:54:19,001 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:54:19,008 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:54:19,011 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:54:19,011 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:54:19,026 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:54:19,026 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:54:19,027 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:54:19,027 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:54:19,027 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:54:19,027 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:54:19,027 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:54:19,027 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:54:19,027 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:54:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 05:54:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 05:54:19,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:19,030 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] [2018-01-21 05:54:19,030 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:54:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash -308274780, now seen corresponding path program 1 times [2018-01-21 05:54:19,031 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:19,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:19,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:19,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:19,032 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:54:19,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:54:19,054 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 05:54:19,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:54:19,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:54:19,055 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:54:19,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:54:19,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:54:19,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:54:19,056 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 05:54:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:54:19,061 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-01-21 05:54:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:54:19,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 05:54:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:54:19,063 INFO L225 Difference]: With dead ends: 75 [2018-01-21 05:54:19,063 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 05:54:19,063 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 05:54:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 05:54:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-21 05:54:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 05:54:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-21 05:54:19,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 26 [2018-01-21 05:54:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:54:19,069 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-21 05:54:19,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:54:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-21 05:54:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 05:54:19,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:19,070 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] [2018-01-21 05:54:19,071 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:54:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 198122686, now seen corresponding path program 1 times [2018-01-21 05:54:19,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:19,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:19,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:19,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:19,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:54:19,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:54:19,147 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 05:54:19,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:54:19,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:54:19,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:54:19,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:54:19,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:54:19,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:54:19,150 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-01-21 05:54:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:54:19,213 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-21 05:54:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:54:19,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-21 05:54:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:54:19,214 INFO L225 Difference]: With dead ends: 63 [2018-01-21 05:54:19,214 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 05:54:19,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:54:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 05:54:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-01-21 05:54:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-21 05:54:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-21 05:54:19,219 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 30 [2018-01-21 05:54:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:54:19,220 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-21 05:54:19,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:54:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-21 05:54:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 05:54:19,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:54:19,221 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:54:19,221 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 05:54:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash 555794391, now seen corresponding path program 1 times [2018-01-21 05:54:19,221 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:54:19,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:19,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:54:19,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:54:19,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:54:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:54:19,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:54:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 05:54:19,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:54:19,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 05:54:19,602 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:54:19,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 05:54:19,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 05:54:19,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-21 05:54:19,603 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-01-21 05:54:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:54:19,970 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-21 05:54:19,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 05:54:19,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-21 05:54:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:54:19,972 INFO L225 Difference]: With dead ends: 39 [2018-01-21 05:54:19,972 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:54:19,972 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-21 05:54:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:54:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:54:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:54:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:54:19,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-21 05:54:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:54:19,973 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:54:19,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 05:54:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:54:19,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:54:19,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:54:19 BoogieIcfgContainer [2018-01-21 05:54:19,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:54:19,978 INFO L168 Benchmark]: Toolchain (without parser) took 2326.35 ms. Allocated memory was 296.7 MB in the beginning and 466.6 MB in the end (delta: 169.9 MB). Free memory was 254.9 MB in the beginning and 421.8 MB in the end (delta: -166.9 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:54:19,979 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 296.7 MB. Free memory is still 260.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:54:19,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.22 ms. Allocated memory is still 296.7 MB. Free memory was 253.9 MB in the beginning and 244.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:54:19,979 INFO L168 Benchmark]: Boogie Preprocessor took 31.29 ms. Allocated memory is still 296.7 MB. Free memory was 244.0 MB in the beginning and 241.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:54:19,979 INFO L168 Benchmark]: RCFGBuilder took 238.18 ms. Allocated memory is still 296.7 MB. Free memory was 241.9 MB in the beginning and 224.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:54:19,979 INFO L168 Benchmark]: TraceAbstraction took 1847.64 ms. Allocated memory was 296.7 MB in the beginning and 466.6 MB in the end (delta: 169.9 MB). Free memory was 224.9 MB in the beginning and 421.8 MB in the end (delta: -196.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:54:19,981 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.12 ms. Allocated memory is still 296.7 MB. Free memory is still 260.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.22 ms. Allocated memory is still 296.7 MB. Free memory was 253.9 MB in the beginning and 244.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.29 ms. Allocated memory is still 296.7 MB. Free memory was 244.0 MB in the beginning and 241.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 238.18 ms. Allocated memory is still 296.7 MB. Free memory was 241.9 MB in the beginning and 224.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1847.64 ms. Allocated memory was 296.7 MB in the beginning and 466.6 MB in the end (delta: 169.9 MB). Free memory was 224.9 MB in the beginning and 421.8 MB in the end (delta: -196.9 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) - 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=7, \old(a)=4, \old(b)=2, \old(b)=3, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 43 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=43occurred 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: 622]: 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: fooErr0EnsuresViolation CFG has 4 procedures, 43 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={8:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={0:0}, malloc(n * sizeof(*a))={8:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={0:0}, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, b++={14:0}, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, b++={14:0}, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L640] FCALL b[-2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, b[-2]=6, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L640] COND TRUE b[-2] [L641] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L641] FCALL free(b-1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={8:0}, b={14:4}, malloc(n * sizeof(*a))={8:0}, malloc(n * sizeof(*b))={14:0}, n=1] [L644] return 0; VAL [a={8:0}, b={14:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 43 locations, 4 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 44 SDslu, 52 SDs, 0 SdLazy, 43 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 630]: 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, 43 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 SDtfs, 69 SDslu, 95 SDs, 0 SdLazy, 218 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 11857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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/960521-1_1_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-54-19-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-54-19-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-54-19-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-54-19-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-54-19-989.csv Received shutdown request...