java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:52:28,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:52:28,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:52:28,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:52:28,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:52:28,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:52:28,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:52:28,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:52:28,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:52:28,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:52:28,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:52:28,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:52:28,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:52:28,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:52:28,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:52:28,131 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:52:28,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:52:28,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:52:28,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:52:28,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:52:28,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:52:28,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:52:28,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:52:28,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:52:28,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:52:28,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:52:28,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:52:28,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:52:28,167 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:52:28,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:52:28,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:52:28,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:52:28,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:52:28,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:52:28,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:52:28,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:52:28,174 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:52:28,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:52:28,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:52:28,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:52:28,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:52:28,205 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:52:28,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:52:28,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:52:28,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:52:28,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:52:28,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:52:28,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:52:28,207 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:52:28,207 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:52:28,207 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:52:28,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:52:28,208 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:52:28,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:52:28,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:52:28,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:52:28,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:52:28,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:52:28,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:52:28,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:52:28,211 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:52:28,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:52:28,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:52:28,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:52:28,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:52:28,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:52:28,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:52:28,289 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:52:28,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i [2018-10-10 14:52:28,606 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918937258/d625cbda27134155b2e70273da22b9fb/FLAG6a1e5a161 [2018-10-10 14:52:28,907 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:52:28,908 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i [2018-10-10 14:52:28,923 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918937258/d625cbda27134155b2e70273da22b9fb/FLAG6a1e5a161 [2018-10-10 14:52:28,937 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918937258/d625cbda27134155b2e70273da22b9fb [2018-10-10 14:52:28,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:52:28,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:52:28,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:28,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:52:28,954 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:52:28,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:28" (1/1) ... [2018-10-10 14:52:28,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e7fca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:28, skipping insertion in model container [2018-10-10 14:52:28,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:28" (1/1) ... [2018-10-10 14:52:28,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:52:29,034 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:52:29,259 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:29,265 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:52:29,319 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:29,387 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:52:29,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29 WrapperNode [2018-10-10 14:52:29,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:29,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:29,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:52:29,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:52:29,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:29,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:52:29,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:52:29,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:52:29,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... [2018-10-10 14:52:29,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:52:29,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:52:29,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:52:29,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:52:29,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (1/1) ... No working directory specified, using /storage/repos/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-10-10 14:52:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:52:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:52:30,485 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:52:30,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:30 BoogieIcfgContainer [2018-10-10 14:52:30,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:52:30,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:52:30,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:52:30,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:52:30,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:52:28" (1/3) ... [2018-10-10 14:52:30,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bacae00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:30, skipping insertion in model container [2018-10-10 14:52:30,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:29" (2/3) ... [2018-10-10 14:52:30,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bacae00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:30, skipping insertion in model container [2018-10-10 14:52:30,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:30" (3/3) ... [2018-10-10 14:52:30,495 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0158_1_true-valid-memsafety_true-termination.i [2018-10-10 14:52:30,505 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:52:30,513 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:52:30,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:52:30,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:52:30,561 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:52:30,561 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:52:30,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:52:30,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:52:30,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:52:30,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:52:30,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:52:30,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:52:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-10-10 14:52:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-10 14:52:30,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:30,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:30,609 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:30,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1997916780, now seen corresponding path program 1 times [2018-10-10 14:52:30,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:30,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:30,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:30,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:30,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:30,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:30,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:30,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:31,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:31,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:31,017 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 7 states. [2018-10-10 14:52:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:31,669 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2018-10-10 14:52:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:52:31,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-10 14:52:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:31,684 INFO L225 Difference]: With dead ends: 136 [2018-10-10 14:52:31,684 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 14:52:31,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 14:52:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-10 14:52:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 14:52:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-10 14:52:31,729 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 36 [2018-10-10 14:52:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:31,730 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-10 14:52:31,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-10 14:52:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 14:52:31,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:31,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:31,733 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:31,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1805877967, now seen corresponding path program 1 times [2018-10-10 14:52:31,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:31,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:32,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:32,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:52:32,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:52:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:52:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:32,393 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 11 states. [2018-10-10 14:52:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:33,251 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2018-10-10 14:52:33,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:52:33,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-10 14:52:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:33,261 INFO L225 Difference]: With dead ends: 130 [2018-10-10 14:52:33,261 INFO L226 Difference]: Without dead ends: 130 [2018-10-10 14:52:33,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:52:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-10 14:52:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-10-10 14:52:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 14:52:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-10-10 14:52:33,282 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 37 [2018-10-10 14:52:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:33,282 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-10-10 14:52:33,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:52:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-10-10 14:52:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 14:52:33,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:33,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:33,285 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:33,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -34820872, now seen corresponding path program 1 times [2018-10-10 14:52:33,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:33,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:33,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:33,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:52:33,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:52:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:52:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:52:33,417 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 6 states. [2018-10-10 14:52:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:33,634 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-10-10 14:52:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:52:33,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-10-10 14:52:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:33,638 INFO L225 Difference]: With dead ends: 127 [2018-10-10 14:52:33,638 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 14:52:33,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 14:52:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-10 14:52:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 14:52:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-10 14:52:33,648 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 49 [2018-10-10 14:52:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:33,649 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-10 14:52:33,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:52:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-10 14:52:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 14:52:33,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:33,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:33,652 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:33,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1079446946, now seen corresponding path program 1 times [2018-10-10 14:52:33,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:33,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:33,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:33,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:34,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:52:34,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:52:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:52:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:34,062 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 12 states. [2018-10-10 14:52:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:35,100 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-10 14:52:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:52:35,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-10-10 14:52:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:35,104 INFO L225 Difference]: With dead ends: 158 [2018-10-10 14:52:35,104 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 14:52:35,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:52:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 14:52:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-10-10 14:52:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 14:52:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-10-10 14:52:35,115 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 50 [2018-10-10 14:52:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:35,115 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-10-10 14:52:35,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:52:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-10-10 14:52:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 14:52:35,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:35,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:35,119 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:35,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -748624397, now seen corresponding path program 1 times [2018-10-10 14:52:35,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:35,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:35,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:52:35,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:52:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:52:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:52:35,224 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 6 states. [2018-10-10 14:52:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:35,343 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2018-10-10 14:52:35,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:52:35,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-10-10 14:52:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:35,345 INFO L225 Difference]: With dead ends: 124 [2018-10-10 14:52:35,345 INFO L226 Difference]: Without dead ends: 124 [2018-10-10 14:52:35,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-10 14:52:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-10-10 14:52:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-10 14:52:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-10-10 14:52:35,354 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 58 [2018-10-10 14:52:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:35,355 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-10-10 14:52:35,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:52:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-10-10 14:52:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-10 14:52:35,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:35,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:35,357 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:35,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1732519714, now seen corresponding path program 1 times [2018-10-10 14:52:35,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:35,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:35,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:35,517 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 8 states. [2018-10-10 14:52:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:35,819 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-10 14:52:35,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:52:35,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-10-10 14:52:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:35,822 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:52:35,822 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 14:52:35,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 14:52:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2018-10-10 14:52:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 14:52:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-10 14:52:35,829 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 59 [2018-10-10 14:52:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:35,830 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-10 14:52:35,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:52:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-10 14:52:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 14:52:35,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:35,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:35,833 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:35,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1397278228, now seen corresponding path program 1 times [2018-10-10 14:52:35,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:35,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:35,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:35,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:52:35,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:52:35,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:52:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:52:35,946 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 6 states. [2018-10-10 14:52:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:36,127 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-10-10 14:52:36,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:52:36,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-10-10 14:52:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:36,129 INFO L225 Difference]: With dead ends: 122 [2018-10-10 14:52:36,129 INFO L226 Difference]: Without dead ends: 122 [2018-10-10 14:52:36,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-10 14:52:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-10-10 14:52:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 14:52:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-10-10 14:52:36,135 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 70 [2018-10-10 14:52:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:36,136 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-10-10 14:52:36,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:52:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-10-10 14:52:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 14:52:36,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:36,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:36,139 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:36,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash -365951963, now seen corresponding path program 1 times [2018-10-10 14:52:36,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:36,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:36,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:36,705 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-10 14:52:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:36,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:36,882 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 8 states. [2018-10-10 14:52:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:37,272 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-10-10 14:52:37,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:37,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-10-10 14:52:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:37,276 INFO L225 Difference]: With dead ends: 150 [2018-10-10 14:52:37,276 INFO L226 Difference]: Without dead ends: 150 [2018-10-10 14:52:37,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:52:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-10 14:52:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-10-10 14:52:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 14:52:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-10 14:52:37,283 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 71 [2018-10-10 14:52:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:37,284 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-10 14:52:37,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:52:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-10 14:52:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 14:52:37,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:37,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:37,291 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:37,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash 668030717, now seen corresponding path program 1 times [2018-10-10 14:52:37,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:37,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:37,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:37,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:37,616 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 8 states. [2018-10-10 14:52:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:37,849 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-10 14:52:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:52:37,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-10-10 14:52:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:37,852 INFO L225 Difference]: With dead ends: 151 [2018-10-10 14:52:37,853 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 14:52:37,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:52:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 14:52:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2018-10-10 14:52:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 14:52:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-10-10 14:52:37,856 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 72 [2018-10-10 14:52:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:37,857 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-10-10 14:52:37,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:52:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-10-10 14:52:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:52:37,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:37,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:37,859 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:37,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -157237647, now seen corresponding path program 1 times [2018-10-10 14:52:37,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:37,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:38,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:38,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:38,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:38,084 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 9 states. [2018-10-10 14:52:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:38,445 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-10-10 14:52:38,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:52:38,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-10-10 14:52:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:38,447 INFO L225 Difference]: With dead ends: 119 [2018-10-10 14:52:38,447 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 14:52:38,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:52:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 14:52:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-10 14:52:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 14:52:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-10 14:52:38,451 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 78 [2018-10-10 14:52:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:38,451 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-10 14:52:38,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-10 14:52:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:52:38,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:38,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:38,453 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:38,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash -579399606, now seen corresponding path program 1 times [2018-10-10 14:52:38,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:38,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:38,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:39,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:39,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:39,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:39,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:39,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:39,313 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 9 states. [2018-10-10 14:52:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:39,860 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2018-10-10 14:52:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:52:39,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-10-10 14:52:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:39,862 INFO L225 Difference]: With dead ends: 118 [2018-10-10 14:52:39,862 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 14:52:39,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:52:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 14:52:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-10-10 14:52:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 14:52:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-10-10 14:52:39,866 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 79 [2018-10-10 14:52:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:39,867 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-10-10 14:52:39,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-10-10 14:52:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:52:39,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:39,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:39,869 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:52:39,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1400490068, now seen corresponding path program 1 times [2018-10-10 14:52:39,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:39,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:39,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:39,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:39,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:41,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:41,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-10-10 14:52:41,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:52:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:52:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:52:41,027 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 21 states. [2018-10-10 14:52:42,744 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-10 14:52:42,928 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-10 14:52:43,124 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-10-10 14:52:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:43,694 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-10-10 14:52:43,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:52:43,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-10-10 14:52:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:43,695 INFO L225 Difference]: With dead ends: 117 [2018-10-10 14:52:43,695 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 14:52:43,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 14:52:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 14:52:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 14:52:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 14:52:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 14:52:43,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2018-10-10 14:52:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:43,698 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 14:52:43,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:52:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 14:52:43,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 14:52:43,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:52:43 BoogieIcfgContainer [2018-10-10 14:52:43,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:52:43,706 INFO L168 Benchmark]: Toolchain (without parser) took 14759.05 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -489.6 MB). Peak memory consumption was 382.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:43,707 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:52:43,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:43,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:52:43,709 INFO L168 Benchmark]: Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:52:43,709 INFO L168 Benchmark]: RCFGBuilder took 998.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:43,710 INFO L168 Benchmark]: TraceAbstraction took 13217.43 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.2 MB). Peak memory consumption was 390.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:43,715 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 438.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 998.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13217.43 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.2 MB). Peak memory consumption was 390.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 639]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 639]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 15 error locations. SAFE Result, 13.1s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 5176 SDslu, 2813 SDs, 0 SdLazy, 2264 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 124 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 754 NumberOfCodeBlocks, 754 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 325098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...