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/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 06:10:41,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 06:10:41,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 06:10:41,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 06:10:41,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 06:10:41,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 06:10:41,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 06:10:41,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 06:10:41,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 06:10:41,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 06:10:41,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 06:10:41,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 06:10:41,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 06:10:41,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 06:10:41,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 06:10:41,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 06:10:41,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 06:10:41,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 06:10:41,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 06:10:41,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 06:10:41,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 06:10:41,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 06:10:41,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 06:10:41,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 06:10:41,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 06:10:41,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 06:10:41,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 06:10:41,588 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 06:10:41,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 06:10:41,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 06:10:41,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 06:10:41,590 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 06:10:41,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 06:10:41,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 06:10:41,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 06:10:41,601 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 06:10:41,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 06:10:41,601 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 06:10:41,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 06:10:41,602 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 06:10:41,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 06:10:41,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 06:10:41,603 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 06:10:41,603 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 06:10:41,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 06:10:41,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 06:10:41,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 06:10:41,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 06:10:41,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 06:10:41,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 06:10:41,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 06:10:41,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 06:10:41,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 06:10:41,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 06:10:41,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 06:10:41,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 06:10:41,605 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 06:10:41,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 06:10:41,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 06:10:41,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 06:10:41,606 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 06:10:41,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 06:10:41,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 06:10:41,607 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 06:10:41,607 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 06:10:41,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 06:10:41,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 06:10:41,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 06:10:41,608 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 06:10:41,608 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 06:10:41,609 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 06:10:41,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 06:10:41,657 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 06:10:41,661 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 06:10:41,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 06:10:41,663 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 06:10:41,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-21 06:10:41,869 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 06:10:41,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 06:10:41,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 06:10:41,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 06:10:41,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 06:10:41,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:10:41" (1/1) ... [2018-01-21 06:10:41,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66778ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:41, skipping insertion in model container [2018-01-21 06:10:41,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:10:41" (1/1) ... [2018-01-21 06:10:41,898 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:10:41,948 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:10:42,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:10:42,091 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:10:42,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42 WrapperNode [2018-01-21 06:10:42,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 06:10:42,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 06:10:42,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 06:10:42,103 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 06:10:42,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (1/1) ... [2018-01-21 06:10:42,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 06:10:42,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 06:10:42,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 06:10:42,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 06:10:42,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (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 06:10:42,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 06:10:42,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 06:10:42,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 06:10:42,192 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-21 06:10:42,192 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 06:10:42,192 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 06:10:42,193 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 06:10:42,193 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-21 06:10:42,194 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 06:10:42,194 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 06:10:42,194 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 06:10:42,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 06:10:42,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 06:10:42,453 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 06:10:42,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:10:42 BoogieIcfgContainer [2018-01-21 06:10:42,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 06:10:42,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 06:10:42,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 06:10:42,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 06:10:42,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 06:10:41" (1/3) ... [2018-01-21 06:10:42,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15848ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:10:42, skipping insertion in model container [2018-01-21 06:10:42,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:10:42" (2/3) ... [2018-01-21 06:10:42,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15848ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:10:42, skipping insertion in model container [2018-01-21 06:10:42,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:10:42" (3/3) ... [2018-01-21 06:10:42,462 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-21 06:10:42,470 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 06:10:42,477 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 06:10:42,517 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:42,517 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:42,517 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:42,518 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:42,518 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:42,518 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:42,518 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:42,518 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 06:10:42,519 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 06:10:42,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:42,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:42,546 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:10:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1596927186, now seen corresponding path program 1 times [2018-01-21 06:10:42,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:42,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:42,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:42,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:42,602 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:42,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:42,707 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 06:10:42,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:42,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:10:42,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:42,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:10:42,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:10:42,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:10:42,727 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-21 06:10:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,010 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 06:10:43,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:10:43,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 06:10:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,021 INFO L225 Difference]: With dead ends: 125 [2018-01-21 06:10:43,021 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 06:10:43,024 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:10:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 06:10:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 06:10:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 06:10:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 06:10:43,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 06:10:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,062 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 06:10:43,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:10:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 06:10:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 06:10:43,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,064 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:43,064 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:10:43,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1343609524, now seen corresponding path program 1 times [2018-01-21 06:10:43,065 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:10:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:10:43,138 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:10:43,148 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,150 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,165 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:43,165 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:43,165 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:43,165 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:43,166 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:43,166 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:43,166 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:43,166 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 06:10:43,166 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 06:10:43,169 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,169 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 06:10:43,169 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 06:10:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 142100, now seen corresponding path program 1 times [2018-01-21 06:10:43,170 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,172 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:10:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:10:43,185 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:10:43,186 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,188 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:43,188 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:43,189 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:43,189 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:43,189 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:43,189 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:43,189 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:43,189 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 06:10:43,189 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 06:10:43,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,193 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 06:10:43,193 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 06:10:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1836971356, now seen corresponding path program 1 times [2018-01-21 06:10:43,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,195 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:10:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:10:43,227 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:10:43,229 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,230 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,231 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,231 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,231 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:10:43,235 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:43,235 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:43,235 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:43,235 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:43,235 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:43,235 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:43,235 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:43,236 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 06:10:43,236 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 06:10:43,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,239 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:43,239 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 06:10:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1817080875, now seen corresponding path program 1 times [2018-01-21 06:10:43,240 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,242 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,293 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 06:10:43,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:10:43,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:10:43,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:10:43,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:10:43,297 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-21 06:10:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,385 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 06:10:43,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:10:43,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 06:10:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,386 INFO L225 Difference]: With dead ends: 125 [2018-01-21 06:10:43,387 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:10:43,388 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:10:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:10:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:10:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:10:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:10:43,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 06:10:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,389 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:10:43,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:10:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:10:43,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:10:43,392 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:43,392 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:43,392 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:43,392 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:43,392 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:43,392 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:43,393 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:43,393 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 06:10:43,393 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 06:10:43,396 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,396 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 06:10:43,397 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 06:10:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1304963802, now seen corresponding path program 1 times [2018-01-21 06:10:43,397 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,435 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 06:10:43,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:10:43,435 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 06:10:43,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 06:10:43,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:10:43,436 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-21 06:10:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,444 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-01-21 06:10:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 06:10:43,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-01-21 06:10:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,446 INFO L225 Difference]: With dead ends: 113 [2018-01-21 06:10:43,446 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 06:10:43,447 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 06:10:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 06:10:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-21 06:10:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 06:10:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-21 06:10:43,455 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-21 06:10:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,456 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-21 06:10:43,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 06:10:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-21 06:10:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 06:10:43,458 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,458 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 06:10:43,458 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 06:10:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1633263304, now seen corresponding path program 1 times [2018-01-21 06:10:43,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,460 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,557 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 06:10:43,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:10:43,558 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:10:43,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:10:43,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:10:43,558 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 5 states. [2018-01-21 06:10:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,581 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-01-21 06:10:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:10:43,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 06:10:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,584 INFO L225 Difference]: With dead ends: 94 [2018-01-21 06:10:43,584 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 06:10:43,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:10:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 06:10:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 06:10:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 06:10:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-21 06:10:43,590 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 32 [2018-01-21 06:10:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,590 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-21 06:10:43,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:10:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-21 06:10:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 06:10:43,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,592 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] [2018-01-21 06:10:43,592 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-21 06:10:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2058130582, now seen corresponding path program 1 times [2018-01-21 06:10:43,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,647 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 06:10:43,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:10:43,648 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:10:43,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:10:43,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:10:43,650 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 4 states. [2018-01-21 06:10:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,681 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-01-21 06:10:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:10:43,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-21 06:10:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,682 INFO L225 Difference]: With dead ends: 59 [2018-01-21 06:10:43,682 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:10:43,682 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:10:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:10:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:10:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:10:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:10:43,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-21 06:10:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,683 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:10:43,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:10:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:10:43,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:10:43,684 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:43,684 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:43,684 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:43,684 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:43,685 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:43,685 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:43,685 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:43,685 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 06:10:43,685 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 06:10:43,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,686 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:43,686 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:10:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1485688060, now seen corresponding path program 1 times [2018-01-21 06:10:43,687 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,688 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,724 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 06:10:43,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:10:43,725 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:10:43,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:10:43,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:10:43,725 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-21 06:10:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,803 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 06:10:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:10:43,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 06:10:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,805 INFO L225 Difference]: With dead ends: 125 [2018-01-21 06:10:43,805 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 06:10:43,806 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:10:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 06:10:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-01-21 06:10:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-21 06:10:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-21 06:10:43,811 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 15 [2018-01-21 06:10:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,811 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-21 06:10:43,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:10:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-21 06:10:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 06:10:43,812 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,812 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:43,812 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:10:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1137499751, now seen corresponding path program 1 times [2018-01-21 06:10:43,812 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,814 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,893 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 06:10:43,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:10:43,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:10:43,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:10:43,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:10:43,894 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2018-01-21 06:10:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:43,933 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-01-21 06:10:43,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:10:43,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-21 06:10:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:43,935 INFO L225 Difference]: With dead ends: 100 [2018-01-21 06:10:43,935 INFO L226 Difference]: Without dead ends: 55 [2018-01-21 06:10:43,936 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:10:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-21 06:10:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-21 06:10:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 06:10:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-21 06:10:43,943 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 35 [2018-01-21 06:10:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:43,943 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-21 06:10:43,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:10:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-21 06:10:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 06:10:43,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:43,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:43,946 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:10:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1184856503, now seen corresponding path program 1 times [2018-01-21 06:10:43,946 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:43,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:43,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:43,948 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:43,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:43,989 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 06:10:43,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:43,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:10:43,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:43,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:10:43,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:10:43,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:10:43,990 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 4 states. [2018-01-21 06:10:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:44,014 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-21 06:10:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:10:44,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 06:10:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:44,015 INFO L225 Difference]: With dead ends: 62 [2018-01-21 06:10:44,015 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:10:44,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:10:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:10:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:10:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:10:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:10:44,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 06:10:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:44,016 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:10:44,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:10:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:10:44,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:10:44,018 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:10:44,018 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:10:44,019 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:10:44,019 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:10:44,019 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:10:44,019 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:10:44,019 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:10:44,019 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_unsafe_17Err0EnsuresViolation======== [2018-01-21 06:10:44,019 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:10:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 06:10:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 06:10:44,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:44,022 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] [2018-01-21 06:10:44,022 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_unsafe_17Err0EnsuresViolation]=== [2018-01-21 06:10:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1272018460, now seen corresponding path program 1 times [2018-01-21 06:10:44,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:44,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:44,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:44,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:44,024 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:44,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:44,039 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 06:10:44,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:44,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:10:44,039 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:44,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 06:10:44,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 06:10:44,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:10:44,040 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-21 06:10:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:44,045 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-01-21 06:10:44,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 06:10:44,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 06:10:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:44,046 INFO L225 Difference]: With dead ends: 113 [2018-01-21 06:10:44,046 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 06:10:44,046 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 06:10:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 06:10:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-21 06:10:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-21 06:10:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-21 06:10:44,051 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2018-01-21 06:10:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:44,052 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-21 06:10:44,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 06:10:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-21 06:10:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 06:10:44,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:44,053 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:44,053 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_unsafe_17Err0EnsuresViolation]=== [2018-01-21 06:10:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -184415516, now seen corresponding path program 1 times [2018-01-21 06:10:44,054 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:44,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:44,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:44,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:44,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:44,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:44,148 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 06:10:44,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:44,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:10:44,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:44,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:10:44,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:10:44,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:10:44,150 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-01-21 06:10:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:44,164 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-01-21 06:10:44,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:10:44,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 06:10:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:44,165 INFO L225 Difference]: With dead ends: 72 [2018-01-21 06:10:44,166 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 06:10:44,166 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:10:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 06:10:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 06:10:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 06:10:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 06:10:44,171 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 25 [2018-01-21 06:10:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:44,171 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 06:10:44,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:10:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 06:10:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 06:10:44,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:10:44,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:10:44,173 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_unsafe_17Err0EnsuresViolation]=== [2018-01-21 06:10:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash -169228986, now seen corresponding path program 1 times [2018-01-21 06:10:44,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:10:44,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:44,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:10:44,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:10:44,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:10:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:10:44,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:10:44,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-21 06:10:44,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:10:44,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:10:44,209 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:10:44,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:10:44,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:10:44,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:10:44,210 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-21 06:10:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:10:44,234 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-21 06:10:44,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:10:44,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 06:10:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:10:44,235 INFO L225 Difference]: With dead ends: 48 [2018-01-21 06:10:44,235 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:10:44,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:10:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:10:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:10:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:10:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:10:44,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 06:10:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:10:44,236 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:10:44,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:10:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:10:44,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:10:44,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 06:10:44 BoogieIcfgContainer [2018-01-21 06:10:44,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 06:10:44,239 INFO L168 Benchmark]: Toolchain (without parser) took 2369.32 ms. Allocated memory was 304.1 MB in the beginning and 477.1 MB in the end (delta: 173.0 MB). Free memory was 261.0 MB in the beginning and 429.5 MB in the end (delta: -168.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 5.3 GB. [2018-01-21 06:10:44,240 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 06:10:44,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.85 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 247.7 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-21 06:10:44,240 INFO L168 Benchmark]: Boogie Preprocessor took 37.84 ms. Allocated memory is still 304.1 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:10:44,241 INFO L168 Benchmark]: RCFGBuilder took 313.20 ms. Allocated memory is still 304.1 MB. Free memory was 245.7 MB in the beginning and 224.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:10:44,241 INFO L168 Benchmark]: TraceAbstraction took 1783.27 ms. Allocated memory was 304.1 MB in the beginning and 477.1 MB in the end (delta: 173.0 MB). Free memory was 224.7 MB in the beginning and 429.5 MB in the end (delta: -204.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 06:10:44,242 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.17 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.85 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 247.7 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.84 ms. Allocated memory is still 304.1 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 313.20 ms. Allocated memory is still 304.1 MB. Free memory was 245.7 MB in the beginning and 224.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1783.27 ms. Allocated memory was 304.1 MB in the beginning and 477.1 MB in the end (delta: 173.0 MB). Free memory was 224.7 MB in the beginning and 429.5 MB in the end (delta: -204.8 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) - 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: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 64 locations, 7 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 36 SDslu, 14 SDs, 0 SdLazy, 28 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 64 locations, 7 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=64occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND TRUE, RET !array VAL [array={0:0}, len=10] [L1478] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 64 locations, 7 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=64occurred 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, 19 NumberOfCodeBlocks, 19 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: 1477]: 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 7 procedures, 64 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 31 SDslu, 14 SDs, 0 SdLazy, 28 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 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 - PositiveResult [Line: 1457]: 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: free_17Err0EnsuresViolation CFG has 7 procedures, 64 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 3 SDslu, 166 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 3919 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: 1464]: 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: entry_pointErr0EnsuresViolation CFG has 7 procedures, 64 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 35 SDslu, 188 SDs, 0 SdLazy, 50 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 4148 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: 1439]: 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: alloc_unsafe_17Err0EnsuresViolation CFG has 7 procedures, 64 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 3 SDslu, 130 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 2581 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_06-10-44-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_06-10-44-250.csv Received shutdown request...