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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:41:58,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:41:58,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:41:58,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:41:58,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:41:58,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:41:58,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:41:58,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:41:58,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:41:58,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:41:58,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:41:58,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:41:58,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:41:58,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:41:58,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:41:58,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:41:58,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:41:58,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:41:58,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:41:58,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:41:58,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:41:58,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:41:58,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:41:58,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:41:58,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:41:58,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:41:58,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:41:58,301 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:41:58,301 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:41:58,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:41:58,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:41:58,302 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_smtcomp.epf [2018-01-21 10:41:58,312 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:41:58,313 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:41:58,314 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:41:58,314 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:41:58,314 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:41:58,314 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:41:58,314 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:41:58,315 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:41:58,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:41:58,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:41:58,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:41:58,316 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:41:58,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:41:58,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:41:58,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:41:58,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:41:58,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:41:58,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:41:58,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:41:58,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:41:58,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:41:58,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:41:58,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:41:58,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:41:58,318 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:41:58,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:41:58,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:41:58,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:41:58,319 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:41:58,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:41:58,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:41:58,320 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:41:58,320 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:41:58,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:41:58,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:41:58,321 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:41:58,321 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:41:58,322 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:41:58,322 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:41:58,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:41:58,370 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:41:58,374 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:41:58,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:41:58,376 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:41:58,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-21 10:41:58,606 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:41:58,610 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:41:58,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:41:58,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:41:58,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:41:58,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a855a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58, skipping insertion in model container [2018-01-21 10:41:58,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,635 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:41:58,684 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:41:58,792 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:41:58,804 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:41:58,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58 WrapperNode [2018-01-21 10:41:58,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:41:58,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:41:58,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:41:58,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:41:58,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... [2018-01-21 10:41:58,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:41:58,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:41:58,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:41:58,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:41:58,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:41:58,894 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:41:58,894 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:41:58,894 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 10:41:58,894 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 10:41:58,894 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:41:58,894 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:41:58,895 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:41:58,895 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:41:58,895 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:41:58,895 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:41:58,895 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:41:58,895 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 10:41:58,896 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 10:41:58,896 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:41:58,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:41:58,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:41:59,042 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:41:59,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:41:59 BoogieIcfgContainer [2018-01-21 10:41:59,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:41:59,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:41:59,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:41:59,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:41:59,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:41:58" (1/3) ... [2018-01-21 10:41:59,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fa8ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:41:59, skipping insertion in model container [2018-01-21 10:41:59,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:58" (2/3) ... [2018-01-21 10:41:59,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fa8ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:41:59, skipping insertion in model container [2018-01-21 10:41:59,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:41:59" (3/3) ... [2018-01-21 10:41:59,049 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-21 10:41:59,055 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:41:59,061 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-21 10:41:59,106 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:59,106 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:59,106 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:59,106 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:59,106 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:59,107 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:59,107 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:59,107 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 10:41:59,107 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 10:41:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-21 10:41:59,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:59,130 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:41:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1678209858, now seen corresponding path program 1 times [2018-01-21 10:41:59,139 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:59,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:59,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:59,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:59,292 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:59,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:59,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:59,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:59,307 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-21 10:41:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:59,441 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-21 10:41:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:59,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-21 10:41:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:59,515 INFO L225 Difference]: With dead ends: 34 [2018-01-21 10:41:59,515 INFO L226 Difference]: Without dead ends: 18 [2018-01-21 10:41:59,519 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-01-21 10:41:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-01-21 10:41:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-01-21 10:41:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-01-21 10:41:59,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2018-01-21 10:41:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:59,556 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-01-21 10:41:59,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-01-21 10:41:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 10:41:59,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,557 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:59,557 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:41:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2147030592, now seen corresponding path program 1 times [2018-01-21 10:41:59,557 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:59,625 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:59,632 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,634 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,643 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:59,643 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:59,643 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:59,643 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:59,643 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:59,643 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:59,643 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:59,643 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:41:59,643 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 10:41:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:41:59,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,645 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:41:59,645 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:41:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash 61794, now seen corresponding path program 1 times [2018-01-21 10:41:59,645 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:59,656 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:59,657 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,659 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:59,659 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:59,660 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:59,660 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:59,660 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:59,660 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:59,660 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:59,660 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:41:59,660 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 10:41:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:41:59,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,663 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:59,663 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:41:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1751052127, now seen corresponding path program 1 times [2018-01-21 10:41:59,663 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,665 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:59,688 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:59,690 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,690 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,691 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,691 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,691 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:59,693 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:59,693 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:59,693 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:59,693 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:59,693 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:59,694 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:59,694 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:59,694 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:41:59,694 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 10:41:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 10:41:59,695 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,696 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:59,696 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:41:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash -37576265, now seen corresponding path program 1 times [2018-01-21 10:41:59,696 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,697 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:59,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:59,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:59,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:59,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:59,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:59,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:59,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:59,751 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-21 10:41:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:59,811 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-21 10:41:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:59,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-21 10:41:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:59,813 INFO L225 Difference]: With dead ends: 34 [2018-01-21 10:41:59,813 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:59,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:59,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-21 10:41:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:59,815 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:59,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:59,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:59,818 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:59,818 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:59,818 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:59,818 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:59,818 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:59,819 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:59,819 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:59,819 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 10:41:59,819 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 10:41:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 10:41:59,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,821 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:59,821 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1622383668, now seen corresponding path program 1 times [2018-01-21 10:41:59,822 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,824 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:59,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:59,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:59,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:59,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:59,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:59,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:59,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:59,868 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-21 10:41:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:59,910 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-21 10:41:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:59,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-21 10:41:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:59,912 INFO L225 Difference]: With dead ends: 34 [2018-01-21 10:41:59,912 INFO L226 Difference]: Without dead ends: 22 [2018-01-21 10:41:59,912 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-01-21 10:41:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-01-21 10:41:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-01-21 10:41:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-01-21 10:41:59,918 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-01-21 10:41:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:59,920 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-01-21 10:41:59,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-01-21 10:41:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 10:41:59,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:59,922 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:59,922 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash -115079830, now seen corresponding path program 1 times [2018-01-21 10:41:59,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:59,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:59,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:59,925 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:59,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:42:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:42:00,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:42:00,011 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:42:00,012 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-21 10:42:00,013 INFO L201 CegarAbsIntRunner]: [0], [6], [7], [9], [10], [20], [23], [25], [26], [27], [32], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-21 10:42:00,060 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:42:00,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:42:00,178 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 10:42:00,180 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-01-21 10:42:00,196 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 10:42:00,279 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 51.67% of their original sizes. [2018-01-21 10:42:00,279 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 10:42:00,349 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 10:42:00,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 10:42:00,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-01-21 10:42:00,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:42:00,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 10:42:00,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 10:42:00,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-21 10:42:00,351 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-01-21 10:42:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:42:01,261 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-21 10:42:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 10:42:01,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-21 10:42:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:42:01,264 INFO L225 Difference]: With dead ends: 37 [2018-01-21 10:42:01,264 INFO L226 Difference]: Without dead ends: 23 [2018-01-21 10:42:01,266 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-01-21 10:42:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-21 10:42:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-21 10:42:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-21 10:42:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-01-21 10:42:01,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-01-21 10:42:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:42:01,272 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-01-21 10:42:01,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 10:42:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-01-21 10:42:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:42:01,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:42:01,274 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:42:01,274 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:42:01,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1365971092, now seen corresponding path program 1 times [2018-01-21 10:42:01,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:42:01,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:42:01,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:42:01,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:42:01,277 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:42:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:42:01,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:42:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:42:01,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:42:01,338 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:42:01,338 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-21 10:42:01,338 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [9], [10], [20], [23], [25], [26], [27], [32], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-21 10:42:01,339 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:42:01,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:42:01,397 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 10:42:01,397 INFO L268 AbstractInterpreter]: Visited 16 different actions 17 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-01-21 10:42:01,401 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 10:42:01,463 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 58.25% of their original sizes. [2018-01-21 10:42:01,463 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 10:42:01,670 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 10:42:01,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 10:42:01,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 15 [2018-01-21 10:42:01,671 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:42:01,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 10:42:01,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 10:42:01,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-21 10:42:01,672 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2018-01-21 10:42:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 10:42:02,150 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.copyWeqCc(WeqCcManager.java:1327) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.isStrongerThan(WeqCcManager.java:582) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.isStrongerThan(EqConstraint.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:192) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.getMaximalElements(DisjunctiveAbstractState.java:565) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.crossProduct(DisjunctiveAbstractState.java:407) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.intersect(DisjunctiveAbstractState.java:291) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.lambda$3(CegarAbsIntRunner.java:684) at java.util.stream.ReduceOps$2ReducingSink.accept(ReduceOps.java:123) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.reduce(ReferencePipeline.java:479) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:684) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1054) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:956) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:185) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:552) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:522) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-21 10:42:02,153 INFO L168 Benchmark]: Toolchain (without parser) took 3546.18 ms. Allocated memory was 303.0 MB in the beginning and 511.2 MB in the end (delta: 208.1 MB). Free memory was 260.0 MB in the beginning and 389.1 MB in the end (delta: -129.2 MB). Peak memory consumption was 79.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:42:02,153 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:42:02,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.58 ms. Allocated memory is still 303.0 MB. Free memory was 260.0 MB in the beginning and 247.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:42:02,154 INFO L168 Benchmark]: Boogie Preprocessor took 36.70 ms. Allocated memory is still 303.0 MB. Free memory was 247.8 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:42:02,154 INFO L168 Benchmark]: RCFGBuilder took 194.47 ms. Allocated memory is still 303.0 MB. Free memory was 245.8 MB in the beginning and 231.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:42:02,155 INFO L168 Benchmark]: TraceAbstraction took 3108.69 ms. Allocated memory was 303.0 MB in the beginning and 511.2 MB in the end (delta: 208.1 MB). Free memory was 231.9 MB in the beginning and 389.1 MB in the end (delta: -157.2 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:42:02,156 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.58 ms. Allocated memory is still 303.0 MB. Free memory was 260.0 MB in the beginning and 247.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.70 ms. Allocated memory is still 303.0 MB. Free memory was 247.8 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 194.47 ms. Allocated memory is still 303.0 MB. Free memory was 245.8 MB in the beginning and 231.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3108.69 ms. Allocated memory was 303.0 MB in the beginning and 511.2 MB in the end (delta: 208.1 MB). Free memory was 231.9 MB in the beginning and 389.1 MB in the end (delta: -157.2 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 12 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 58 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -24 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 21 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 26 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.479346 RENAME_VARIABLES(MILLISECONDS) : 0.096873 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.183862 PROJECTAWAY(MILLISECONDS) : 0.021770 ADD_WEAK_EQUALITY(MILLISECONDS) : 3.196691 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.123017 ADD_EQUALITY(MILLISECONDS) : 0.029004 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017258 #CONJOIN_DISJUNCTIVE : 20 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 42 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 26 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 14 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 79 LocStat_NO_SUPPORTING_DISEQUALITIES : 2 LocStat_NO_DISJUNCTIONS : -28 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.193120 RENAME_VARIABLES(MILLISECONDS) : 0.028415 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.059519 PROJECTAWAY(MILLISECONDS) : 0.009109 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.093353 DISJOIN(MILLISECONDS) : 2.306527 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.040829 ADD_EQUALITY(MILLISECONDS) : 0.012467 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005516 #CONJOIN_DISJUNCTIVE : 33 #RENAME_VARIABLES : 51 #UNFREEZE : 0 #CONJOIN : 58 #PROJECTAWAY : 49 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 50 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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: [L1443] CALL entry_point() [L1434] CALL ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 5 procedures, 30 locations, 5 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 8 SDslu, 1 SDs, 0 SdLazy, 19 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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=30occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 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 5 procedures, 30 locations, 5 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=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1443] CALL entry_point() [L1434] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1434] EXPR ldv_malloc(sizeof(int)) VAL [ldv_malloc(sizeof(int))={0:0}] [L1434] int *p = (int *)ldv_malloc(sizeof(int)); [L1435] COND FALSE, RET !(\read(*p)) VAL [p={0:0}] [L1443] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 30 locations, 5 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=30occurred 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, 18 NumberOfCodeBlocks, 18 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: 1442]: 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 5 procedures, 30 locations, 5 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 4 SDslu, 1 SDs, 0 SdLazy, 19 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 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 - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-42-02-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-42-02-168.csv Received shutdown request...