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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 11:25:45,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 11:25:45,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 11:25:45,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 11:25:45,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 11:25:45,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 11:25:45,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 11:25:45,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 11:25:45,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 11:25:45,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 11:25:45,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 11:25:45,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 11:25:45,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 11:25:45,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 11:25:45,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 11:25:45,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 11:25:45,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 11:25:45,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 11:25:45,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 11:25:45,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 11:25:45,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 11:25:45,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 11:25:45,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 11:25:45,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 11:25:45,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 11:25:45,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 11:25:45,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 11:25:45,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 11:25:45,571 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 11:25:45,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 11:25:45,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 11:25:45,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 11:25:45,574 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 11:25:45,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 11:25:45,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 11:25:45,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 11:25:45,580 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 11:25:45,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 11:25:45,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 11:25:45,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 11:25:45,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 11:25:45,601 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 11:25:45,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 11:25:45,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 11:25:45,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 11:25:45,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 11:25:45,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 11:25:45,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 11:25:45,602 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 11:25:45,602 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 11:25:45,602 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 11:25:45,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 11:25:45,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 11:25:45,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 11:25:45,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 11:25:45,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 11:25:45,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 11:25:45,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:25:45,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 11:25:45,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 11:25:45,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 11:25:45,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 11:25:45,605 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 [2018-10-10 11:25:45,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 11:25:45,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 11:25:45,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 11:25:45,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 11:25:45,675 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 11:25:45,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-10-10 11:25:46,029 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65a2aa60/d10ef5083b764f09bf15030c97efa6a7/FLAG1f437966e [2018-10-10 11:25:46,307 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 11:25:46,310 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-10-10 11:25:46,325 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65a2aa60/d10ef5083b764f09bf15030c97efa6a7/FLAG1f437966e [2018-10-10 11:25:46,338 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65a2aa60/d10ef5083b764f09bf15030c97efa6a7 [2018-10-10 11:25:46,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 11:25:46,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 11:25:46,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:46,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 11:25:46,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 11:25:46,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:46,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9f0aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46, skipping insertion in model container [2018-10-10 11:25:46,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:46,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 11:25:46,429 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 11:25:46,744 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:46,762 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 11:25:46,851 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:46,916 INFO L193 MainTranslator]: Completed translation [2018-10-10 11:25:46,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46 WrapperNode [2018-10-10 11:25:46,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:46,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:46,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 11:25:46,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 11:25:46,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:46,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:47,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 11:25:47,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 11:25:47,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 11:25:47,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (1/1) ... [2018-10-10 11:25:47,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 11:25:47,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 11:25:47,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 11:25:47,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 11:25:47,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (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 11:25:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 11:25:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 11:25:48,327 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 11:25:48,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:48 BoogieIcfgContainer [2018-10-10 11:25:48,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 11:25:48,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 11:25:48,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 11:25:48,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 11:25:48,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:25:46" (1/3) ... [2018-10-10 11:25:48,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199136ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:48, skipping insertion in model container [2018-10-10 11:25:48,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:46" (2/3) ... [2018-10-10 11:25:48,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199136ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:48, skipping insertion in model container [2018-10-10 11:25:48,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:48" (3/3) ... [2018-10-10 11:25:48,336 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-10-10 11:25:48,346 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 11:25:48,356 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-10-10 11:25:48,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2018-10-10 11:25:48,401 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 11:25:48,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 11:25:48,402 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 11:25:48,403 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 11:25:48,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 11:25:48,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 11:25:48,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 11:25:48,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 11:25:48,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 11:25:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-10-10 11:25:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-10 11:25:48,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:48,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-10 11:25:48,447 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2018-10-10 11:25:48,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:48,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:48,630 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 11:25:48,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:48,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:48,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:48,655 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2018-10-10 11:25:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:49,112 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-10-10 11:25:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:49,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-10 11:25:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:49,127 INFO L225 Difference]: With dead ends: 151 [2018-10-10 11:25:49,128 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 11:25:49,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 11:25:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2018-10-10 11:25:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 11:25:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-10-10 11:25:49,171 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 3 [2018-10-10 11:25:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:49,171 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-10-10 11:25:49,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-10-10 11:25:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-10 11:25:49,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:49,172 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-10 11:25:49,174 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:49,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2018-10-10 11:25:49,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:49,246 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 11:25:49,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:49,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:49,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:49,249 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 3 states. [2018-10-10 11:25:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:49,845 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2018-10-10 11:25:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:49,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-10 11:25:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:49,849 INFO L225 Difference]: With dead ends: 195 [2018-10-10 11:25:49,850 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 11:25:49,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 11:25:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2018-10-10 11:25:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 11:25:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-10-10 11:25:49,864 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 4 [2018-10-10 11:25:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:49,864 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-10-10 11:25:49,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-10-10 11:25:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-10 11:25:49,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:49,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-10 11:25:49,867 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:49,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2018-10-10 11:25:49,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:49,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:49,970 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 11:25:49,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:49,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:49,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:49,972 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 5 states. [2018-10-10 11:25:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:50,411 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-10-10 11:25:50,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:50,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-10 11:25:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:50,418 INFO L225 Difference]: With dead ends: 214 [2018-10-10 11:25:50,418 INFO L226 Difference]: Without dead ends: 214 [2018-10-10 11:25:50,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-10 11:25:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 161. [2018-10-10 11:25:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 11:25:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-10-10 11:25:50,434 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 5 [2018-10-10 11:25:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:50,435 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-10-10 11:25:50,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-10-10 11:25:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-10 11:25:50,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:50,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-10 11:25:50,437 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:50,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:50,438 INFO L82 PathProgramCache]: Analyzing trace with hash 889475910, now seen corresponding path program 1 times [2018-10-10 11:25:50,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:50,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:50,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:50,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:50,534 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 11:25:50,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:25:50,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:50,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:50,536 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 4 states. [2018-10-10 11:25:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:50,972 INFO L93 Difference]: Finished difference Result 247 states and 258 transitions. [2018-10-10 11:25:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:50,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-10 11:25:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:50,975 INFO L225 Difference]: With dead ends: 247 [2018-10-10 11:25:50,976 INFO L226 Difference]: Without dead ends: 247 [2018-10-10 11:25:50,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-10 11:25:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 171. [2018-10-10 11:25:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 11:25:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2018-10-10 11:25:50,991 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 6 [2018-10-10 11:25:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:50,992 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2018-10-10 11:25:50,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2018-10-10 11:25:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-10 11:25:50,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:50,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:50,994 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:50,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1466829910, now seen corresponding path program 1 times [2018-10-10 11:25:50,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:50,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:51,120 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 11:25:51,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:51,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:51,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:51,123 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 6 states. [2018-10-10 11:25:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:51,763 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2018-10-10 11:25:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:51,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-10 11:25:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:51,766 INFO L225 Difference]: With dead ends: 292 [2018-10-10 11:25:51,766 INFO L226 Difference]: Without dead ends: 292 [2018-10-10 11:25:51,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:25:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-10 11:25:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 135. [2018-10-10 11:25:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:25:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-10-10 11:25:51,775 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 10 [2018-10-10 11:25:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:51,775 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-10-10 11:25:51,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-10-10 11:25:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-10 11:25:51,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:51,776 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:51,778 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:51,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1772913101, now seen corresponding path program 1 times [2018-10-10 11:25:51,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:51,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:51,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 11:25:51,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:51,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:51,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:51,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:51,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:51,946 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 7 states. [2018-10-10 11:25:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:53,106 INFO L93 Difference]: Finished difference Result 329 states and 346 transitions. [2018-10-10 11:25:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:53,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-10 11:25:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:53,110 INFO L225 Difference]: With dead ends: 329 [2018-10-10 11:25:53,110 INFO L226 Difference]: Without dead ends: 329 [2018-10-10 11:25:53,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:25:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-10 11:25:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 136. [2018-10-10 11:25:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 11:25:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2018-10-10 11:25:53,128 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 11 [2018-10-10 11:25:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:53,129 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2018-10-10 11:25:53,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-10-10 11:25:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-10 11:25:53,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:53,132 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:53,133 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:53,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash -874268660, now seen corresponding path program 1 times [2018-10-10 11:25:53,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:53,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:53,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:53,425 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 11:25:53,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:53,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:53,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:53,430 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand 5 states. [2018-10-10 11:25:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:54,124 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-10-10 11:25:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:54,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-10 11:25:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:54,127 INFO L225 Difference]: With dead ends: 161 [2018-10-10 11:25:54,127 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 11:25:54,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 11:25:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 132. [2018-10-10 11:25:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 11:25:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2018-10-10 11:25:54,134 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 12 [2018-10-10 11:25:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:54,135 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-10-10 11:25:54,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2018-10-10 11:25:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-10 11:25:54,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:54,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:54,137 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:54,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1332524625, now seen corresponding path program 1 times [2018-10-10 11:25:54,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:54,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:54,248 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 11:25:54,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:54,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:54,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:54,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:54,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:54,250 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 6 states. [2018-10-10 11:25:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:54,773 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-10-10 11:25:54,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:54,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-10 11:25:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:54,776 INFO L225 Difference]: With dead ends: 227 [2018-10-10 11:25:54,777 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 11:25:54,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 11:25:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 134. [2018-10-10 11:25:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 11:25:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-10-10 11:25:54,783 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 13 [2018-10-10 11:25:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:54,783 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-10-10 11:25:54,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-10-10 11:25:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-10 11:25:54,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:54,784 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:54,785 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:54,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1641409646, now seen corresponding path program 1 times [2018-10-10 11:25:54,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:54,870 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 11:25:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:54,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:54,872 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-10-10 11:25:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:55,352 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-10-10 11:25:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:55,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-10 11:25:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:55,354 INFO L225 Difference]: With dead ends: 141 [2018-10-10 11:25:55,354 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 11:25:55,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 11:25:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-10-10 11:25:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 11:25:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2018-10-10 11:25:55,359 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 14 [2018-10-10 11:25:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:55,359 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-10-10 11:25:55,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2018-10-10 11:25:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:55,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:55,360 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:55,361 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:55,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1127240621, now seen corresponding path program 1 times [2018-10-10 11:25:55,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:55,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:55,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:55,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:55,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:55,443 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 11:25:55,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:55,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:55,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:55,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:55,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:55,445 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 7 states. [2018-10-10 11:25:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:56,044 INFO L93 Difference]: Finished difference Result 279 states and 295 transitions. [2018-10-10 11:25:56,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 11:25:56,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-10-10 11:25:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:56,048 INFO L225 Difference]: With dead ends: 279 [2018-10-10 11:25:56,048 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 11:25:56,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:25:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 11:25:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 134. [2018-10-10 11:25:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 11:25:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-10-10 11:25:56,053 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 15 [2018-10-10 11:25:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:56,054 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-10-10 11:25:56,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-10-10 11:25:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:56,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:56,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:56,057 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:56,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -655908463, now seen corresponding path program 1 times [2018-10-10 11:25:56,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:56,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:56,185 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 11:25:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:56,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:56,187 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-10-10 11:25:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:56,569 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2018-10-10 11:25:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:56,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-10 11:25:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:56,571 INFO L225 Difference]: With dead ends: 132 [2018-10-10 11:25:56,571 INFO L226 Difference]: Without dead ends: 132 [2018-10-10 11:25:56,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-10 11:25:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-10-10 11:25:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 11:25:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2018-10-10 11:25:56,575 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 15 [2018-10-10 11:25:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:56,576 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-10-10 11:25:56,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2018-10-10 11:25:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-10 11:25:56,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:56,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:56,578 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:56,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash -584720761, now seen corresponding path program 1 times [2018-10-10 11:25:56,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:56,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:56,692 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 11:25:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:56,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:56,693 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 5 states. [2018-10-10 11:25:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:57,316 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-10-10 11:25:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:57,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-10 11:25:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:57,318 INFO L225 Difference]: With dead ends: 209 [2018-10-10 11:25:57,319 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 11:25:57,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 11:25:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 132. [2018-10-10 11:25:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 11:25:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-10-10 11:25:57,323 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 16 [2018-10-10 11:25:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:57,324 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-10-10 11:25:57,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-10-10 11:25:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-10 11:25:57,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:57,325 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:57,325 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:57,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1032161683, now seen corresponding path program 1 times [2018-10-10 11:25:57,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:57,643 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 11:25:57,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:57,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:57,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:57,645 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand 6 states. [2018-10-10 11:25:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:57,972 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-10-10 11:25:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:25:57,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-10 11:25:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:57,974 INFO L225 Difference]: With dead ends: 137 [2018-10-10 11:25:57,974 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 11:25:57,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 11:25:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-10-10 11:25:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 11:25:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-10-10 11:25:57,979 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 17 [2018-10-10 11:25:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:57,979 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-10-10 11:25:57,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-10-10 11:25:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-10 11:25:57,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:57,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:57,981 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:57,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1932241171, now seen corresponding path program 1 times [2018-10-10 11:25:57,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:58,160 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 11:25:58,809 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 11:25:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:58,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:58,810 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 7 states. [2018-10-10 11:25:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:59,515 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2018-10-10 11:25:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 11:25:59,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-10 11:25:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:59,517 INFO L225 Difference]: With dead ends: 213 [2018-10-10 11:25:59,517 INFO L226 Difference]: Without dead ends: 213 [2018-10-10 11:25:59,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-10-10 11:25:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-10 11:25:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 126. [2018-10-10 11:25:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 11:25:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2018-10-10 11:25:59,522 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 18 [2018-10-10 11:25:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:59,522 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2018-10-10 11:25:59,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2018-10-10 11:25:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-10 11:25:59,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:59,524 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] [2018-10-10 11:25:59,524 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:25:59,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1463621595, now seen corresponding path program 1 times [2018-10-10 11:25:59,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:59,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:59,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:59,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:59,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:59,716 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-10 11:25:59,983 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 11:25:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:59,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:59,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:59,985 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand 7 states. [2018-10-10 11:26:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:00,850 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-10-10 11:26:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:26:00,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-10 11:26:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:00,852 INFO L225 Difference]: With dead ends: 125 [2018-10-10 11:26:00,852 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 11:26:00,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:26:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 11:26:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-10-10 11:26:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-10 11:26:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2018-10-10 11:26:00,856 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 20 [2018-10-10 11:26:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:00,857 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2018-10-10 11:26:00,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:26:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2018-10-10 11:26:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-10 11:26:00,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:00,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:00,859 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:00,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2086049629, now seen corresponding path program 1 times [2018-10-10 11:26:00,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:00,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:00,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:00,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:01,015 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 11:26:01,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:01,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:26:01,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:26:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:26:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:26:01,016 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 7 states. [2018-10-10 11:26:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:01,483 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-10-10 11:26:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 11:26:01,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-10 11:26:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:01,485 INFO L225 Difference]: With dead ends: 174 [2018-10-10 11:26:01,485 INFO L226 Difference]: Without dead ends: 174 [2018-10-10 11:26:01,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:26:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-10 11:26:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 115. [2018-10-10 11:26:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 11:26:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-10-10 11:26:01,489 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 22 [2018-10-10 11:26:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:01,490 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-10-10 11:26:01,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:26:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-10-10 11:26:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:26:01,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:01,491 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] [2018-10-10 11:26:01,491 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:01,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash 7366934, now seen corresponding path program 1 times [2018-10-10 11:26:01,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:01,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:01,627 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 11:26:01,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:26:01,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:26:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:26:01,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:26:01,629 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 4 states. [2018-10-10 11:26:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:01,739 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-10-10 11:26:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:26:01,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-10 11:26:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:01,741 INFO L225 Difference]: With dead ends: 148 [2018-10-10 11:26:01,741 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 11:26:01,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:26:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 11:26:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 115. [2018-10-10 11:26:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 11:26:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-10-10 11:26:01,745 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 24 [2018-10-10 11:26:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:01,745 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-10-10 11:26:01,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:26:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-10-10 11:26:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:26:01,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:01,746 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] [2018-10-10 11:26:01,747 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:01,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 7733173, now seen corresponding path program 1 times [2018-10-10 11:26:01,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:01,946 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 11:26:01,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:01,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:26:01,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:26:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:26:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:26:01,948 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 6 states. [2018-10-10 11:26:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:03,036 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-10-10 11:26:03,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:26:03,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-10 11:26:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:03,038 INFO L225 Difference]: With dead ends: 144 [2018-10-10 11:26:03,038 INFO L226 Difference]: Without dead ends: 144 [2018-10-10 11:26:03,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:26:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-10 11:26:03,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2018-10-10 11:26:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 11:26:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-10-10 11:26:03,042 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 24 [2018-10-10 11:26:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:03,042 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-10-10 11:26:03,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:26:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-10-10 11:26:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-10 11:26:03,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:03,043 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] [2018-10-10 11:26:03,043 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:03,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 239728519, now seen corresponding path program 1 times [2018-10-10 11:26:03,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:03,198 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 11:26:03,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:03,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:26:03,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:26:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:26:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:26:03,199 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 5 states. [2018-10-10 11:26:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:03,514 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2018-10-10 11:26:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:26:03,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-10 11:26:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:03,516 INFO L225 Difference]: With dead ends: 194 [2018-10-10 11:26:03,516 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 11:26:03,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:26:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 11:26:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 132. [2018-10-10 11:26:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 11:26:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-10-10 11:26:03,520 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 25 [2018-10-10 11:26:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:03,521 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-10-10 11:26:03,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:26:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-10-10 11:26:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-10 11:26:03,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:03,522 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] [2018-10-10 11:26:03,522 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:03,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1158350345, now seen corresponding path program 1 times [2018-10-10 11:26:03,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:03,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:04,031 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-10-10 11:26:04,316 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-10-10 11:26:04,467 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 11:26:04,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:04,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 11:26:04,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 11:26:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 11:26:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-10-10 11:26:04,468 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 14 states. [2018-10-10 11:26:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:05,420 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2018-10-10 11:26:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 11:26:05,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-10 11:26:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:05,422 INFO L225 Difference]: With dead ends: 211 [2018-10-10 11:26:05,422 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 11:26:05,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-10-10 11:26:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 11:26:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 149. [2018-10-10 11:26:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 11:26:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-10-10 11:26:05,427 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 26 [2018-10-10 11:26:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:05,427 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-10-10 11:26:05,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 11:26:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-10-10 11:26:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-10 11:26:05,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:05,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:05,429 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:05,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 427770447, now seen corresponding path program 1 times [2018-10-10 11:26:05,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:05,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 11:26:05,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:26:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:26:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:26:05,538 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 7 states. [2018-10-10 11:26:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:05,966 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-10-10 11:26:05,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:26:05,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-10 11:26:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:05,967 INFO L225 Difference]: With dead ends: 155 [2018-10-10 11:26:05,967 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 11:26:05,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:26:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 11:26:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-10 11:26:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:26:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-10-10 11:26:05,971 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 34 [2018-10-10 11:26:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:05,971 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-10-10 11:26:05,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:26:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-10-10 11:26:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 11:26:05,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:05,973 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:05,973 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:05,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1067214660, now seen corresponding path program 1 times [2018-10-10 11:26:05,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:05,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:05,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:06,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:26:06,426 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 11:26:06,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:06,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:26:06,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:26:06,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:26:06,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:06,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:06,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:06,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-10 11:26:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 11:26:06,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 11:26:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2018-10-10 11:26:06,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 11:26:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 11:26:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-10 11:26:06,989 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 18 states. [2018-10-10 11:26:08,452 WARN L178 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-10 11:26:09,121 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-10-10 11:26:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:10,670 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-10-10 11:26:10,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 11:26:10,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-10-10 11:26:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:10,674 INFO L225 Difference]: With dead ends: 242 [2018-10-10 11:26:10,674 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 11:26:10,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=384, Invalid=1596, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 11:26:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 11:26:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 133. [2018-10-10 11:26:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 11:26:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-10-10 11:26:10,679 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 38 [2018-10-10 11:26:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:10,679 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-10-10 11:26:10,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 11:26:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-10-10 11:26:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 11:26:10,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:10,680 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:10,680 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 11:26:10,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:10,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1023470948, now seen corresponding path program 1 times [2018-10-10 11:26:10,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:10,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:10,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:10,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:10,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:11,413 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 11:26:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:11,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:26:11,773 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 11:26:11,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:11,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:26:11,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:26:11,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:11,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:11,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 11:26:11,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:26:11,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:26:11,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:26:11,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:11,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:11,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-10-10 11:26:12,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:26:12,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:26:12,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-10 11:26:12,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:26:12,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-10 11:26:12,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:26:12,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-10-10 11:26:12,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-10 11:26:12,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-10 11:26:12,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:12,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-10-10 11:26:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 11:26:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2018-10-10 11:26:12,882 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= v_ULTIMATE.start_main_~list~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_#length_2|), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base_1| |v_#memory_$Pointer$.base_1|), (= |v_ULTIMATE.start_write~$Pointer$_#value.base_1| 0), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~list~0.offset_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= v_ULTIMATE.start_main_~list~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType_1| 4), (= |v_ULTIMATE.start_write~$Pointer$_#value.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_int_1| |v_#memory_int_1|), (= |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~list~0.base_1), (= |v_ULTIMATE.start_main_#t~malloc0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_#valid_4|)] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:174) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.extractUpdateRhs(SimultaneousUpdate.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:171) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.extractUpdateRhs(SimultaneousUpdate.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:104) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:489) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-10 11:26:12,888 INFO L168 Benchmark]: Toolchain (without parser) took 26539.95 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.8 MB). Peak memory consumption was 227.5 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:12,889 INFO L168 Benchmark]: CDTParser took 0.23 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 11:26:12,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.68 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 11:26:12,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:12,896 INFO L168 Benchmark]: Boogie Preprocessor took 143.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 687.3 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -779.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:12,896 INFO L168 Benchmark]: RCFGBuilder took 1178.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:12,897 INFO L168 Benchmark]: TraceAbstraction took 24556.07 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 345.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -113.9 MB). Peak memory consumption was 231.1 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:12,904 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.23 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. * CACSL2BoogieTranslator took 566.68 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 88.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 687.3 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -779.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1178.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24556.07 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 345.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -113.9 MB). Peak memory consumption was 231.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= v_ULTIMATE.start_main_~list~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_#length_2|), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base_1| |v_#memory_$Pointer$.base_1|), (= |v_ULTIMATE.start_write~$Pointer$_#value.base_1| 0), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~list~0.offset_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= v_ULTIMATE.start_main_~list~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType_1| 4), (= |v_ULTIMATE.start_write~$Pointer$_#value.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_int_1| |v_#memory_int_1|), (= |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~list~0.base_1), (= |v_ULTIMATE.start_main_#t~malloc0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_#valid_4|)] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= v_ULTIMATE.start_main_~list~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_#length_2|), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base_1| |v_#memory_$Pointer$.base_1|), (= |v_ULTIMATE.start_write~$Pointer$_#value.base_1| 0), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~list~0.offset_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= v_ULTIMATE.start_main_~list~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType_1| 4), (= |v_ULTIMATE.start_write~$Pointer$_#value.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_int_1| |v_#memory_int_1|), (= |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~list~0.base_1), (= |v_ULTIMATE.start_main_#t~malloc0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_#valid_4|)]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:174) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...