java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:59:06,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:59:06,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:59:06,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:59:06,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:59:06,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:59:06,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:59:06,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:59:06,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:59:06,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:59:06,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:59:06,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:59:06,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:59:06,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:59:06,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:59:06,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:59:06,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:59:06,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:59:06,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:59:06,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:59:06,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:59:06,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:59:06,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:59:06,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:59:06,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:59:06,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:59:06,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:59:06,307 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:59:06,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:59:06,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:59:06,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:59:06,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:59:06,319 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:59:06,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:59:06,320 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:59:06,320 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:59:06,320 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:59:06,321 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:59:06,321 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:59:06,321 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:59:06,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:59:06,322 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:59:06,322 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:59:06,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:59:06,322 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:59:06,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:59:06,323 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:59:06,323 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:59:06,323 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:59:06,323 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:59:06,324 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:59:06,324 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:59:06,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:59:06,324 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:59:06,324 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:59:06,325 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:59:06,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:59:06,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:59:06,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:59:06,325 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:59:06,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:59:06,326 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:59:06,326 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:59:06,326 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:59:06,326 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:59:06,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:59:06,327 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:59:06,327 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:59:06,328 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:59:06,328 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:59:06,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:59:06,372 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:59:06,376 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:59:06,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:59:06,378 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:59:06,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-20 23:59:06,576 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:59:06,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:59:06,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:59:06,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:59:06,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:59:06,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d422d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06, skipping insertion in model container [2018-01-20 23:59:06,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,616 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:59:06,671 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:59:06,789 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:59:06,807 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:59:06,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06 WrapperNode [2018-01-20 23:59:06,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:59:06,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:59:06,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:59:06,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:59:06,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... [2018-01-20 23:59:06,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:59:06,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:59:06,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:59:06,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:59:06,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:59:06,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:59:06,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:59:06,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:59:06,908 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-20 23:59:06,908 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-20 23:59:06,908 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:59:06,908 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:59:06,909 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:59:06,909 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:59:06,909 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:59:06,909 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:59:06,909 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:59:06,909 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:59:06,910 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:59:06,910 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:59:06,910 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:59:06,910 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-20 23:59:06,910 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-20 23:59:06,910 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:59:06,911 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:59:06,911 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:59:06,911 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:59:07,173 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:59:07,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:59:07 BoogieIcfgContainer [2018-01-20 23:59:07,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:59:07,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:59:07,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:59:07,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:59:07,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:59:06" (1/3) ... [2018-01-20 23:59:07,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:59:07, skipping insertion in model container [2018-01-20 23:59:07,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:06" (2/3) ... [2018-01-20 23:59:07,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:59:07, skipping insertion in model container [2018-01-20 23:59:07,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:59:07" (3/3) ... [2018-01-20 23:59:07,183 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-20 23:59:07,192 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:59:07,201 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-20 23:59:07,242 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:07,242 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:07,243 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:07,243 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:07,243 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:07,243 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:07,243 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:07,243 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:59:07,244 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-20 23:59:07,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:07,270 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:07,270 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:59:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1267872988, now seen corresponding path program 1 times [2018-01-20 23:59:07,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:07,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:07,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,326 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:07,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:07,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:07,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:07,457 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:07,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:07,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:07,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:07,474 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 23:59:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:07,761 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-20 23:59:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:07,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-20 23:59:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:07,776 INFO L225 Difference]: With dead ends: 129 [2018-01-20 23:59:07,776 INFO L226 Difference]: Without dead ends: 31 [2018-01-20 23:59:07,781 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-20 23:59:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-20 23:59:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-20 23:59:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-20 23:59:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-20 23:59:07,828 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-20 23:59:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:07,828 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-20 23:59:07,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-20 23:59:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:59:07,831 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:07,831 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:07,831 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:59:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1344677638, now seen corresponding path program 1 times [2018-01-20 23:59:07,831 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:07,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:07,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:07,898 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:07,906 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:07,908 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:07,920 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:07,920 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:07,921 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:07,921 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:07,921 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:07,921 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:07,921 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:07,921 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:59:07,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:59:07,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:07,924 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:59:07,924 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:59:07,925 INFO L82 PathProgramCache]: Analyzing trace with hash 144536, now seen corresponding path program 1 times [2018-01-20 23:59:07,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:07,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:07,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:07,937 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:07,938 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:07,941 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:07,941 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:07,941 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:07,941 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:07,942 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:07,942 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:07,942 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:07,942 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-20 23:59:07,942 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:59:07,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:07,946 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] [2018-01-20 23:59:07,946 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-20 23:59:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 149863804, now seen corresponding path program 1 times [2018-01-20 23:59:07,947 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:07,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:07,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:07,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:07,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:07,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:07,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:07,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:07,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:59:07,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:59:07,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:59:07,987 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-20 23:59:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:07,997 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-20 23:59:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:59:07,997 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 23:59:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:07,999 INFO L225 Difference]: With dead ends: 117 [2018-01-20 23:59:07,999 INFO L226 Difference]: Without dead ends: 41 [2018-01-20 23:59:08,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:59:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-20 23:59:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-20 23:59:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 23:59:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 23:59:08,008 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-20 23:59:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,010 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 23:59:08,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:59:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 23:59:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 23:59:08,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,012 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-20 23:59:08,012 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-20 23:59:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1790905482, now seen corresponding path program 1 times [2018-01-20 23:59:08,012 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:08,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:08,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:08,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:08,100 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-20 23:59:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,115 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-20 23:59:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:08,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-20 23:59:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,118 INFO L225 Difference]: With dead ends: 76 [2018-01-20 23:59:08,118 INFO L226 Difference]: Without dead ends: 43 [2018-01-20 23:59:08,119 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-20 23:59:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-20 23:59:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-20 23:59:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 23:59:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 23:59:08,124 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-20 23:59:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,125 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 23:59:08,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 23:59:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:59:08,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,126 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] [2018-01-20 23:59:08,126 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-20 23:59:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1130115224, now seen corresponding path program 1 times [2018-01-20 23:59:08,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:59:08,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:08,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:08,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:08,182 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 23:59:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,204 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-20 23:59:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:59:08,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-20 23:59:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,205 INFO L225 Difference]: With dead ends: 50 [2018-01-20 23:59:08,205 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:08,205 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-20 23:59:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:08,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-20 23:59:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,206 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:08,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:08,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:08,209 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:08,209 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:08,209 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:08,209 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:08,209 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:08,209 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:08,209 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:08,209 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:59:08,209 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 23:59:08,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,212 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-20 23:59:08,212 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:59:08,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1879772685, now seen corresponding path program 1 times [2018-01-20 23:59:08,212 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:08,237 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:08,239 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:08,239 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:08,240 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:08,240 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:08,240 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:08,243 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:08,243 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:08,243 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:08,243 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:08,243 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:08,243 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:08,243 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:08,243 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:59:08,243 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 23:59:08,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,245 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:08,245 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:59:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1816479186, now seen corresponding path program 1 times [2018-01-20 23:59:08,245 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:08,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:08,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:08,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:08,285 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 23:59:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,423 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-20 23:59:08,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:08,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-20 23:59:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,424 INFO L225 Difference]: With dead ends: 129 [2018-01-20 23:59:08,424 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:08,424 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-20 23:59:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:08,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-20 23:59:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,425 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:08,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:08,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:08,427 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:08,427 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:08,427 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:08,427 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:08,428 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:08,428 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:08,428 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:08,428 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-20 23:59:08,428 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:59:08,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,430 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:08,430 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-20 23:59:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1609342893, now seen corresponding path program 1 times [2018-01-20 23:59:08,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,432 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:08,455 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:59:08,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:59:08,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:59:08,456 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-20 23:59:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,462 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-20 23:59:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:59:08,462 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-20 23:59:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,463 INFO L225 Difference]: With dead ends: 117 [2018-01-20 23:59:08,463 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 23:59:08,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:59:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 23:59:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-20 23:59:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 23:59:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-20 23:59:08,471 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 26 [2018-01-20 23:59:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,471 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-20 23:59:08,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:59:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-20 23:59:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:59:08,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,472 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:08,473 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-20 23:59:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1124045575, now seen corresponding path program 1 times [2018-01-20 23:59:08,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:08,553 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:08,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:08,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:08,554 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-01-20 23:59:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,568 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-20 23:59:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:08,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-20 23:59:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,570 INFO L225 Difference]: With dead ends: 98 [2018-01-20 23:59:08,570 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 23:59:08,571 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-20 23:59:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 23:59:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 23:59:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 23:59:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-20 23:59:08,577 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2018-01-20 23:59:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,577 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-20 23:59:08,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-20 23:59:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 23:59:08,579 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,579 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] [2018-01-20 23:59:08,579 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-20 23:59:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -69053349, now seen corresponding path program 1 times [2018-01-20 23:59:08,580 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:59:08,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:08,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:08,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:08,629 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2018-01-20 23:59:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,662 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-20 23:59:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:59:08,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-20 23:59:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,663 INFO L225 Difference]: With dead ends: 61 [2018-01-20 23:59:08,663 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:08,664 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-20 23:59:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:08,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-20 23:59:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,664 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:08,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:08,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:08,666 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:08,666 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:08,666 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:08,666 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:08,666 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:08,666 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:08,666 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:08,666 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:59:08,666 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:59:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:59:08,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,668 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:08,668 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:59:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -457755615, now seen corresponding path program 1 times [2018-01-20 23:59:08,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,670 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:08,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:08,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:08,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:08,693 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 23:59:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,766 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-20 23:59:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:08,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-20 23:59:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,767 INFO L225 Difference]: With dead ends: 129 [2018-01-20 23:59:08,768 INFO L226 Difference]: Without dead ends: 67 [2018-01-20 23:59:08,768 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-20 23:59:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-20 23:59:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-01-20 23:59:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 23:59:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-20 23:59:08,776 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 15 [2018-01-20 23:59:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,776 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-20 23:59:08,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-20 23:59:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 23:59:08,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,778 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-20 23:59:08,781 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:59:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1418378797, now seen corresponding path program 1 times [2018-01-20 23:59:08,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,784 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:08,869 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:08,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:08,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:08,870 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-20 23:59:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:08,894 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-01-20 23:59:08,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:08,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-20 23:59:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:08,895 INFO L225 Difference]: With dead ends: 104 [2018-01-20 23:59:08,896 INFO L226 Difference]: Without dead ends: 57 [2018-01-20 23:59:08,896 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-20 23:59:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-20 23:59:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-20 23:59:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-20 23:59:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-20 23:59:08,903 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 32 [2018-01-20 23:59:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:08,904 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-20 23:59:08,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-20 23:59:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 23:59:08,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:08,906 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-20 23:59:08,906 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:59:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash 121111435, now seen corresponding path program 1 times [2018-01-20 23:59:08,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:08,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:08,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:08,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:08,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:08,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:08,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:59:08,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:08,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:08,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:08,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:08,982 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2018-01-20 23:59:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:09,058 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-20 23:59:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:59:09,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-20 23:59:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:09,059 INFO L225 Difference]: With dead ends: 64 [2018-01-20 23:59:09,059 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:09,059 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-20 23:59:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:09,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-20 23:59:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:09,060 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:09,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:09,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:09,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:59:09 BoogieIcfgContainer [2018-01-20 23:59:09,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:59:09,064 INFO L168 Benchmark]: Toolchain (without parser) took 2487.73 ms. Allocated memory was 303.6 MB in the beginning and 479.2 MB in the end (delta: 175.6 MB). Free memory was 260.9 MB in the beginning and 441.4 MB in the end (delta: -180.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:09,066 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:09,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.25 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 246.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:09,066 INFO L168 Benchmark]: Boogie Preprocessor took 37.23 ms. Allocated memory is still 303.6 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:09,066 INFO L168 Benchmark]: RCFGBuilder took 318.74 ms. Allocated memory is still 303.6 MB. Free memory was 244.9 MB in the beginning and 224.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:09,066 INFO L168 Benchmark]: TraceAbstraction took 1887.53 ms. Allocated memory was 303.6 MB in the beginning and 479.2 MB in the end (delta: 175.6 MB). Free memory was 224.2 MB in the beginning and 441.4 MB in the end (delta: -217.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:09,068 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.19 ms. Allocated memory is still 303.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 235.25 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 246.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.23 ms. Allocated memory is still 303.6 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 318.74 ms. Allocated memory is still 303.6 MB. Free memory was 244.9 MB in the beginning and 224.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1887.53 ms. Allocated memory was 303.6 MB in the beginning and 479.2 MB in the end (delta: 175.6 MB). Free memory was 224.2 MB in the beginning and 441.4 MB in the end (delta: -217.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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: [L1479] 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, 66 locations, 7 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 37 SDslu, 15 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=66occurred 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, 66 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=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 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_17Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 3 SDslu, 136 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=66occurred 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, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1479] 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 FALSE, RET !(\read(**array)) VAL [array={0:0}, len=10] [L1479] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 66 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=66occurred 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: 1478]: 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, 66 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=66occurred 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, 66 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 141 SDtfs, 3 SDslu, 172 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=66occurred 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, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 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, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 36 SDslu, 195 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=66occurred 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, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 3638 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_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-59-09-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_23-59-09-078.csv Received shutdown request...