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/memsafety/test-0019_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:28,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:28,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:28,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:28,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:28,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:28,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:28,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:28,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:28,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:28,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:28,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:28,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:28,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:28,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:28,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:28,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:28,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:28,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:28,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:28,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:28,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:28,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:28,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:28,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:28,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:28,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:28,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:28,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:28,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:28,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:28,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:28,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:28,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:28,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:28,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:28,466 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:43:28,487 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:28,487 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:28,488 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:28,489 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:28,490 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:28,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:28,490 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:28,490 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:28,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:28,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:28,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:28,491 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:28,491 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:28,491 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:28,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:28,492 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:28,493 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:28,493 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:28,493 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:28,494 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:28,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:28,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:28,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:28,494 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:28,495 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:28,495 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:43:28,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:28,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:28,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:28,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:28,585 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:28,586 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-10-10 14:43:28,894 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18147b03/5390eadd67e240ed91d43ffd83e39782/FLAG05ee5b399 [2018-10-10 14:43:29,178 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:29,179 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-10-10 14:43:29,196 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18147b03/5390eadd67e240ed91d43ffd83e39782/FLAG05ee5b399 [2018-10-10 14:43:29,212 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18147b03/5390eadd67e240ed91d43ffd83e39782 [2018-10-10 14:43:29,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:29,225 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:29,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:29,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:29,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:29,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619fdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29, skipping insertion in model container [2018-10-10 14:43:29,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:29,310 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:29,542 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:29,549 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:29,598 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:29,684 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:29,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29 WrapperNode [2018-10-10 14:43:29,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:29,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:29,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:29,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:29,697 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:43:29" (1/1) ... [2018-10-10 14:43:29,722 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:43:29" (1/1) ... [2018-10-10 14:43:29,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:29,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:29,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:29,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:29,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (1/1) ... [2018-10-10 14:43:29,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:29,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:29,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:29,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:29,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43: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:43:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:31,029 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:31,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:31 BoogieIcfgContainer [2018-10-10 14:43:31,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:31,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:31,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:31,035 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:31,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:29" (1/3) ... [2018-10-10 14:43:31,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6217f10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:31, skipping insertion in model container [2018-10-10 14:43:31,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:29" (2/3) ... [2018-10-10 14:43:31,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6217f10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:31, skipping insertion in model container [2018-10-10 14:43:31,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:31" (3/3) ... [2018-10-10 14:43:31,040 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-10-10 14:43:31,053 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:31,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-10-10 14:43:31,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-10-10 14:43:31,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:31,114 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:31,115 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:31,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:31,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:31,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:31,116 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:31,116 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:31,116 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states. [2018-10-10 14:43:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-10 14:43:31,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:31,148 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] [2018-10-10 14:43:31,151 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:31,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash -151080746, now seen corresponding path program 1 times [2018-10-10 14:43:31,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:31,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:31,675 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:43:31,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:31,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:31,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:31,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:31,701 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 9 states. [2018-10-10 14:43:32,394 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:43:32,662 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:43:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:33,431 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 14:43:33,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:43:33,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-10-10 14:43:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:33,449 INFO L225 Difference]: With dead ends: 215 [2018-10-10 14:43:33,449 INFO L226 Difference]: Without dead ends: 210 [2018-10-10 14:43:33,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:43:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-10 14:43:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-10-10 14:43:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 14:43:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 14:43:33,502 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 40 [2018-10-10 14:43:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:33,503 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 14:43:33,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 14:43:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 14:43:33,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:33,508 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] [2018-10-10 14:43:33,509 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:33,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash -388535757, now seen corresponding path program 1 times [2018-10-10 14:43:33,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:33,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:33,945 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:43:33,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:33,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:43:33,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:43:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:43:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:33,948 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 13 states. [2018-10-10 14:43:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:35,549 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 14:43:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:43:35,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-10-10 14:43:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:35,553 INFO L225 Difference]: With dead ends: 209 [2018-10-10 14:43:35,553 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 14:43:35,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:43:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 14:43:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-10-10 14:43:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 14:43:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-10 14:43:35,581 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 41 [2018-10-10 14:43:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:35,582 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-10 14:43:35,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:43:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-10 14:43:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 14:43:35,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:35,587 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] [2018-10-10 14:43:35,588 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:35,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1485732897, now seen corresponding path program 1 times [2018-10-10 14:43:35,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:36,044 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:43:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:43:36,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:43:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:43:36,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:43:36,046 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 15 states. [2018-10-10 14:43:37,855 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-10 14:43:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:38,446 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-10 14:43:38,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 14:43:38,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-10-10 14:43:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:38,454 INFO L225 Difference]: With dead ends: 208 [2018-10-10 14:43:38,454 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 14:43:38,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:43:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 14:43:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-10-10 14:43:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 14:43:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-10 14:43:38,469 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 63 [2018-10-10 14:43:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:38,470 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-10 14:43:38,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:43:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-10 14:43:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 14:43:38,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:38,472 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:43:38,473 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:38,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash -756476120, now seen corresponding path program 1 times [2018-10-10 14:43:38,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:38,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:38,594 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:43:38,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:38,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:38,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:38,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:38,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:38,596 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 8 states. [2018-10-10 14:43:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:38,915 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 14:43:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:38,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-10-10 14:43:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:38,919 INFO L225 Difference]: With dead ends: 206 [2018-10-10 14:43:38,920 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 14:43:38,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 14:43:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-10-10 14:43:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 14:43:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-10 14:43:38,929 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 72 [2018-10-10 14:43:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:38,929 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-10 14:43:38,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-10 14:43:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:43:38,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:38,932 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] [2018-10-10 14:43:38,933 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:38,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1975923130, now seen corresponding path program 1 times [2018-10-10 14:43:38,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:39,114 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:43:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:43:39,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:43:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:43:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:43:39,116 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 10 states. [2018-10-10 14:43:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:39,676 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-10 14:43:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:43:39,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-10-10 14:43:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:39,679 INFO L225 Difference]: With dead ends: 205 [2018-10-10 14:43:39,679 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 14:43:39,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:43:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 14:43:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-10 14:43:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 14:43:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-10 14:43:39,686 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 73 [2018-10-10 14:43:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:39,687 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-10 14:43:39,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:43:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-10 14:43:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 14:43:39,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:39,690 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] [2018-10-10 14:43:39,691 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:39,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1830556596, now seen corresponding path program 1 times [2018-10-10 14:43:39,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:39,895 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:43:39,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:39,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:43:39,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:43:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:43:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:39,896 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 11 states. [2018-10-10 14:43:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:40,425 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-10 14:43:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:43:40,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-10-10 14:43:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:40,428 INFO L225 Difference]: With dead ends: 204 [2018-10-10 14:43:40,428 INFO L226 Difference]: Without dead ends: 204 [2018-10-10 14:43:40,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:43:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-10 14:43:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-10-10 14:43:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 14:43:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 14:43:40,435 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 83 [2018-10-10 14:43:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:40,435 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 14:43:40,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:43:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 14:43:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:43:40,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:40,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:40,440 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:40,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -107396420, now seen corresponding path program 1 times [2018-10-10 14:43:40,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:40,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:40,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:40,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:40,607 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:43:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:40,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:40,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:40,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:40,608 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 5 states. [2018-10-10 14:43:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:40,857 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-10 14:43:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:40,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-10 14:43:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:40,863 INFO L225 Difference]: With dead ends: 202 [2018-10-10 14:43:40,863 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 14:43:40,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 14:43:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-10-10 14:43:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-10 14:43:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-10 14:43:40,868 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 108 [2018-10-10 14:43:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:40,869 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-10 14:43:40,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-10 14:43:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:43:40,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:40,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:40,872 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:40,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash 965678426, now seen corresponding path program 1 times [2018-10-10 14:43:40,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:40,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:40,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:40,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:40,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:41,092 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:43:41,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:41,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:41,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:41,093 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 7 states. [2018-10-10 14:43:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:41,341 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-10 14:43:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:41,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-10 14:43:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:41,344 INFO L225 Difference]: With dead ends: 201 [2018-10-10 14:43:41,344 INFO L226 Difference]: Without dead ends: 201 [2018-10-10 14:43:41,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:43:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-10 14:43:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-10-10 14:43:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 14:43:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 14:43:41,349 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 109 [2018-10-10 14:43:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:41,349 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 14:43:41,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 14:43:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:43:41,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:41,352 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, 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:43:41,352 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:41,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash 122028896, now seen corresponding path program 1 times [2018-10-10 14:43:41,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:41,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:41,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:41,537 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:43:41,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:41,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:41,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:41,539 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 7 states. [2018-10-10 14:43:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:41,903 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 14:43:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:41,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-10 14:43:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:41,906 INFO L225 Difference]: With dead ends: 200 [2018-10-10 14:43:41,906 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 14:43:41,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 14:43:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-10 14:43:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 14:43:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-10 14:43:41,910 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 119 [2018-10-10 14:43:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:41,910 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-10 14:43:41,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-10 14:43:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 14:43:41,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:41,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,913 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:41,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:41,913 INFO L82 PathProgramCache]: Analyzing trace with hash -216302363, now seen corresponding path program 1 times [2018-10-10 14:43:41,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:41,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:41,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:41,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:41,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:42,184 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:43:42,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:42,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:42,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:42,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:42,187 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 5 states. [2018-10-10 14:43:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:42,897 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-10 14:43:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:42,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-10-10 14:43:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:42,899 INFO L225 Difference]: With dead ends: 198 [2018-10-10 14:43:42,899 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 14:43:42,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 14:43:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-10 14:43:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 14:43:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 14:43:42,904 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 127 [2018-10-10 14:43:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:42,905 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 14:43:42,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 14:43:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 14:43:42,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:42,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:42,907 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:42,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1884561512, now seen corresponding path program 1 times [2018-10-10 14:43:42,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:43,048 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:43:43,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:43,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:43,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:43,050 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 8 states. [2018-10-10 14:43:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:43,327 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 14:43:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:43,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2018-10-10 14:43:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:43,330 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:43:43,330 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 14:43:43,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 14:43:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-10 14:43:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-10 14:43:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-10 14:43:43,337 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 128 [2018-10-10 14:43:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:43,337 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-10 14:43:43,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-10 14:43:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 14:43:43,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:43,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,339 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:43,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash -968690929, now seen corresponding path program 1 times [2018-10-10 14:43:43,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:43,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:43,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:43,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:43,759 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:43:43,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:43,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:43,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:43,761 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 8 states. [2018-10-10 14:43:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:44,197 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-10 14:43:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:43:44,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2018-10-10 14:43:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:44,199 INFO L225 Difference]: With dead ends: 196 [2018-10-10 14:43:44,200 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 14:43:44,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 14:43:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-10 14:43:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 14:43:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-10 14:43:44,204 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 140 [2018-10-10 14:43:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:44,205 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-10 14:43:44,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-10 14:43:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 14:43:44,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:44,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,207 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:44,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash -355628235, now seen corresponding path program 1 times [2018-10-10 14:43:44,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:44,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:44,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:44,861 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:43:44,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:44,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-10-10 14:43:44,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 14:43:44,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 14:43:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-10-10 14:43:44,863 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 26 states. [2018-10-10 14:43:46,979 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-10 14:43:47,730 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-10-10 14:43:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:48,570 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-10 14:43:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 14:43:48,570 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 150 [2018-10-10 14:43:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:48,572 INFO L225 Difference]: With dead ends: 195 [2018-10-10 14:43:48,572 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 14:43:48,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=779, Invalid=2881, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:43:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 14:43:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-10 14:43:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 14:43:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 14:43:48,578 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 150 [2018-10-10 14:43:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:48,579 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 14:43:48,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 14:43:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 14:43:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-10 14:43:48,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:48,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:48,580 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:48,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1860426814, now seen corresponding path program 1 times [2018-10-10 14:43:48,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:48,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:50,134 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:43:50,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:50,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-10-10 14:43:50,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 14:43:50,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 14:43:50,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2018-10-10 14:43:50,136 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 32 states. [2018-10-10 14:43:52,144 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-10-10 14:43:54,605 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-10 14:43:55,074 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-10-10 14:43:55,223 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-10-10 14:43:55,357 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-10-10 14:43:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:56,037 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 14:43:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 14:43:56,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 151 [2018-10-10 14:43:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:56,039 INFO L225 Difference]: With dead ends: 194 [2018-10-10 14:43:56,039 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 14:43:56,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1104, Invalid=5376, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 14:43:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 14:43:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-10-10 14:43:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-10 14:43:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-10 14:43:56,046 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 151 [2018-10-10 14:43:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:56,047 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-10 14:43:56,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 14:43:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-10 14:43:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 14:43:56,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:56,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:56,049 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:56,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1927055430, now seen corresponding path program 1 times [2018-10-10 14:43:56,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:56,434 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:43:56,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:56,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-10 14:43:56,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:43:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:43:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:43:56,435 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 20 states. [2018-10-10 14:43:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:58,149 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-10 14:43:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:43:58,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 158 [2018-10-10 14:43:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:58,151 INFO L225 Difference]: With dead ends: 193 [2018-10-10 14:43:58,151 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 14:43:58,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=535, Invalid=1535, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 14:43:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 14:43:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-10-10 14:43:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 14:43:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-10 14:43:58,157 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 158 [2018-10-10 14:43:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:58,157 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-10 14:43:58,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:43:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-10 14:43:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-10 14:43:58,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:58,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:58,159 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:58,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash 390824035, now seen corresponding path program 1 times [2018-10-10 14:43:58,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:58,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:58,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:58,967 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:43:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:58,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-10-10 14:43:58,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 14:43:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 14:43:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:43:58,969 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 27 states. [2018-10-10 14:44:00,401 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-10 14:44:01,846 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-10-10 14:44:02,130 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-10 14:44:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:02,971 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-10 14:44:02,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 14:44:02,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 159 [2018-10-10 14:44:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:02,977 INFO L225 Difference]: With dead ends: 192 [2018-10-10 14:44:02,977 INFO L226 Difference]: Without dead ends: 192 [2018-10-10 14:44:02,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=886, Invalid=3274, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 14:44:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-10 14:44:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-10-10 14:44:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 14:44:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 14:44:02,983 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 159 [2018-10-10 14:44:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:02,983 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 14:44:02,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 14:44:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 14:44:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-10 14:44:02,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:02,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:02,985 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:02,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 250487967, now seen corresponding path program 1 times [2018-10-10 14:44:02,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:02,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:04,768 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:44:04,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:04,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2018-10-10 14:44:04,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 14:44:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 14:44:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:44:04,770 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 39 states. [2018-10-10 14:44:06,337 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-10-10 14:44:11,271 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-10-10 14:44:12,120 WARN L178 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-10 14:44:13,043 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-10-10 14:44:13,204 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-10 14:44:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:13,608 INFO L93 Difference]: Finished difference Result 185 states and 184 transitions. [2018-10-10 14:44:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 14:44:13,609 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 168 [2018-10-10 14:44:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:13,610 INFO L225 Difference]: With dead ends: 185 [2018-10-10 14:44:13,610 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 14:44:13,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1244, Invalid=7312, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 14:44:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 14:44:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-10 14:44:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 14:44:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 184 transitions. [2018-10-10 14:44:13,616 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 184 transitions. Word has length 168 [2018-10-10 14:44:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:13,616 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 184 transitions. [2018-10-10 14:44:13,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 14:44:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 184 transitions. [2018-10-10 14:44:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-10 14:44:13,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:13,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:13,618 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:13,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1297949911, now seen corresponding path program 1 times [2018-10-10 14:44:13,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:13,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:15,003 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-10-10 14:44:15,299 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2018-10-10 14:44:17,243 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2018-10-10 14:44:17,439 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2018-10-10 14:44:17,851 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2018-10-10 14:44:18,096 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2018-10-10 14:44:18,346 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2018-10-10 14:44:18,608 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2018-10-10 14:44:19,704 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2018-10-10 14:44:20,418 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2018-10-10 14:44:20,898 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2018-10-10 14:44:21,645 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2018-10-10 14:44:23,166 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2018-10-10 14:44:23,604 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 31 [2018-10-10 14:44:24,355 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2018-10-10 14:44:25,764 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-10-10 14:44:27,574 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-10-10 14:44:34,423 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:44:34,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:34,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2018-10-10 14:44:34,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 14:44:34,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 14:44:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4148, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 14:44:34,426 INFO L87 Difference]: Start difference. First operand 185 states and 184 transitions. Second operand 66 states. [2018-10-10 14:44:37,552 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2018-10-10 14:44:37,899 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 [2018-10-10 14:44:39,120 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-10-10 14:44:39,502 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2018-10-10 14:44:40,046 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-10-10 14:44:40,592 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-10-10 14:44:41,243 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-10 14:44:41,626 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-10-10 14:44:42,427 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-10-10 14:44:42,926 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-10-10 14:44:43,712 WARN L178 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 135 [2018-10-10 14:44:44,686 WARN L178 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 124 [2018-10-10 14:44:45,494 WARN L178 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 138 [2018-10-10 14:44:46,488 WARN L178 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 152 [2018-10-10 14:44:47,762 WARN L178 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 183 DAG size of output: 171 [2018-10-10 14:44:49,163 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 196 DAG size of output: 184 [2018-10-10 14:44:49,782 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-10 14:44:50,342 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-10-10 14:44:50,754 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-10-10 14:44:51,494 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2018-10-10 14:44:52,037 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2018-10-10 14:44:52,617 WARN L178 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2018-10-10 14:44:53,441 WARN L178 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2018-10-10 14:44:54,211 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 130 [2018-10-10 14:44:55,119 WARN L178 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 145 [2018-10-10 14:44:56,704 WARN L178 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 157 [2018-10-10 14:44:57,909 WARN L178 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 169 [2018-10-10 14:44:59,298 WARN L178 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 181 [2018-10-10 14:45:00,388 WARN L178 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 169 [2018-10-10 14:45:02,074 WARN L178 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 184 DAG size of output: 178 [2018-10-10 14:45:04,257 WARN L178 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 166 [2018-10-10 14:45:06,284 WARN L178 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 194 DAG size of output: 187 [2018-10-10 14:45:08,904 WARN L178 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 209 DAG size of output: 202 [2018-10-10 14:45:12,206 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 224 DAG size of output: 218 [2018-10-10 14:45:14,670 WARN L178 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 209 DAG size of output: 202 [2018-10-10 14:45:17,726 WARN L178 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 216 DAG size of output: 209 [2018-10-10 14:45:20,533 WARN L178 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2018-10-10 14:45:24,461 WARN L178 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 227 DAG size of output: 219 [2018-10-10 14:45:28,664 WARN L178 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 240 DAG size of output: 232 [2018-10-10 14:45:29,173 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-10-10 14:45:29,640 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-10-10 14:45:30,313 WARN L178 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-10-10 14:45:31,118 WARN L178 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2018-10-10 14:45:31,721 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-10-10 14:45:32,092 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-10-10 14:45:32,520 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-10-10 14:45:32,964 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2018-10-10 14:45:33,380 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2018-10-10 14:45:33,744 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-10-10 14:45:34,341 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-10-10 14:45:34,603 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-10 14:45:34,899 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-10 14:45:35,172 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-10-10 14:45:35,673 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-10 14:45:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:35,794 INFO L93 Difference]: Finished difference Result 184 states and 183 transitions. [2018-10-10 14:45:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 14:45:35,794 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 184 [2018-10-10 14:45:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:35,795 INFO L225 Difference]: With dead ends: 184 [2018-10-10 14:45:35,796 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 14:45:35,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 33 SyntacticMatches, 19 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3671 ImplicationChecksByTransitivity, 71.0s TimeCoverageRelationStatistics Valid=1260, Invalid=18762, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 14:45:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 14:45:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 14:45:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 14:45:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 14:45:35,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2018-10-10 14:45:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:35,803 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 14:45:35,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 14:45:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 14:45:35,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 14:45:35,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:45:35 BoogieIcfgContainer [2018-10-10 14:45:35,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:45:35,810 INFO L168 Benchmark]: Toolchain (without parser) took 126585.96 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 188.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:45:35,811 INFO L168 Benchmark]: CDTParser took 0.20 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:45:35,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.81 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:45:35,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.86 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:45:35,812 INFO L168 Benchmark]: Boogie Preprocessor took 112.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:45:35,813 INFO L168 Benchmark]: RCFGBuilder took 1158.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:45:35,814 INFO L168 Benchmark]: TraceAbstraction took 124777.64 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 545.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -349.1 MB). Peak memory consumption was 196.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:45:35,818 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.20 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 459.81 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 72.86 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 112.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1158.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124777.64 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 545.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -349.1 MB). Peak memory consumption was 196.7 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: 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: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 634]: 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: 634]: 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: 635]: 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 - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 217 locations, 21 error locations. SAFE Result, 124.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 95.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2562 SDtfs, 16128 SDslu, 15322 SDs, 0 SdLazy, 15707 SolverSat, 593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 746 GetRequests, 72 SyntacticMatches, 30 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8308 ImplicationChecksByTransitivity, 98.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 2073 NumberOfCodeBlocks, 2073 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2055 ConstructedInterpolants, 0 QuantifiedInterpolants, 3128680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...