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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:55:53,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:55:53,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:55:53,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:55:53,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:55:53,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:55:53,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:55:53,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:55:53,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:55:53,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:55:53,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:55:53,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:55:53,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:55:53,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:55:53,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:55:53,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:55:53,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:55:53,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:55:53,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:55:53,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:55:53,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:55:53,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:55:53,863 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:55:53,864 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:55:53,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:55:53,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:55:53,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:55:53,867 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:55:53,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:55:53,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:55:53,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:55:53,869 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_imprecise.epf [2018-01-21 00:55:53,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:55:53,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:55:53,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:55:53,879 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:55:53,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:55:53,879 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:55:53,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:55:53,879 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:55:53,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:55:53,880 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:55:53,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:55:53,880 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:55:53,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:55:53,880 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:55:53,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:55:53,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:55:53,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:55:53,881 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:55:53,881 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:55:53,881 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:55:53,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:55:53,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:55:53,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:55:53,882 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:55:53,882 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:55:53,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:55:53,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:55:53,883 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:55:53,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:55:53,884 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:55:53,884 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:55:53,884 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:55:53,885 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:55:53,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:55:53,929 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:55:53,933 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:55:53,934 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:55:53,934 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:55:53,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-21 00:55:54,113 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:55:54,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:55:54,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:55:54,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:55:54,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:55:54,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba505b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54, skipping insertion in model container [2018-01-21 00:55:54,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,141 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:55:54,187 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:55:54,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:55:54,325 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:55:54,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54 WrapperNode [2018-01-21 00:55:54,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:55:54,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:55:54,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:55:54,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:55:54,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (1/1) ... [2018-01-21 00:55:54,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:55:54,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:55:54,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:55:54,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:55:54,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (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 00:55:54,415 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:55:54,415 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:55:54,415 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 00:55:54,416 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 00:55:54,416 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:55:54,416 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:55:54,416 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:55:54,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:55:54,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:55:54,416 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:55:54,417 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:55:54,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:55:54,593 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:55:54,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:55:54 BoogieIcfgContainer [2018-01-21 00:55:54,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:55:54,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:55:54,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:55:54,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:55:54,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:55:54" (1/3) ... [2018-01-21 00:55:54,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d512af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:55:54, skipping insertion in model container [2018-01-21 00:55:54,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:54" (2/3) ... [2018-01-21 00:55:54,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d512af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:55:54, skipping insertion in model container [2018-01-21 00:55:54,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:55:54" (3/3) ... [2018-01-21 00:55:54,601 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-21 00:55:54,609 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:55:54,617 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-21 00:55:54,665 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:54,666 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:54,666 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:54,666 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:54,666 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:54,666 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:54,666 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:54,666 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 00:55:54,667 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-21 00:55:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 00:55:54,690 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:54,691 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:54,691 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:55:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash 301069136, now seen corresponding path program 1 times [2018-01-21 00:55:54,697 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:54,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:54,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:54,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:54,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:54,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:54,863 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 00:55:54,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:54,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:54,865 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:54,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:55:54,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:55:54,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:54,880 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-01-21 00:55:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:55,058 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-01-21 00:55:55,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:55:55,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 00:55:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:55,068 INFO L225 Difference]: With dead ends: 59 [2018-01-21 00:55:55,068 INFO L226 Difference]: Without dead ends: 25 [2018-01-21 00:55:55,072 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 00:55:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-21 00:55:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-21 00:55:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-21 00:55:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-21 00:55:55,107 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2018-01-21 00:55:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:55,107 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-21 00:55:55,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:55:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-21 00:55:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 00:55:55,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:55,109 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:55,110 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:55:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1564537906, now seen corresponding path program 1 times [2018-01-21 00:55:55,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:55,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:55,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:55,174 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:55,181 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,183 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,194 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:55,195 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:55,195 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:55,195 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:55,195 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:55,195 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:55,195 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:55,195 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:55:55,195 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-21 00:55:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:55:55,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:55,198 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:55:55,198 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:55:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2018-01-21 00:55:55,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:55,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:55,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:55,210 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:55,211 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,213 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:55,213 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:55,213 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:55,214 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:55,214 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:55,214 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:55,214 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:55,214 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:55:55,214 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-21 00:55:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:55:55,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:55,217 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:55,218 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:55:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1578256570, now seen corresponding path program 1 times [2018-01-21 00:55:55,218 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:55,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:55,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,220 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:55,251 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:55,253 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,254 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,254 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,255 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,255 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:55,259 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:55,259 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:55,259 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:55,259 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:55,259 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:55,259 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:55,260 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:55,260 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:55:55,260 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-21 00:55:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:55:55,262 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:55,263 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:55,263 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:55:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2036344255, now seen corresponding path program 1 times [2018-01-21 00:55:55,263 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:55,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:55,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,265 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:55,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:55,314 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 00:55:55,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:55,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:55,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:55,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:55:55,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:55:55,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:55,316 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-01-21 00:55:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:55,395 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-01-21 00:55:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:55:55,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 00:55:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:55,396 INFO L225 Difference]: With dead ends: 59 [2018-01-21 00:55:55,396 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:55,397 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 00:55:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:55,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 00:55:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:55,397 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:55,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:55:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:55,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:55,400 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:55,400 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:55,400 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:55,400 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:55,400 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:55,400 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:55,400 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:55,400 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 00:55:55,400 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-21 00:55:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:55:55,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:55,402 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:55,402 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 373068292, now seen corresponding path program 1 times [2018-01-21 00:55:55,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:55,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:55,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:55,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:55,442 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 00:55:55,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:55,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:55,442 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:55,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:55:55,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:55:55,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:55,443 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-01-21 00:55:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:55,480 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-01-21 00:55:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:55:55,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 00:55:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:55,481 INFO L225 Difference]: With dead ends: 59 [2018-01-21 00:55:55,481 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 00:55:55,482 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 00:55:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 00:55:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-01-21 00:55:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 00:55:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-21 00:55:55,489 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-01-21 00:55:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:55,490 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-21 00:55:55,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:55:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-21 00:55:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:55:55,492 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:55,492 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:55,492 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1523871265, now seen corresponding path program 1 times [2018-01-21 00:55:55,492 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:55,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:55,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:55,494 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:55,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:55,579 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 00:55:55,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:55:55,580 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:55:55,581 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-21 00:55:55,582 INFO L201 CegarAbsIntRunner]: [3], [9], [10], [12], [13], [19], [21], [25], [29], [34], [36], [39], [48], [52], [55], [66], [68], [69], [71], [72], [73], [75], [76], [77], [78] [2018-01-21 00:55:55,626 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:55:55,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:55:55,721 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:55:55,722 INFO L268 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 17 variables. [2018-01-21 00:55:55,735 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:55:55,807 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 51.43% of their original sizes. [2018-01-21 00:55:55,807 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:55:55,866 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:55:55,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:55:55,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2018-01-21 00:55:55,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:55,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 00:55:55,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 00:55:55,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:55:55,868 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2018-01-21 00:55:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:56,420 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-21 00:55:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:55:56,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-21 00:55:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:56,424 INFO L225 Difference]: With dead ends: 65 [2018-01-21 00:55:56,424 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 00:55:56,425 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:55:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 00:55:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-01-21 00:55:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 00:55:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-21 00:55:56,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2018-01-21 00:55:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:56,433 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-21 00:55:56,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 00:55:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-21 00:55:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:55:56,434 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:56,434 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, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:56,435 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1070658177, now seen corresponding path program 1 times [2018-01-21 00:55:56,436 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:56,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:56,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:56,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:56,438 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:56,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:56,486 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 00:55:56,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:55:56,487 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:55:56,487 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-21 00:55:56,487 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [9], [10], [12], [13], [19], [21], [25], [29], [34], [36], [39], [48], [52], [55], [66], [68], [69], [71], [72], [73], [75], [76], [77], [78] [2018-01-21 00:55:56,489 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:55:56,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:55:56,526 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:55:56,526 INFO L268 AbstractInterpreter]: Visited 17 different actions 18 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-21 00:55:56,529 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:55:56,567 INFO L232 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.08% of their original sizes. [2018-01-21 00:55:56,567 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:55:56,647 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:55:56,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:55:56,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2018-01-21 00:55:56,647 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:56,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 00:55:56,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 00:55:56,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:55:56,648 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2018-01-21 00:55:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:55:56,982 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 00:55:56,985 INFO L168 Benchmark]: Toolchain (without parser) took 2871.67 ms. Allocated memory was 300.4 MB in the beginning and 474.0 MB in the end (delta: 173.5 MB). Free memory was 257.7 MB in the beginning and 354.0 MB in the end (delta: -96.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:56,986 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:55:56,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.04 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 244.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:56,987 INFO L168 Benchmark]: Boogie Preprocessor took 34.31 ms. Allocated memory is still 300.4 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:56,987 INFO L168 Benchmark]: RCFGBuilder took 224.30 ms. Allocated memory is still 300.4 MB. Free memory was 242.7 MB in the beginning and 226.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:56,987 INFO L168 Benchmark]: TraceAbstraction took 2390.14 ms. Allocated memory was 300.4 MB in the beginning and 474.0 MB in the end (delta: 173.5 MB). Free memory was 226.0 MB in the beginning and 354.0 MB in the end (delta: -128.0 MB). Peak memory consumption was 45.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:56,989 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.16 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.04 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 244.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.31 ms. Allocated memory is still 300.4 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.30 ms. Allocated memory is still 300.4 MB. Free memory was 242.7 MB in the beginning and 226.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2390.14 ms. Allocated memory was 300.4 MB in the beginning and 474.0 MB in the end (delta: 173.5 MB). Free memory was 226.0 MB in the beginning and 354.0 MB in the end (delta: -128.0 MB). Peak memory consumption was 45.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 13 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 62 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -26 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 28 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.904826 RENAME_VARIABLES(MILLISECONDS) : 0.184214 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.348556 PROJECTAWAY(MILLISECONDS) : 0.038913 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.009488 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.224430 ADD_EQUALITY(MILLISECONDS) : 0.028424 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012582 #CONJOIN_DISJUNCTIVE : 21 #RENAME_VARIABLES : 43 #UNFREEZE : 0 #CONJOIN : 44 #PROJECTAWAY : 44 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 42 #ADD_EQUALITY : 28 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 80 LocStat_NO_SUPPORTING_DISEQUALITIES : 2 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 25 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 26 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.398079 RENAME_VARIABLES(MILLISECONDS) : 0.078796 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.182589 PROJECTAWAY(MILLISECONDS) : 0.011625 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001201 DISJOIN(MILLISECONDS) : 2.656859 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.099888 ADD_EQUALITY(MILLISECONDS) : 0.021581 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011815 #CONJOIN_DISJUNCTIVE : 34 #RENAME_VARIABLES : 53 #UNFREEZE : 0 #CONJOIN : 60 #PROJECTAWAY : 51 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 52 #ADD_EQUALITY : 40 #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: [L1461] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL ldv_malloc(sizeof(struct A18*)*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 5 procedures, 42 locations, 5 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 21 SDslu, 7 SDs, 0 SdLazy, 20 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=42occurred 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 5 procedures, 42 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=42occurred 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: [L1461] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={0:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; [L1443] int j; VAL [array={0:0}, i=0, len=10] [L1444] COND TRUE, RET !array VAL [array={0:0}, i=0, len=10] [L1461] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 42 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=42occurred 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: 1460]: 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, 42 locations, 5 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 16 SDslu, 7 SDs, 0 SdLazy, 20 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=42occurred 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 - 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_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-55-57-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-55-57-000.csv Received shutdown request...