java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:54:08,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:54:08,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:54:08,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:54:08,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:54:08,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:54:08,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:54:08,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:54:08,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:54:08,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:54:08,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:54:08,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:54:08,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:54:08,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:54:08,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:54:08,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:54:08,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:54:08,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:54:08,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:54:08,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:54:08,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:54:08,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:54:08,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:54:08,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:54:08,407 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:54:08,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:54:08,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:54:08,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:54:08,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:54:08,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:54:08,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:54:08,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:54:08,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:54:08,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:54:08,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:54:08,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:54:08,423 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:54:08,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:54:08,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:54:08,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:54:08,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:54:08,440 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:54:08,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:54:08,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:54:08,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:54:08,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:54:08,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:54:08,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:54:08,441 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:54:08,441 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:54:08,442 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:54:08,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:54:08,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:54:08,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:54:08,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:54:08,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:54:08,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:54:08,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:54:08,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:54:08,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:54:08,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:54:08,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:54:08,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:54:08,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:54:08,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:54:08,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:54:08,527 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:54:08,527 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:54:08,529 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-10-10 14:54:08,841 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c561d577/63587c2766684bc98eecdd58f5a00ddb/FLAGd60fde74b [2018-10-10 14:54:09,069 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:54:09,070 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-10-10 14:54:09,078 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c561d577/63587c2766684bc98eecdd58f5a00ddb/FLAGd60fde74b [2018-10-10 14:54:09,103 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c561d577/63587c2766684bc98eecdd58f5a00ddb [2018-10-10 14:54:09,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:54:09,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:54:09,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:54:09,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:54:09,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:54:09,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c8a2496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09, skipping insertion in model container [2018-10-10 14:54:09,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:54:09,181 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:54:09,346 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:54:09,358 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:54:09,379 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:54:09,399 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:54:09,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09 WrapperNode [2018-10-10 14:54:09,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:54:09,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:54:09,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:54:09,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:54:09,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:54:09,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:54:09,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:54:09,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:54:09,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... [2018-10-10 14:54:09,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:54:09,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:54:09,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:54:09,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:54:09,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:54:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:54:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:54:10,992 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:54:10,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:10 BoogieIcfgContainer [2018-10-10 14:54:10,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:54:10,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:54:10,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:54:10,997 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:54:10,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:54:09" (1/3) ... [2018-10-10 14:54:10,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b61d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:10, skipping insertion in model container [2018-10-10 14:54:10,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:09" (2/3) ... [2018-10-10 14:54:10,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b61d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:10, skipping insertion in model container [2018-10-10 14:54:10,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:10" (3/3) ... [2018-10-10 14:54:11,001 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-10-10 14:54:11,010 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:54:11,019 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-10-10 14:54:11,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2018-10-10 14:54:11,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:54:11,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:54:11,063 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:54:11,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:54:11,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:54:11,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:54:11,064 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:54:11,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:54:11,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:54:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states. [2018-10-10 14:54:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-10 14:54:11,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:11,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:11,112 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:11,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash -783305148, now seen corresponding path program 1 times [2018-10-10 14:54:11,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:11,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:11,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:11,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:54:11,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:54:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:54:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:11,644 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 7 states. [2018-10-10 14:54:12,210 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-10 14:54:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:13,454 INFO L93 Difference]: Finished difference Result 385 states and 394 transitions. [2018-10-10 14:54:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:13,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-10-10 14:54:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:13,473 INFO L225 Difference]: With dead ends: 385 [2018-10-10 14:54:13,473 INFO L226 Difference]: Without dead ends: 380 [2018-10-10 14:54:13,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-10 14:54:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 280. [2018-10-10 14:54:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-10 14:54:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 285 transitions. [2018-10-10 14:54:13,532 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 285 transitions. Word has length 68 [2018-10-10 14:54:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:13,533 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 285 transitions. [2018-10-10 14:54:13,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:54:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 285 transitions. [2018-10-10 14:54:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 14:54:13,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:13,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:13,538 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:13,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:13,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1487344289, now seen corresponding path program 1 times [2018-10-10 14:54:13,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:13,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:13,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:13,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:13,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:13,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:13,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:54:13,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:54:13,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:54:13,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:13,972 INFO L87 Difference]: Start difference. First operand 280 states and 285 transitions. Second operand 11 states. [2018-10-10 14:54:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:15,391 INFO L93 Difference]: Finished difference Result 379 states and 388 transitions. [2018-10-10 14:54:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:54:15,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-10 14:54:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:15,397 INFO L225 Difference]: With dead ends: 379 [2018-10-10 14:54:15,397 INFO L226 Difference]: Without dead ends: 379 [2018-10-10 14:54:15,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:54:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-10 14:54:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 279. [2018-10-10 14:54:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 14:54:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 284 transitions. [2018-10-10 14:54:15,419 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 284 transitions. Word has length 69 [2018-10-10 14:54:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:15,420 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 284 transitions. [2018-10-10 14:54:15,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:54:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 284 transitions. [2018-10-10 14:54:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:54:15,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:15,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:15,424 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:15,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1241089351, now seen corresponding path program 1 times [2018-10-10 14:54:15,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:15,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:15,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:15,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:15,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:15,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:15,760 INFO L87 Difference]: Start difference. First operand 279 states and 284 transitions. Second operand 12 states. [2018-10-10 14:54:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:17,225 INFO L93 Difference]: Finished difference Result 378 states and 387 transitions. [2018-10-10 14:54:17,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:54:17,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-10-10 14:54:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:17,232 INFO L225 Difference]: With dead ends: 378 [2018-10-10 14:54:17,233 INFO L226 Difference]: Without dead ends: 378 [2018-10-10 14:54:17,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:54:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-10 14:54:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 278. [2018-10-10 14:54:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-10 14:54:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 283 transitions. [2018-10-10 14:54:17,263 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 283 transitions. Word has length 79 [2018-10-10 14:54:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:17,264 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 283 transitions. [2018-10-10 14:54:17,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 283 transitions. [2018-10-10 14:54:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 14:54:17,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:17,269 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:17,274 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:17,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1977198573, now seen corresponding path program 1 times [2018-10-10 14:54:17,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:17,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:17,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:17,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:17,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:17,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:17,609 INFO L87 Difference]: Start difference. First operand 278 states and 283 transitions. Second operand 12 states. [2018-10-10 14:54:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:18,666 INFO L93 Difference]: Finished difference Result 377 states and 386 transitions. [2018-10-10 14:54:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:54:18,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-10-10 14:54:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:18,671 INFO L225 Difference]: With dead ends: 377 [2018-10-10 14:54:18,671 INFO L226 Difference]: Without dead ends: 377 [2018-10-10 14:54:18,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:54:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-10 14:54:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 277. [2018-10-10 14:54:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-10 14:54:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 282 transitions. [2018-10-10 14:54:18,681 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 282 transitions. Word has length 89 [2018-10-10 14:54:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:18,682 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 282 transitions. [2018-10-10 14:54:18,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 282 transitions. [2018-10-10 14:54:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:54:18,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:18,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:18,686 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:18,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 183204499, now seen corresponding path program 1 times [2018-10-10 14:54:18,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:18,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:18,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:18,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:18,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:18,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:18,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:18,979 INFO L87 Difference]: Start difference. First operand 277 states and 282 transitions. Second operand 12 states. [2018-10-10 14:54:19,590 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-10 14:54:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:20,204 INFO L93 Difference]: Finished difference Result 376 states and 385 transitions. [2018-10-10 14:54:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:54:20,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-10-10 14:54:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:20,209 INFO L225 Difference]: With dead ends: 376 [2018-10-10 14:54:20,209 INFO L226 Difference]: Without dead ends: 376 [2018-10-10 14:54:20,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:54:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-10 14:54:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2018-10-10 14:54:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 14:54:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 281 transitions. [2018-10-10 14:54:20,215 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 281 transitions. Word has length 99 [2018-10-10 14:54:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:20,216 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 281 transitions. [2018-10-10 14:54:20,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 281 transitions. [2018-10-10 14:54:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:54:20,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:20,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:20,219 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:20,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash 986905913, now seen corresponding path program 1 times [2018-10-10 14:54:20,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:20,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:20,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:20,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:20,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:20,634 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:54:20,809 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:54:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:21,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:21,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:21,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:21,224 INFO L87 Difference]: Start difference. First operand 276 states and 281 transitions. Second operand 12 states. [2018-10-10 14:54:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:22,373 INFO L93 Difference]: Finished difference Result 375 states and 384 transitions. [2018-10-10 14:54:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:54:22,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-10 14:54:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:22,377 INFO L225 Difference]: With dead ends: 375 [2018-10-10 14:54:22,377 INFO L226 Difference]: Without dead ends: 375 [2018-10-10 14:54:22,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:54:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-10 14:54:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 275. [2018-10-10 14:54:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 14:54:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 280 transitions. [2018-10-10 14:54:22,384 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 280 transitions. Word has length 109 [2018-10-10 14:54:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:22,385 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 280 transitions. [2018-10-10 14:54:22,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 280 transitions. [2018-10-10 14:54:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 14:54:22,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:22,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:22,388 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:22,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash 194311998, now seen corresponding path program 1 times [2018-10-10 14:54:22,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:22,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:22,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:22,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:22,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:22,537 INFO L87 Difference]: Start difference. First operand 275 states and 280 transitions. Second operand 6 states. [2018-10-10 14:54:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:22,910 INFO L93 Difference]: Finished difference Result 368 states and 377 transitions. [2018-10-10 14:54:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:54:22,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-10-10 14:54:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:22,915 INFO L225 Difference]: With dead ends: 368 [2018-10-10 14:54:22,916 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 14:54:22,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:54:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 14:54:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 335. [2018-10-10 14:54:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-10 14:54:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 357 transitions. [2018-10-10 14:54:22,924 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 357 transitions. Word has length 117 [2018-10-10 14:54:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:22,924 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 357 transitions. [2018-10-10 14:54:22,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 357 transitions. [2018-10-10 14:54:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 14:54:22,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:22,926 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:22,927 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:22,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1728704802, now seen corresponding path program 1 times [2018-10-10 14:54:22,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:22,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:22,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:22,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:23,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:23,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:23,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:23,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:23,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:23,339 INFO L87 Difference]: Start difference. First operand 335 states and 357 transitions. Second operand 6 states. [2018-10-10 14:54:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:23,957 INFO L93 Difference]: Finished difference Result 367 states and 376 transitions. [2018-10-10 14:54:23,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:54:23,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2018-10-10 14:54:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:23,960 INFO L225 Difference]: With dead ends: 367 [2018-10-10 14:54:23,960 INFO L226 Difference]: Without dead ends: 367 [2018-10-10 14:54:23,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-10 14:54:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2018-10-10 14:54:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-10 14:54:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 356 transitions. [2018-10-10 14:54:23,967 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 356 transitions. Word has length 118 [2018-10-10 14:54:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:23,968 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 356 transitions. [2018-10-10 14:54:23,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 356 transitions. [2018-10-10 14:54:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:54:23,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:23,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:23,971 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:23,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2050241472, now seen corresponding path program 1 times [2018-10-10 14:54:23,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:23,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:24,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:24,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:54:24,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:54:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:54:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:54:24,208 INFO L87 Difference]: Start difference. First operand 334 states and 356 transitions. Second operand 8 states. [2018-10-10 14:54:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:24,493 INFO L93 Difference]: Finished difference Result 327 states and 344 transitions. [2018-10-10 14:54:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:24,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 119 [2018-10-10 14:54:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:24,497 INFO L225 Difference]: With dead ends: 327 [2018-10-10 14:54:24,497 INFO L226 Difference]: Without dead ends: 327 [2018-10-10 14:54:24,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-10 14:54:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-10 14:54:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-10 14:54:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 344 transitions. [2018-10-10 14:54:24,503 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 344 transitions. Word has length 119 [2018-10-10 14:54:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:24,504 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 344 transitions. [2018-10-10 14:54:24,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:54:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 344 transitions. [2018-10-10 14:54:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 14:54:24,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:24,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:24,506 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:24,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash -867023644, now seen corresponding path program 1 times [2018-10-10 14:54:24,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:24,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:24,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:24,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:54:24,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:54:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:54:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:54:24,811 INFO L87 Difference]: Start difference. First operand 327 states and 344 transitions. Second operand 8 states. [2018-10-10 14:54:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:25,167 INFO L93 Difference]: Finished difference Result 326 states and 343 transitions. [2018-10-10 14:54:25,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:54:25,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2018-10-10 14:54:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:25,171 INFO L225 Difference]: With dead ends: 326 [2018-10-10 14:54:25,171 INFO L226 Difference]: Without dead ends: 326 [2018-10-10 14:54:25,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:54:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-10 14:54:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2018-10-10 14:54:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-10 14:54:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 343 transitions. [2018-10-10 14:54:25,179 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 343 transitions. Word has length 120 [2018-10-10 14:54:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:25,179 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 343 transitions. [2018-10-10 14:54:25,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:54:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 343 transitions. [2018-10-10 14:54:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 14:54:25,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:25,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:25,182 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:25,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1178312426, now seen corresponding path program 1 times [2018-10-10 14:54:25,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:25,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:25,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:25,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:25,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:25,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:25,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:25,347 INFO L87 Difference]: Start difference. First operand 326 states and 343 transitions. Second operand 6 states. [2018-10-10 14:54:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:26,739 INFO L93 Difference]: Finished difference Result 362 states and 371 transitions. [2018-10-10 14:54:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:54:26,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-10 14:54:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:26,743 INFO L225 Difference]: With dead ends: 362 [2018-10-10 14:54:26,744 INFO L226 Difference]: Without dead ends: 362 [2018-10-10 14:54:26,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:54:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-10 14:54:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 325. [2018-10-10 14:54:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-10 14:54:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 338 transitions. [2018-10-10 14:54:26,752 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 338 transitions. Word has length 135 [2018-10-10 14:54:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:26,753 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 338 transitions. [2018-10-10 14:54:26,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 338 transitions. [2018-10-10 14:54:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 14:54:26,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:26,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:26,756 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:26,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:26,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2127020268, now seen corresponding path program 1 times [2018-10-10 14:54:26,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:26,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:26,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:26,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:26,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:26,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:26,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:54:26,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:54:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:54:26,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:54:26,974 INFO L87 Difference]: Start difference. First operand 325 states and 338 transitions. Second operand 4 states. [2018-10-10 14:54:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:27,205 INFO L93 Difference]: Finished difference Result 328 states and 341 transitions. [2018-10-10 14:54:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:54:27,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-10-10 14:54:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:27,209 INFO L225 Difference]: With dead ends: 328 [2018-10-10 14:54:27,210 INFO L226 Difference]: Without dead ends: 328 [2018-10-10 14:54:27,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:54:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-10 14:54:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-10 14:54:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-10 14:54:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 339 transitions. [2018-10-10 14:54:27,215 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 339 transitions. Word has length 136 [2018-10-10 14:54:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:27,216 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 339 transitions. [2018-10-10 14:54:27,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:54:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 339 transitions. [2018-10-10 14:54:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 14:54:27,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:27,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:27,218 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:27,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1997070124, now seen corresponding path program 1 times [2018-10-10 14:54:27,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:27,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:27,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:27,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:27,369 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 14:54:27,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:27,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:27,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:27,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:54:27,698 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-2_false-valid-deref.i_13.bpl [2018-10-10 14:54:27,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:54:27,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:54:27,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:27,704 INFO L87 Difference]: Start difference. First operand 326 states and 339 transitions. Second operand 7 states. [2018-10-10 14:54:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:27,842 INFO L93 Difference]: Finished difference Result 331 states and 344 transitions. [2018-10-10 14:54:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:54:27,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-10-10 14:54:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:27,846 INFO L225 Difference]: With dead ends: 331 [2018-10-10 14:54:27,846 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 14:54:27,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 14:54:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-10 14:54:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-10 14:54:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 342 transitions. [2018-10-10 14:54:27,857 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 342 transitions. Word has length 139 [2018-10-10 14:54:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:27,857 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 342 transitions. [2018-10-10 14:54:27,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:54:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 342 transitions. [2018-10-10 14:54:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 14:54:27,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:27,862 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:27,863 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:27,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:27,864 INFO L82 PathProgramCache]: Analyzing trace with hash 939468820, now seen corresponding path program 2 times [2018-10-10 14:54:27,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:27,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:27,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:28,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:28,157 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 14:54:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:54:28,230 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:54:28,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:54:28,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:28,470 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 14:54:28,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:28,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:28,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:54:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 14:54:28,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:54:28,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-10-10 14:54:28,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:28,753 INFO L87 Difference]: Start difference. First operand 329 states and 342 transitions. Second operand 12 states. [2018-10-10 14:54:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:29,429 INFO L93 Difference]: Finished difference Result 333 states and 346 transitions. [2018-10-10 14:54:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:54:29,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-10-10 14:54:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:29,434 INFO L225 Difference]: With dead ends: 333 [2018-10-10 14:54:29,434 INFO L226 Difference]: Without dead ends: 333 [2018-10-10 14:54:29,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:54:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-10 14:54:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2018-10-10 14:54:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-10 14:54:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 344 transitions. [2018-10-10 14:54:29,444 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 344 transitions. Word has length 142 [2018-10-10 14:54:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:29,445 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 344 transitions. [2018-10-10 14:54:29,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 344 transitions. [2018-10-10 14:54:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 14:54:29,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:29,446 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:29,447 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:29,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 983092595, now seen corresponding path program 1 times [2018-10-10 14:54:29,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:29,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:29,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:29,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:54:29,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:29,565 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:54:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:29,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:29,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:29,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-10 14:54:29,792 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-2_false-valid-deref.i_15.bpl [2018-10-10 14:54:29,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:54:29,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:54:29,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:29,795 INFO L87 Difference]: Start difference. First operand 331 states and 344 transitions. Second operand 11 states. [2018-10-10 14:54:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:29,860 INFO L93 Difference]: Finished difference Result 336 states and 349 transitions. [2018-10-10 14:54:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:54:29,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 157 [2018-10-10 14:54:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:29,863 INFO L225 Difference]: With dead ends: 336 [2018-10-10 14:54:29,864 INFO L226 Difference]: Without dead ends: 336 [2018-10-10 14:54:29,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-10 14:54:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-10-10 14:54:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-10 14:54:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 347 transitions. [2018-10-10 14:54:29,870 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 347 transitions. Word has length 157 [2018-10-10 14:54:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:29,870 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 347 transitions. [2018-10-10 14:54:29,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:54:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 347 transitions. [2018-10-10 14:54:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-10 14:54:29,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:29,872 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:29,872 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:29,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 938847323, now seen corresponding path program 2 times [2018-10-10 14:54:29,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:29,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:29,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:30,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:30,239 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:54:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:54:30,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:54:30,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:54:30,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:30,446 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 14:54:30,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:30,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:30,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:54:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:54:30,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:54:30,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-10 14:54:30,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:54:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:54:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:54:30,883 INFO L87 Difference]: Start difference. First operand 334 states and 347 transitions. Second operand 14 states. [2018-10-10 14:54:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:31,692 INFO L93 Difference]: Finished difference Result 336 states and 348 transitions. [2018-10-10 14:54:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:54:31,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 160 [2018-10-10 14:54:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:31,694 INFO L225 Difference]: With dead ends: 336 [2018-10-10 14:54:31,694 INFO L226 Difference]: Without dead ends: 336 [2018-10-10 14:54:31,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:54:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-10 14:54:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-10-10 14:54:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-10 14:54:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 348 transitions. [2018-10-10 14:54:31,701 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 348 transitions. Word has length 160 [2018-10-10 14:54:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:31,701 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 348 transitions. [2018-10-10 14:54:31,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:54:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 348 transitions. [2018-10-10 14:54:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 14:54:31,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:31,703 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:31,704 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:31,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash -910834588, now seen corresponding path program 1 times [2018-10-10 14:54:31,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:31,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:54:31,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:32,476 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 14:54:32,797 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 14:54:33,973 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2018-10-10 14:54:34,110 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2018-10-10 14:54:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:34,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:34,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:54:34,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:34,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:34,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-10-10 14:54:34,953 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 14:54:34,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:34,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:34,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:34,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-10 14:54:35,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 14 [2018-10-10 14:54:35,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 treesize of output 19 [2018-10-10 14:54:35,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,154 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 14:54:35,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-10-10 14:54:35,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 14 [2018-10-10 14:54:35,194 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 treesize of output 19 [2018-10-10 14:54:35,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,208 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 14:54:35,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-10-10 14:54:35,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 14 [2018-10-10 14:54:35,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 treesize of output 19 [2018-10-10 14:54:35,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,308 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 14:54:35,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-10-10 14:54:35,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2018-10-10 14:54:35,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-10-10 14:54:35,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,358 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 14:54:35,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-10-10 14:54:35,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-10-10 14:54:35,542 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:54:35,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-10-10 14:54:35,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,566 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 24 treesize of output 23 [2018-10-10 14:54:35,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,590 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-10-10 14:54:35,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 47 [2018-10-10 14:54:35,729 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 47 [2018-10-10 14:54:35,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:35,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,782 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:35,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2018-10-10 14:54:35,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:35,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:35,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:35,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:90 [2018-10-10 14:54:36,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-10-10 14:54:36,070 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,071 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,071 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,072 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,078 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:54:36,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 116 [2018-10-10 14:54:36,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:36,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:36,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 69 [2018-10-10 14:54:36,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 127 [2018-10-10 14:54:36,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-10 14:54:36,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:36,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 85 [2018-10-10 14:54:36,470 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:36,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:54:36,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:54:36,654 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:134, output treesize:174 [2018-10-10 14:54:36,894 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-10 14:54:37,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-10-10 14:54:37,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,188 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:54:37,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 137 [2018-10-10 14:54:37,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:37,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:37,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2018-10-10 14:54:37,339 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:54:37,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 193 [2018-10-10 14:54:37,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:37,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:37,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 82 [2018-10-10 14:54:37,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 132 [2018-10-10 14:54:37,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:37,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,807 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,838 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:37,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 208 [2018-10-10 14:54:37,960 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-10-10 14:54:38,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:54:38,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:54:38,344 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:237, output treesize:276 [2018-10-10 14:54:38,668 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-10 14:54:38,984 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-10 14:54:39,113 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-10 14:54:39,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 80 [2018-10-10 14:54:39,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 158 [2018-10-10 14:54:39,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:39,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,402 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,420 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:39,521 INFO L303 Elim1Store]: Index analysis took 171 ms [2018-10-10 14:54:39,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 4 new quantified variables, introduced 24 case distinctions, treesize of input 66 treesize of output 267 [2018-10-10 14:54:39,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 16 xjuncts. [2018-10-10 14:54:40,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-10 14:54:40,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 75 treesize of output 56 [2018-10-10 14:54:40,406 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,466 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,470 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,474 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,485 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,525 INFO L303 Elim1Store]: Index analysis took 161 ms [2018-10-10 14:54:40,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 272 [2018-10-10 14:54:40,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:40,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:40,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 60 treesize of output 45 [2018-10-10 14:54:40,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:40,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 157 [2018-10-10 14:54:40,960 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:40,992 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:41,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 45 treesize of output 34 [2018-10-10 14:54:41,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 74 [2018-10-10 14:54:41,145 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:41,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:41,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-10 14:54:41,270 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:267, output treesize:277 [2018-10-10 14:54:41,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2018-10-10 14:54:41,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,939 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:41,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 87 [2018-10-10 14:54:41,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:42,023 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 15 treesize of output 8 [2018-10-10 14:54:42,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:42,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,091 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,106 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,112 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,149 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:42,209 INFO L303 Elim1Store]: Index analysis took 152 ms [2018-10-10 14:54:42,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 20 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 62 treesize of output 384 [2018-10-10 14:54:42,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-10-10 14:55:13,441 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 1048576 conjuctions. This might take some time...