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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:38:02,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:38:02,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:38:02,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:38:02,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:38:02,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:38:02,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:38:02,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:38:02,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:38:02,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:38:02,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:38:02,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:38:02,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:38:02,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:38:02,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:38:02,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:38:02,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:38:02,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:38:02,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:38:02,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:38:02,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:38:02,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:38:02,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:38:02,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:38:02,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:38:02,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:38:02,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:38:02,207 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:38:02,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:38:02,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:38:02,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:38:02,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:38:02,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:38:02,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:38:02,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:38:02,221 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:38:02,223 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:38:02,224 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:38:02,224 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:38:02,224 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:38:02,224 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:38:02,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:38:02,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:38:02,225 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:38:02,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:38:02,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:38:02,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:38:02,226 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:38:02,226 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:38:02,227 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:38:02,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:38:02,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:38:02,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:38:02,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:38:02,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:38:02,228 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:38:02,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:38:02,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:38:02,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:38:02,229 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:38:02,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:38:02,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:38:02,230 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:38:02,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:38:02,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:38:02,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:38:02,230 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:38:02,233 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:38:02,234 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:38:02,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:38:02,305 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:38:02,311 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:38:02,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:38:02,313 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:38:02,313 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-25 03:38:02,529 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:38:02,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:38:02,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:02,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:38:02,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:38:02,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239c3b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02, skipping insertion in model container [2018-01-25 03:38:02,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,563 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:02,621 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:02,740 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:02,754 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:02,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02 WrapperNode [2018-01-25 03:38:02,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:02,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:38:02,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:38:02,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:38:02,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (1/1) ... [2018-01-25 03:38:02,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:38:02,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:38:02,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:38:02,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:38:02,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (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-25 03:38:02,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:38:02,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:38:02,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:38:02,859 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:38:02,859 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:38:02,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:38:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:38:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:38:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:38:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:38:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:38:02,860 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:38:02,861 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:38:02,861 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:38:02,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:38:02,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:38:03,012 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:38:03,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:03 BoogieIcfgContainer [2018-01-25 03:38:03,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:38:03,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:38:03,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:38:03,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:38:03,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:38:02" (1/3) ... [2018-01-25 03:38:03,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70852702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:03, skipping insertion in model container [2018-01-25 03:38:03,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:02" (2/3) ... [2018-01-25 03:38:03,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70852702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:03, skipping insertion in model container [2018-01-25 03:38:03,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:03" (3/3) ... [2018-01-25 03:38:03,019 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-25 03:38:03,026 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:38:03,036 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-25 03:38:03,081 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:38:03,081 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:38:03,081 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:38:03,082 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:38:03,082 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:38:03,082 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:38:03,082 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:38:03,082 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:38:03,083 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:38:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-25 03:38:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 03:38:03,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:03,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:03,111 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-01-25 03:38:03,132 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:03,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:03,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,212 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:03,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:03,377 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-25 03:38:03,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:03,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:38:03,380 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:03,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:38:03,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:38:03,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:38:03,402 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-25 03:38:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:03,593 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-01-25 03:38:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:38:03,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-25 03:38:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:03,606 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:38:03,607 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 03:38:03,610 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-25 03:38:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 03:38:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-25 03:38:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:38:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-25 03:38:03,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-01-25 03:38:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:03,649 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-25 03:38:03,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:38:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-25 03:38:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:38:03,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:03,651 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-25 03:38:03,651 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-01-25 03:38:03,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:03,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:03,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:03,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:03,744 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-25 03:38:03,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:03,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:03,745 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:03,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:03,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:03,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:03,747 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-01-25 03:38:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:03,827 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-25 03:38:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:03,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 03:38:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:03,829 INFO L225 Difference]: With dead ends: 44 [2018-01-25 03:38:03,830 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 03:38:03,831 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:38:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 03:38:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-01-25 03:38:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-25 03:38:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-25 03:38:03,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-01-25 03:38:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:03,839 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-25 03:38:03,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-25 03:38:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:38:03,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:03,840 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:03,840 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-01-25 03:38:03,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:03,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:03,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:03,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:38:03,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:03,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:38:03,924 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:03,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:38:03,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:38:03,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:03,925 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-25 03:38:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:03,942 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-25 03:38:03,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:03,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:38:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:03,944 INFO L225 Difference]: With dead ends: 33 [2018-01-25 03:38:03,944 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 03:38:03,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 03:38:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-01-25 03:38:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:38:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-25 03:38:03,950 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-01-25 03:38:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:03,951 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-25 03:38:03,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:38:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-25 03:38:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:38:03,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:03,952 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:03,952 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-01-25 03:38:03,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:03,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:03,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:03,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:03,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:38:04,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:04,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:38:04,011 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:04,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:38:04,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:38:04,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:04,012 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-01-25 03:38:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:04,034 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 03:38:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:04,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:38:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:04,036 INFO L225 Difference]: With dead ends: 37 [2018-01-25 03:38:04,036 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 03:38:04,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 03:38:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-25 03:38:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:38:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-25 03:38:04,043 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-25 03:38:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:04,043 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-25 03:38:04,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:38:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-25 03:38:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:38:04,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:04,045 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:04,045 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-01-25 03:38:04,046 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:04,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:04,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:04,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:04,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:04,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:04,141 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-25 03:38:04,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:38:04,141 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:38:04,142 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 03:38:04,144 INFO L201 CegarAbsIntRunner]: [0], [6], [7], [8], [9], [17], [20], [22], [23], [27], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-25 03:38:04,192 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:38:04,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:38:04,354 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 03:38:04,356 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-01-25 03:38:04,368 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 03:38:04,494 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 67.92% of their original sizes. [2018-01-25 03:38:04,494 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 03:38:04,577 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 03:38:04,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:38:04,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-25 03:38:04,579 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:04,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:38:04,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:38:04,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:38:04,581 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 7 states. [2018-01-25 03:38:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:05,850 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-01-25 03:38:05,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:38:05,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 03:38:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:05,851 INFO L225 Difference]: With dead ends: 55 [2018-01-25 03:38:05,852 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 03:38:05,853 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:38:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 03:38:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-25 03:38:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:38:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-25 03:38:05,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-01-25 03:38:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:05,859 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-25 03:38:05,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:38:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-25 03:38:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:38:05,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:05,861 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] [2018-01-25 03:38:05,861 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-01-25 03:38:05,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:05,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:05,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:05,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:05,863 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:05,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:06,078 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-25 03:38:06,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:38:06,079 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:38:06,079 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 03:38:06,079 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [17], [20], [22], [23], [27], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-25 03:38:06,080 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:38:06,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:38:07,059 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 03:38:07,060 INFO L268 AbstractInterpreter]: Visited 21 different actions 36 times. Merged at 7 different actions 9 times. Never widened. Never found a fixpoint. Largest state had 16 variables. [2018-01-25 03:38:07,080 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 03:38:07,731 INFO L232 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 70.23% of their original sizes. [2018-01-25 03:38:07,731 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 03:38:08,265 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 03:38:08,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:38:08,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 16 [2018-01-25 03:38:08,266 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:08,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:38:08,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:38:08,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:38:08,267 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2018-01-25 03:38:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:10,289 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-01-25 03:38:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:38:10,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-25 03:38:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:10,290 INFO L225 Difference]: With dead ends: 31 [2018-01-25 03:38:10,290 INFO L226 Difference]: Without dead ends: 28 [2018-01-25 03:38:10,291 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:38:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-25 03:38:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-01-25 03:38:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 03:38:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-25 03:38:10,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2018-01-25 03:38:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:10,296 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-25 03:38:10,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:38:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-25 03:38:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:38:10,297 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:10,297 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] [2018-01-25 03:38:10,297 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:38:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-01-25 03:38:10,298 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:10,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:10,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:10,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:10,300 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:10,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:38:10,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:38:10,904 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:38:10,904 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 03:38:10,904 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [17], [20], [22], [23], [28], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-25 03:38:10,905 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:38:10,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:38:12,048 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 03:38:12,048 INFO L268 AbstractInterpreter]: Visited 21 different actions 36 times. Merged at 7 different actions 9 times. Never widened. Never found a fixpoint. Largest state had 16 variables. [2018-01-25 03:38:12,050 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 03:38:12,555 INFO L232 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 72.13% of their original sizes. [2018-01-25 03:38:12,555 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 03:38:13,219 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 03:38:13,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:38:13,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 23 [2018-01-25 03:38:13,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:13,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 03:38:13,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 03:38:13,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:38:13,220 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 16 states. [2018-01-25 03:38:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:38:15,458 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:199) 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:564) 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:149) 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-25 03:38:15,462 INFO L168 Benchmark]: Toolchain (without parser) took 12931.89 ms. Allocated memory was 296.2 MB in the beginning and 771.8 MB in the end (delta: 475.5 MB). Free memory was 255.1 MB in the beginning and 454.4 MB in the end (delta: -199.2 MB). Peak memory consumption was 276.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:15,463 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 296.2 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:15,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.24 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 241.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:15,463 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 296.2 MB. Free memory is still 241.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:15,463 INFO L168 Benchmark]: RCFGBuilder took 208.09 ms. Allocated memory is still 296.2 MB. Free memory was 241.1 MB in the beginning and 226.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:15,464 INFO L168 Benchmark]: TraceAbstraction took 12448.10 ms. Allocated memory was 296.2 MB in the beginning and 771.8 MB in the end (delta: 475.5 MB). Free memory was 226.1 MB in the beginning and 454.4 MB in the end (delta: -228.3 MB). Peak memory consumption was 247.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:15,465 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.15 ms. Allocated memory is still 296.2 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.24 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 241.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 296.2 MB. Free memory is still 241.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 208.09 ms. Allocated memory is still 296.2 MB. Free memory was 241.1 MB in the beginning and 226.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12448.10 ms. Allocated memory was 296.2 MB in the beginning and 771.8 MB in the end (delta: 475.5 MB). Free memory was 226.1 MB in the beginning and 454.4 MB in the end (delta: -228.3 MB). Peak memory consumption was 247.3 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 : 57 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 : 24 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.859259 RENAME_VARIABLES(MILLISECONDS) : 0.153090 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.317162 PROJECTAWAY(MILLISECONDS) : 0.032052 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.867476 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.201495 ADD_EQUALITY(MILLISECONDS) : 0.042624 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016511 #CONJOIN_DISJUNCTIVE : 20 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 42 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 24 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 95 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 55 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.122218 RENAME_VARIABLES(MILLISECONDS) : 0.048296 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.099657 PROJECTAWAY(MILLISECONDS) : 8.867148 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.084858 DISJOIN(MILLISECONDS) : 0.543698 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.061981 ADD_EQUALITY(MILLISECONDS) : 0.019799 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012838 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 144 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 98 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 55 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.113351 RENAME_VARIABLES(MILLISECONDS) : 0.061223 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.089519 PROJECTAWAY(MILLISECONDS) : 12.123079 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.084927 DISJOIN(MILLISECONDS) : 0.556182 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.080459 ADD_EQUALITY(MILLISECONDS) : 0.013016 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.037670 #CONJOIN_DISJUNCTIVE : 64 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 145 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-38-15-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-38-15-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-38-15-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_03-38-15-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_03-38-15-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_03-38-15-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_03-38-15-479.csv Received shutdown request...