java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/memsafety/test-0219_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:40,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:40,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:40,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:40,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:40,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:40,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:40,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:40,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:40,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:40,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:40,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:40,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:40,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:40,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:40,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:40,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:40,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:40,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:40,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:40,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:40,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:40,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:40,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:40,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:40,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:40,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:40,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:40,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:40,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:40,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:40,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:40,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:40,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:40,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:40,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:40,410 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:43:40,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:40,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:40,437 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:40,437 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:40,437 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:40,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:40,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:40,442 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:40,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:40,442 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:40,442 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:40,442 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:40,443 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:40,443 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:40,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:40,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:40,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:40,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:40,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:40,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:40,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:40,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:40,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:40,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:40,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:40,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:43:40,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:40,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:40,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:40,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:40,513 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:40,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0219_true-valid-memsafety.i [2018-10-10 14:43:40,835 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47680a931/beba827ccf9148569a50961ade575735/FLAG6f085db4a [2018-10-10 14:43:41,101 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:41,101 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0219_true-valid-memsafety.i [2018-10-10 14:43:41,116 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47680a931/beba827ccf9148569a50961ade575735/FLAG6f085db4a [2018-10-10 14:43:41,133 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47680a931/beba827ccf9148569a50961ade575735 [2018-10-10 14:43:41,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:41,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:41,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:41,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:41,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:41,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bf573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41, skipping insertion in model container [2018-10-10 14:43:41,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:41,227 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:41,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:41,504 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:41,586 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:41,667 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:41,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41 WrapperNode [2018-10-10 14:43:41,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:41,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:41,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:41,669 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:41,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:41,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:41,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:41,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:41,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... [2018-10-10 14:43:41,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:41,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:41,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:41,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:41,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:41,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:41,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:43,710 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:43,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:43 BoogieIcfgContainer [2018-10-10 14:43:43,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:43,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:43,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:43,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:43,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:41" (1/3) ... [2018-10-10 14:43:43,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428ccd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:43, skipping insertion in model container [2018-10-10 14:43:43,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:41" (2/3) ... [2018-10-10 14:43:43,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428ccd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:43, skipping insertion in model container [2018-10-10 14:43:43,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:43" (3/3) ... [2018-10-10 14:43:43,719 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0219_true-valid-memsafety.i [2018-10-10 14:43:43,727 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:43,735 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-10-10 14:43:43,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2018-10-10 14:43:43,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:43,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:43,781 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:43,781 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:43,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:43,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:43,782 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:43,782 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:43,782 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states. [2018-10-10 14:43:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-10 14:43:43,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:43,820 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:43,824 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:43,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1597552760, now seen corresponding path program 1 times [2018-10-10 14:43:43,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:43,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:43,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:44,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:44,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:44,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:44,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:44,159 INFO L87 Difference]: Start difference. First operand 420 states. Second operand 5 states. [2018-10-10 14:43:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:45,369 INFO L93 Difference]: Finished difference Result 577 states and 582 transitions. [2018-10-10 14:43:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:45,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-10 14:43:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:45,391 INFO L225 Difference]: With dead ends: 577 [2018-10-10 14:43:45,391 INFO L226 Difference]: Without dead ends: 568 [2018-10-10 14:43:45,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-10 14:43:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 410. [2018-10-10 14:43:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-10 14:43:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 415 transitions. [2018-10-10 14:43:45,463 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 415 transitions. Word has length 19 [2018-10-10 14:43:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:45,463 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 415 transitions. [2018-10-10 14:43:45,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 415 transitions. [2018-10-10 14:43:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-10 14:43:45,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:45,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:45,466 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:45,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2015472043, now seen corresponding path program 1 times [2018-10-10 14:43:45,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:45,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:45,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:45,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:45,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:45,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:45,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:45,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:45,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:45,638 INFO L87 Difference]: Start difference. First operand 410 states and 415 transitions. Second operand 7 states. [2018-10-10 14:43:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:46,248 INFO L93 Difference]: Finished difference Result 440 states and 445 transitions. [2018-10-10 14:43:46,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:46,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-10 14:43:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:46,254 INFO L225 Difference]: With dead ends: 440 [2018-10-10 14:43:46,254 INFO L226 Difference]: Without dead ends: 440 [2018-10-10 14:43:46,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-10 14:43:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 409. [2018-10-10 14:43:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-10 14:43:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 414 transitions. [2018-10-10 14:43:46,303 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 414 transitions. Word has length 20 [2018-10-10 14:43:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:46,303 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 414 transitions. [2018-10-10 14:43:46,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 414 transitions. [2018-10-10 14:43:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:43:46,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:46,306 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] [2018-10-10 14:43:46,309 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:46,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1952622559, now seen corresponding path program 1 times [2018-10-10 14:43:46,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:46,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:46,336 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:43:46,337 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:43:46,337 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:43:46,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:46,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:46,451 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:43:46,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:46,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:46,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:43:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:46,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:46,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:46,736 INFO L87 Difference]: Start difference. First operand 409 states and 414 transitions. Second operand 6 states. [2018-10-10 14:43:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:47,769 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2018-10-10 14:43:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:43:47,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-10-10 14:43:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:47,781 INFO L225 Difference]: With dead ends: 514 [2018-10-10 14:43:47,781 INFO L226 Difference]: Without dead ends: 514 [2018-10-10 14:43:47,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-10-10 14:43:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 407. [2018-10-10 14:43:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-10 14:43:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 412 transitions. [2018-10-10 14:43:47,804 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 412 transitions. Word has length 57 [2018-10-10 14:43:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:47,805 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 412 transitions. [2018-10-10 14:43:47,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 412 transitions. [2018-10-10 14:43:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 14:43:47,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:47,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:47,808 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:47,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 401757280, now seen corresponding path program 1 times [2018-10-10 14:43:47,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:47,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:47,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:47,825 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:43:47,825 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:43:47,825 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:43:47,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:47,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:47,984 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:43:47,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:48,002 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:43:48,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-10-10 14:43:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:48,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:48,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:43:48,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:43:48,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:43:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:48,130 INFO L87 Difference]: Start difference. First operand 407 states and 412 transitions. Second operand 11 states. [2018-10-10 14:43:48,647 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:43:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:49,191 INFO L93 Difference]: Finished difference Result 430 states and 435 transitions. [2018-10-10 14:43:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:43:49,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-10 14:43:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:49,196 INFO L225 Difference]: With dead ends: 430 [2018-10-10 14:43:49,196 INFO L226 Difference]: Without dead ends: 430 [2018-10-10 14:43:49,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:43:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-10 14:43:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 405. [2018-10-10 14:43:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-10 14:43:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 410 transitions. [2018-10-10 14:43:49,206 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 410 transitions. Word has length 58 [2018-10-10 14:43:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:49,207 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 410 transitions. [2018-10-10 14:43:49,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:43:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 410 transitions. [2018-10-10 14:43:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 14:43:49,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:49,212 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] [2018-10-10 14:43:49,213 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:49,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1351205886, now seen corresponding path program 1 times [2018-10-10 14:43:49,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:49,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:49,229 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:43:49,229 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:43:49,229 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:43:49,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:49,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:49,340 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:43:49,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:49,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:49,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:43:49,444 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:49,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:49,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:43:49,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:49,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:49,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-10 14:43:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:49,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:49,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:49,643 INFO L87 Difference]: Start difference. First operand 405 states and 410 transitions. Second operand 12 states. [2018-10-10 14:43:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:51,441 INFO L93 Difference]: Finished difference Result 560 states and 566 transitions. [2018-10-10 14:43:51,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:43:51,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-10-10 14:43:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:51,446 INFO L225 Difference]: With dead ends: 560 [2018-10-10 14:43:51,446 INFO L226 Difference]: Without dead ends: 560 [2018-10-10 14:43:51,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:43:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-10 14:43:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 403. [2018-10-10 14:43:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-10 14:43:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 408 transitions. [2018-10-10 14:43:51,455 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 408 transitions. Word has length 134 [2018-10-10 14:43:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:51,457 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 408 transitions. [2018-10-10 14:43:51,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 408 transitions. [2018-10-10 14:43:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 14:43:51,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:51,461 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:43:51,463 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:51,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1062290702, now seen corresponding path program 1 times [2018-10-10 14:43:51,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:51,476 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:43:51,477 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:43:51,477 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:43:51,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:51,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:51,764 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:43:51,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:51,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:51,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-10-10 14:43:52,288 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:43:52,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:52,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:52,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-10-10 14:43:52,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:52,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:52,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:52,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:52,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:52,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2018-10-10 14:43:52,670 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 17 [2018-10-10 14:43:52,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:52,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:52,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:17 [2018-10-10 14:43:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:52,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:52,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-10 14:43:52,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 14:43:52,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 14:43:52,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:43:52,860 INFO L87 Difference]: Start difference. First operand 403 states and 408 transitions. Second operand 18 states. [2018-10-10 14:43:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:57,223 INFO L93 Difference]: Finished difference Result 518 states and 523 transitions. [2018-10-10 14:43:57,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:43:57,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-10-10 14:43:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:57,228 INFO L225 Difference]: With dead ends: 518 [2018-10-10 14:43:57,228 INFO L226 Difference]: Without dead ends: 518 [2018-10-10 14:43:57,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=482, Invalid=1498, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 14:43:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-10 14:43:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 402. [2018-10-10 14:43:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-10 14:43:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 407 transitions. [2018-10-10 14:43:57,237 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 407 transitions. Word has length 135 [2018-10-10 14:43:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:57,238 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 407 transitions. [2018-10-10 14:43:57,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 14:43:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 407 transitions. [2018-10-10 14:43:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 14:43:57,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:57,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:57,242 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:57,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1815435373, now seen corresponding path program 1 times [2018-10-10 14:43:57,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:57,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:57,254 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:43:57,254 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:43:57,254 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:43:57,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:57,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:57,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:57,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:57,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:57,606 INFO L87 Difference]: Start difference. First operand 402 states and 407 transitions. Second operand 5 states. [2018-10-10 14:43:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:58,154 INFO L93 Difference]: Finished difference Result 527 states and 532 transitions. [2018-10-10 14:43:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:58,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-10 14:43:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:58,159 INFO L225 Difference]: With dead ends: 527 [2018-10-10 14:43:58,159 INFO L226 Difference]: Without dead ends: 527 [2018-10-10 14:43:58,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-10 14:43:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 401. [2018-10-10 14:43:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-10 14:43:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 406 transitions. [2018-10-10 14:43:58,168 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 406 transitions. Word has length 143 [2018-10-10 14:43:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:58,168 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 406 transitions. [2018-10-10 14:43:58,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 406 transitions. [2018-10-10 14:43:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 14:43:58,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:58,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:58,172 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:58,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash -443921496, now seen corresponding path program 1 times [2018-10-10 14:43:58,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:58,186 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:43:58,186 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:43:58,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:43:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:58,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:58,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:58,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:43:58,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:43:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:43:58,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:58,519 INFO L87 Difference]: Start difference. First operand 401 states and 406 transitions. Second operand 11 states. [2018-10-10 14:44:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:00,265 INFO L93 Difference]: Finished difference Result 454 states and 460 transitions. [2018-10-10 14:44:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:44:00,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2018-10-10 14:44:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:00,270 INFO L225 Difference]: With dead ends: 454 [2018-10-10 14:44:00,270 INFO L226 Difference]: Without dead ends: 454 [2018-10-10 14:44:00,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:44:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-10 14:44:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 400. [2018-10-10 14:44:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-10 14:44:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 405 transitions. [2018-10-10 14:44:00,278 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 405 transitions. Word has length 144 [2018-10-10 14:44:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:00,279 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 405 transitions. [2018-10-10 14:44:00,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:44:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 405 transitions. [2018-10-10 14:44:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 14:44:00,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:00,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:00,282 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:00,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash -146473535, now seen corresponding path program 1 times [2018-10-10 14:44:00,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:00,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:00,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:00,293 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:00,293 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:00,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:00,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:00,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:00,379 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:44:00,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:00,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:00,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:44:00,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:00,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:00,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:44:00,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:00,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:00,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-10 14:44:00,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-10 14:44:00,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:00,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:00,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-10-10 14:44:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:00,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:44:00,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:44:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:44:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:44:00,763 INFO L87 Difference]: Start difference. First operand 400 states and 405 transitions. Second operand 15 states. [2018-10-10 14:44:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:03,793 INFO L93 Difference]: Finished difference Result 971 states and 981 transitions. [2018-10-10 14:44:03,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 14:44:03,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 155 [2018-10-10 14:44:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:03,797 INFO L225 Difference]: With dead ends: 971 [2018-10-10 14:44:03,797 INFO L226 Difference]: Without dead ends: 971 [2018-10-10 14:44:03,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 14:44:03,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-10 14:44:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 483. [2018-10-10 14:44:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-10 14:44:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 489 transitions. [2018-10-10 14:44:03,810 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 489 transitions. Word has length 155 [2018-10-10 14:44:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:03,811 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 489 transitions. [2018-10-10 14:44:03,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:44:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 489 transitions. [2018-10-10 14:44:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 14:44:03,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:03,813 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:03,814 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:03,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -245712049, now seen corresponding path program 1 times [2018-10-10 14:44:03,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:03,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:03,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:03,825 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:03,825 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:03,826 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:03,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:04,068 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:44:04,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:04,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:04,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-10-10 14:44:04,112 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:44:04,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:04,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:04,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-10-10 14:44:04,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:04,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:04,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:44:04,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:04,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:04,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:31 [2018-10-10 14:44:04,675 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 17 [2018-10-10 14:44:04,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:04,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:04,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:31 [2018-10-10 14:44:05,312 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-10 14:44:05,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:05,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:05,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:05,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-10 14:44:05,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:05,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:05,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2018-10-10 14:44:06,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 17 [2018-10-10 14:44:06,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:06,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:06,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:17 [2018-10-10 14:44:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-10-10 14:44:06,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 14:44:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 14:44:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:44:06,770 INFO L87 Difference]: Start difference. First operand 483 states and 489 transitions. Second operand 24 states. [2018-10-10 14:44:08,532 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-10-10 14:44:09,903 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-10-10 14:44:10,090 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-10-10 14:44:10,394 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-10-10 14:44:10,655 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-10-10 14:44:11,688 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-10 14:44:13,621 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-10 14:44:13,846 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-10-10 14:44:14,358 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-10-10 14:44:14,757 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-10-10 14:44:15,116 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-10 14:44:15,449 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-10-10 14:44:15,850 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-10 14:44:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:17,563 INFO L93 Difference]: Finished difference Result 985 states and 995 transitions. [2018-10-10 14:44:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 14:44:17,564 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2018-10-10 14:44:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:17,569 INFO L225 Difference]: With dead ends: 985 [2018-10-10 14:44:17,569 INFO L226 Difference]: Without dead ends: 985 [2018-10-10 14:44:17,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1404, Invalid=4758, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 14:44:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-10-10 14:44:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 484. [2018-10-10 14:44:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-10 14:44:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 490 transitions. [2018-10-10 14:44:17,581 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 490 transitions. Word has length 156 [2018-10-10 14:44:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:17,581 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 490 transitions. [2018-10-10 14:44:17,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 14:44:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 490 transitions. [2018-10-10 14:44:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 14:44:17,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:17,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:17,585 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:17,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash -528624536, now seen corresponding path program 1 times [2018-10-10 14:44:17,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:17,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:17,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:17,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:17,596 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:17,596 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:17,596 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:17,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:17,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:17,769 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:44:17,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:17,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:17,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-10-10 14:44:17,829 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:44:17,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:17,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:17,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-10-10 14:44:18,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:18,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:18,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:44:18,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:18,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:18,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2018-10-10 14:44:18,190 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 17 [2018-10-10 14:44:18,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:18,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:18,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:17 [2018-10-10 14:44:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:18,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-10-10 14:44:18,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:44:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:44:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:44:18,495 INFO L87 Difference]: Start difference. First operand 484 states and 490 transitions. Second operand 19 states. [2018-10-10 14:44:21,710 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-10 14:44:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:23,224 INFO L93 Difference]: Finished difference Result 590 states and 596 transitions. [2018-10-10 14:44:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:44:23,225 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 167 [2018-10-10 14:44:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:23,229 INFO L225 Difference]: With dead ends: 590 [2018-10-10 14:44:23,230 INFO L226 Difference]: Without dead ends: 590 [2018-10-10 14:44:23,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=516, Invalid=1646, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 14:44:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-10 14:44:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 483. [2018-10-10 14:44:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-10 14:44:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 489 transitions. [2018-10-10 14:44:23,238 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 489 transitions. Word has length 167 [2018-10-10 14:44:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:23,239 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 489 transitions. [2018-10-10 14:44:23,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:44:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 489 transitions. [2018-10-10 14:44:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-10 14:44:23,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:23,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:23,242 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:23,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash -578627282, now seen corresponding path program 1 times [2018-10-10 14:44:23,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:23,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:23,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:23,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:23,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:23,253 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:23,253 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:23,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:23,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:23,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:23,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:23,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:44:23,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:44:23,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:44:23,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:44:23,421 INFO L87 Difference]: Start difference. First operand 483 states and 489 transitions. Second operand 5 states. [2018-10-10 14:44:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:23,793 INFO L93 Difference]: Finished difference Result 624 states and 630 transitions. [2018-10-10 14:44:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:44:23,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2018-10-10 14:44:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:23,798 INFO L225 Difference]: With dead ends: 624 [2018-10-10 14:44:23,798 INFO L226 Difference]: Without dead ends: 624 [2018-10-10 14:44:23,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:44:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-10 14:44:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 482. [2018-10-10 14:44:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-10 14:44:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 488 transitions. [2018-10-10 14:44:23,808 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 488 transitions. Word has length 177 [2018-10-10 14:44:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:23,808 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 488 transitions. [2018-10-10 14:44:23,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:44:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 488 transitions. [2018-10-10 14:44:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-10 14:44:23,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:23,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:23,811 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:23,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -757576292, now seen corresponding path program 1 times [2018-10-10 14:44:23,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:23,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:23,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:23,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:23,821 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:23,822 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:23,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:23,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:23,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:24,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:44:24,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:44:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:44:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:44:24,079 INFO L87 Difference]: Start difference. First operand 482 states and 488 transitions. Second operand 13 states. [2018-10-10 14:44:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:25,229 INFO L93 Difference]: Finished difference Result 531 states and 538 transitions. [2018-10-10 14:44:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 14:44:25,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 178 [2018-10-10 14:44:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:25,233 INFO L225 Difference]: With dead ends: 531 [2018-10-10 14:44:25,234 INFO L226 Difference]: Without dead ends: 531 [2018-10-10 14:44:25,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=1599, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 14:44:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-10 14:44:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 481. [2018-10-10 14:44:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-10-10 14:44:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 487 transitions. [2018-10-10 14:44:25,242 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 487 transitions. Word has length 178 [2018-10-10 14:44:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:25,243 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 487 transitions. [2018-10-10 14:44:25,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:44:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 487 transitions. [2018-10-10 14:44:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 14:44:25,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:25,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:25,245 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:25,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1286169260, now seen corresponding path program 1 times [2018-10-10 14:44:25,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:25,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:25,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:25,256 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:25,256 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:25,256 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:25,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:25,341 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:44:25,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:25,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:25,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:44:25,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:25,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:25,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:44:25,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:25,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:25,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-10 14:44:25,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-10 14:44:25,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:25,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:25,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-10-10 14:44:26,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-10 14:44:26,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:26,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:26,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2018-10-10 14:44:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:26,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:26,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-10-10 14:44:26,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:44:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:44:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:44:26,451 INFO L87 Difference]: Start difference. First operand 481 states and 487 transitions. Second operand 19 states. [2018-10-10 14:44:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:29,713 INFO L93 Difference]: Finished difference Result 1128 states and 1140 transitions. [2018-10-10 14:44:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 14:44:29,713 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2018-10-10 14:44:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:29,717 INFO L225 Difference]: With dead ends: 1128 [2018-10-10 14:44:29,717 INFO L226 Difference]: Without dead ends: 1128 [2018-10-10 14:44:29,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 14:44:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-10-10 14:44:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 752. [2018-10-10 14:44:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-10 14:44:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 767 transitions. [2018-10-10 14:44:29,731 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 767 transitions. Word has length 190 [2018-10-10 14:44:29,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:29,732 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 767 transitions. [2018-10-10 14:44:29,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:44:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 767 transitions. [2018-10-10 14:44:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 14:44:29,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:29,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:29,734 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:29,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1216541687, now seen corresponding path program 1 times [2018-10-10 14:44:29,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:29,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:29,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:29,744 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:29,744 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:29,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:29,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:29,851 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:44:29,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:29,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:29,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:44:29,884 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:44:29,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:29,889 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:44:29,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:44:29,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:29,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:29,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:44:29,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:29,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:29,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-10-10 14:44:30,007 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 12 treesize of output 15 [2018-10-10 14:44:30,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:30,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:30,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:23 [2018-10-10 14:44:30,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:44:30,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:30,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:30,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:36 [2018-10-10 14:44:30,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:44:30,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:30,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:30,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:36 [2018-10-10 14:44:30,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,634 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:30,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-10 14:44:30,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:30,654 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:44:30,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-10-10 14:44:30,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:44:30,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:30,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:30,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-10-10 14:44:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:31,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-10-10 14:44:31,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 14:44:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 14:44:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:44:31,033 INFO L87 Difference]: Start difference. First operand 752 states and 767 transitions. Second operand 28 states. [2018-10-10 14:44:32,561 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2018-10-10 14:44:32,747 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-10-10 14:44:33,187 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-10-10 14:44:34,115 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2018-10-10 14:44:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:36,486 INFO L93 Difference]: Finished difference Result 1127 states and 1139 transitions. [2018-10-10 14:44:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 14:44:36,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 191 [2018-10-10 14:44:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:36,492 INFO L225 Difference]: With dead ends: 1127 [2018-10-10 14:44:36,492 INFO L226 Difference]: Without dead ends: 1127 [2018-10-10 14:44:36,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=598, Invalid=3184, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 14:44:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2018-10-10 14:44:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 752. [2018-10-10 14:44:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-10 14:44:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 766 transitions. [2018-10-10 14:44:36,506 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 766 transitions. Word has length 191 [2018-10-10 14:44:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:36,507 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 766 transitions. [2018-10-10 14:44:36,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 14:44:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 766 transitions. [2018-10-10 14:44:36,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 14:44:36,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:36,509 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:36,509 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:36,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1851214269, now seen corresponding path program 1 times [2018-10-10 14:44:36,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:36,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:36,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:36,520 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:36,520 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:36,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:36,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:37,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:37,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:44:37,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:44:37,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:44:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:44:37,133 INFO L87 Difference]: Start difference. First operand 752 states and 766 transitions. Second operand 7 states. [2018-10-10 14:44:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:37,822 INFO L93 Difference]: Finished difference Result 877 states and 890 transitions. [2018-10-10 14:44:37,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:44:37,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-10-10 14:44:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:37,827 INFO L225 Difference]: With dead ends: 877 [2018-10-10 14:44:37,827 INFO L226 Difference]: Without dead ends: 877 [2018-10-10 14:44:37,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:44:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-10-10 14:44:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 751. [2018-10-10 14:44:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-10-10 14:44:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 764 transitions. [2018-10-10 14:44:37,838 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 764 transitions. Word has length 201 [2018-10-10 14:44:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:37,839 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 764 transitions. [2018-10-10 14:44:37,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:44:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 764 transitions. [2018-10-10 14:44:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-10 14:44:37,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:37,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:37,841 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:37,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1553067795, now seen corresponding path program 1 times [2018-10-10 14:44:37,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:37,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:37,849 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:37,849 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:37,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:37,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:37,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:44:38,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:44:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:44:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:44:38,194 INFO L87 Difference]: Start difference. First operand 751 states and 764 transitions. Second operand 13 states. [2018-10-10 14:44:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:39,364 INFO L93 Difference]: Finished difference Result 750 states and 762 transitions. [2018-10-10 14:44:39,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:44:39,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 202 [2018-10-10 14:44:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:39,368 INFO L225 Difference]: With dead ends: 750 [2018-10-10 14:44:39,368 INFO L226 Difference]: Without dead ends: 750 [2018-10-10 14:44:39,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:44:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-10 14:44:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2018-10-10 14:44:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-10-10 14:44:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 762 transitions. [2018-10-10 14:44:39,381 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 762 transitions. Word has length 202 [2018-10-10 14:44:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:39,381 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 762 transitions. [2018-10-10 14:44:39,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:44:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 762 transitions. [2018-10-10 14:44:39,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-10 14:44:39,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:39,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:39,383 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:39,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:39,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1681143396, now seen corresponding path program 1 times [2018-10-10 14:44:39,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:39,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:39,392 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:39,392 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:39,392 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:39,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:39,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:40,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:40,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:44:40,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:44:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:44:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:44:40,483 INFO L87 Difference]: Start difference. First operand 750 states and 762 transitions. Second operand 9 states. [2018-10-10 14:44:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:41,167 INFO L93 Difference]: Finished difference Result 884 states and 897 transitions. [2018-10-10 14:44:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:44:41,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 213 [2018-10-10 14:44:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:41,172 INFO L225 Difference]: With dead ends: 884 [2018-10-10 14:44:41,172 INFO L226 Difference]: Without dead ends: 884 [2018-10-10 14:44:41,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:44:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-10-10 14:44:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 749. [2018-10-10 14:44:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-10-10 14:44:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 761 transitions. [2018-10-10 14:44:41,185 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 761 transitions. Word has length 213 [2018-10-10 14:44:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:41,186 INFO L481 AbstractCegarLoop]: Abstraction has 749 states and 761 transitions. [2018-10-10 14:44:41,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:44:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 761 transitions. [2018-10-10 14:44:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 14:44:41,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:41,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:41,188 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:41,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash -151025022, now seen corresponding path program 1 times [2018-10-10 14:44:41,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:41,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:41,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:41,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:41,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:41,198 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:41,198 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:41,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:41,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:41,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:41,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:41,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:44:41,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:44:41,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:44:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:44:41,504 INFO L87 Difference]: Start difference. First operand 749 states and 761 transitions. Second operand 7 states. [2018-10-10 14:44:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:41,881 INFO L93 Difference]: Finished difference Result 782 states and 794 transitions. [2018-10-10 14:44:41,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:44:41,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2018-10-10 14:44:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:41,886 INFO L225 Difference]: With dead ends: 782 [2018-10-10 14:44:41,887 INFO L226 Difference]: Without dead ends: 782 [2018-10-10 14:44:41,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:44:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-10-10 14:44:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 747. [2018-10-10 14:44:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-10-10 14:44:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 759 transitions. [2018-10-10 14:44:41,896 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 759 transitions. Word has length 226 [2018-10-10 14:44:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:41,896 INFO L481 AbstractCegarLoop]: Abstraction has 747 states and 759 transitions. [2018-10-10 14:44:41,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:44:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 759 transitions. [2018-10-10 14:44:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 14:44:41,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:41,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:41,898 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash -386808041, now seen corresponding path program 1 times [2018-10-10 14:44:41,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:41,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:41,907 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:41,907 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:41,907 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:41,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:41,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:42,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:42,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:44:42,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:44:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:44:42,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:44:42,363 INFO L87 Difference]: Start difference. First operand 747 states and 759 transitions. Second operand 9 states. [2018-10-10 14:44:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:42,941 INFO L93 Difference]: Finished difference Result 746 states and 758 transitions. [2018-10-10 14:44:42,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:44:42,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 227 [2018-10-10 14:44:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:42,946 INFO L225 Difference]: With dead ends: 746 [2018-10-10 14:44:42,946 INFO L226 Difference]: Without dead ends: 746 [2018-10-10 14:44:42,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:44:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-10-10 14:44:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 743. [2018-10-10 14:44:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-10-10 14:44:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 755 transitions. [2018-10-10 14:44:42,956 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 755 transitions. Word has length 227 [2018-10-10 14:44:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:42,956 INFO L481 AbstractCegarLoop]: Abstraction has 743 states and 755 transitions. [2018-10-10 14:44:42,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:44:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 755 transitions. [2018-10-10 14:44:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 14:44:42,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:42,958 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:42,958 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:42,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 584712104, now seen corresponding path program 1 times [2018-10-10 14:44:42,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:42,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:42,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:42,967 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:42,967 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:42,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:42,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:43,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:43,318 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:44:43,321 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:44:43,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:43,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:43,326 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:44:43,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-10-10 14:44:43,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-10 14:44:43,344 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 13 treesize of output 5 [2018-10-10 14:44:43,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:43,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:43,347 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:44:43,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-10 14:44:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:43,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:43,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:44:43,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:44:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:44:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:44:43,516 INFO L87 Difference]: Start difference. First operand 743 states and 755 transitions. Second operand 14 states. [2018-10-10 14:44:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:45,160 INFO L93 Difference]: Finished difference Result 832 states and 844 transitions. [2018-10-10 14:44:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:44:45,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 236 [2018-10-10 14:44:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:45,165 INFO L225 Difference]: With dead ends: 832 [2018-10-10 14:44:45,165 INFO L226 Difference]: Without dead ends: 832 [2018-10-10 14:44:45,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=898, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:44:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-10-10 14:44:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 757. [2018-10-10 14:44:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-10-10 14:44:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 769 transitions. [2018-10-10 14:44:45,174 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 769 transitions. Word has length 236 [2018-10-10 14:44:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:45,174 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 769 transitions. [2018-10-10 14:44:45,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:44:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 769 transitions. [2018-10-10 14:44:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-10 14:44:45,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:45,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:45,177 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:45,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash 946206397, now seen corresponding path program 1 times [2018-10-10 14:44:45,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:45,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:45,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:45,186 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:45,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:45,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:45,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:45,603 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:44:45,606 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:44:45,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,617 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:44:45,626 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:44:45,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2018-10-10 14:44:45,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-10 14:44:45,669 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 19 treesize of output 11 [2018-10-10 14:44:45,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-10 14:44:45,684 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 20 treesize of output 11 [2018-10-10 14:44:45,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:45,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-10-10 14:44:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:45,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:45,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:44:45,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:44:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:44:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:44:45,900 INFO L87 Difference]: Start difference. First operand 757 states and 769 transitions. Second operand 16 states. [2018-10-10 14:44:46,550 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 14:44:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:48,384 INFO L93 Difference]: Finished difference Result 888 states and 901 transitions. [2018-10-10 14:44:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:44:48,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 237 [2018-10-10 14:44:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:48,390 INFO L225 Difference]: With dead ends: 888 [2018-10-10 14:44:48,390 INFO L226 Difference]: Without dead ends: 888 [2018-10-10 14:44:48,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:44:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-10 14:44:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 758. [2018-10-10 14:44:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-10-10 14:44:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 770 transitions. [2018-10-10 14:44:48,400 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 770 transitions. Word has length 237 [2018-10-10 14:44:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:48,401 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 770 transitions. [2018-10-10 14:44:48,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:44:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 770 transitions. [2018-10-10 14:44:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-10 14:44:48,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:48,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:48,403 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:48,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -841668790, now seen corresponding path program 1 times [2018-10-10 14:44:48,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:48,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:48,412 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:48,412 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:48,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:48,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:48,634 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:44:48,636 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:44:48,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:48,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:48,645 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:44:48,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-10-10 14:44:48,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-10 14:44:48,669 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 13 treesize of output 5 [2018-10-10 14:44:48,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:48,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:48,686 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:44:48,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-10 14:44:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:48,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:44:48,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:44:48,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:44:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:44:48,853 INFO L87 Difference]: Start difference. First operand 758 states and 770 transitions. Second operand 14 states. [2018-10-10 14:44:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:50,613 INFO L93 Difference]: Finished difference Result 830 states and 842 transitions. [2018-10-10 14:44:50,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:44:50,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 259 [2018-10-10 14:44:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:50,618 INFO L225 Difference]: With dead ends: 830 [2018-10-10 14:44:50,618 INFO L226 Difference]: Without dead ends: 830 [2018-10-10 14:44:50,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:44:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-10-10 14:44:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 780. [2018-10-10 14:44:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-10 14:44:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 792 transitions. [2018-10-10 14:44:50,626 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 792 transitions. Word has length 259 [2018-10-10 14:44:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:50,626 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 792 transitions. [2018-10-10 14:44:50,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:44:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 792 transitions. [2018-10-10 14:44:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-10 14:44:50,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:50,628 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:50,629 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:50,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash -321928330, now seen corresponding path program 1 times [2018-10-10 14:44:50,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:50,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:50,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:50,637 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:50,638 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:50,638 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:50,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:50,940 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:44:50,955 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:44:50,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:50,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:50,976 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:44:50,983 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:44:50,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:50,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:50,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:50,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2018-10-10 14:44:51,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-10 14:44:51,028 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 19 treesize of output 11 [2018-10-10 14:44:51,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:51,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:51,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-10 14:44:51,043 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 20 treesize of output 11 [2018-10-10 14:44:51,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:51,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:51,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:51,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-10-10 14:44:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:51,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:44:51,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:44:51,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:44:51,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:44:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:44:51,284 INFO L87 Difference]: Start difference. First operand 780 states and 792 transitions. Second operand 16 states. [2018-10-10 14:44:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:53,577 INFO L93 Difference]: Finished difference Result 889 states and 902 transitions. [2018-10-10 14:44:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:44:53,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 260 [2018-10-10 14:44:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:53,581 INFO L225 Difference]: With dead ends: 889 [2018-10-10 14:44:53,582 INFO L226 Difference]: Without dead ends: 889 [2018-10-10 14:44:53,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:44:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-10-10 14:44:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 781. [2018-10-10 14:44:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-10-10 14:44:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 793 transitions. [2018-10-10 14:44:53,589 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 793 transitions. Word has length 260 [2018-10-10 14:44:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:53,589 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 793 transitions. [2018-10-10 14:44:53,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:44:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 793 transitions. [2018-10-10 14:44:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-10 14:44:53,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:53,591 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:53,591 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:53,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1868846434, now seen corresponding path program 1 times [2018-10-10 14:44:53,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:53,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:53,600 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:53,600 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:53,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:53,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:53,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:53,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:53,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:53,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:44:53,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:53,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:53,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-10 14:44:54,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-10 14:44:54,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:54,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:44:54,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-10-10 14:44:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:44:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 14:44:54,240 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-0219_true-valid-memsafety.i_25.bpl [2018-10-10 14:44:54,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:44:54,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:44:54,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:44:54,252 INFO L87 Difference]: Start difference. First operand 781 states and 793 transitions. Second operand 13 states. [2018-10-10 14:44:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:44:56,239 INFO L93 Difference]: Finished difference Result 1335 states and 1353 transitions. [2018-10-10 14:44:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 14:44:56,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 268 [2018-10-10 14:44:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:44:56,244 INFO L225 Difference]: With dead ends: 1335 [2018-10-10 14:44:56,244 INFO L226 Difference]: Without dead ends: 1335 [2018-10-10 14:44:56,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1191, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:44:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-10-10 14:44:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 780. [2018-10-10 14:44:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-10 14:44:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 791 transitions. [2018-10-10 14:44:56,253 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 791 transitions. Word has length 268 [2018-10-10 14:44:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:44:56,253 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 791 transitions. [2018-10-10 14:44:56,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:44:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 791 transitions. [2018-10-10 14:44:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-10 14:44:56,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:44:56,255 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:44:56,255 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:44:56,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:44:56,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2099664846, now seen corresponding path program 1 times [2018-10-10 14:44:56,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:44:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:44:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:56,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:44:56,263 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:44:56,263 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:44:56,263 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:44:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:44:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:44:56,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:44:56,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:56,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:56,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:44:56,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:56,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:56,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-10-10 14:44:56,730 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 12 treesize of output 15 [2018-10-10 14:44:56,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:56,739 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:44:56,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:23 [2018-10-10 14:44:56,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:56,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:56,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:44:56,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-10 14:44:56,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:56,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:56,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-10-10 14:44:57,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:44:57,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:44:57,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:44:57,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-10-10 14:44:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 3 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:44:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:44:57,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 14:44:57,332 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-0219_true-valid-memsafety.i_26.bpl [2018-10-10 14:44:57,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 14:44:57,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 14:44:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:44:57,335 INFO L87 Difference]: Start difference. First operand 780 states and 791 transitions. Second operand 30 states. [2018-10-10 14:44:59,926 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-10-10 14:45:00,107 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-10-10 14:45:00,295 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-10-10 14:45:00,464 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-10-10 14:45:00,633 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-10 14:45:00,761 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-10-10 14:45:01,722 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-10 14:45:02,214 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-10-10 14:45:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:05,532 INFO L93 Difference]: Finished difference Result 1272 states and 1287 transitions. [2018-10-10 14:45:05,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 14:45:05,533 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 269 [2018-10-10 14:45:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:05,538 INFO L225 Difference]: With dead ends: 1272 [2018-10-10 14:45:05,538 INFO L226 Difference]: Without dead ends: 1272 [2018-10-10 14:45:05,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1524, Invalid=7596, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 14:45:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2018-10-10 14:45:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 611. [2018-10-10 14:45:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-10-10 14:45:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 619 transitions. [2018-10-10 14:45:05,547 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 619 transitions. Word has length 269 [2018-10-10 14:45:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:05,547 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 619 transitions. [2018-10-10 14:45:05,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 14:45:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 619 transitions. [2018-10-10 14:45:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-10 14:45:05,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:05,549 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:05,550 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:05,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1917149854, now seen corresponding path program 1 times [2018-10-10 14:45:05,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:05,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:05,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:05,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:05,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:05,558 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:45:05,558 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:45:05,559 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:45:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:05,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:05,680 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:45:05,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:05,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:05,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:45:05,772 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:05,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:05,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:45:05,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:05,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:05,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-10 14:45:06,431 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-10 14:45:06,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 14:45:06,949 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 10 treesize of output 9 [2018-10-10 14:45:06,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:06,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:06,961 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:45:06,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-10-10 14:45:07,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-10 14:45:07,102 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:07,103 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 18 treesize of output 25 [2018-10-10 14:45:07,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,126 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:45:07,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:28 [2018-10-10 14:45:07,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-10 14:45:07,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:45:07,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:45:07,233 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:45:07,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-10-10 14:45:07,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:45:07,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:45:07,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:07,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-10-10 14:45:07,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-10 14:45:07,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-10 14:45:07,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,792 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 13 treesize of output 5 [2018-10-10 14:45:07,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:07,795 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:45:07,795 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-10-10 14:45:08,221 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:45:08,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:08,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2018-10-10 14:45:08,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 14:45:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 14:45:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:45:08,243 INFO L87 Difference]: Start difference. First operand 611 states and 619 transitions. Second operand 34 states. [2018-10-10 14:45:13,206 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-10 14:45:13,361 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-10 14:45:13,830 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-10-10 14:45:14,065 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-10-10 14:45:14,233 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-10 14:45:14,679 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-10 14:45:14,878 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-10 14:45:15,085 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-10-10 14:45:15,296 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-10-10 14:45:15,479 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-10-10 14:45:15,668 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-10-10 14:45:15,872 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-10-10 14:45:16,086 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-10-10 14:45:16,273 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-10-10 14:45:16,504 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-10 14:45:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:17,796 INFO L93 Difference]: Finished difference Result 687 states and 695 transitions. [2018-10-10 14:45:17,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 14:45:17,797 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 274 [2018-10-10 14:45:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:17,800 INFO L225 Difference]: With dead ends: 687 [2018-10-10 14:45:17,800 INFO L226 Difference]: Without dead ends: 687 [2018-10-10 14:45:17,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1918, Invalid=7588, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 14:45:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-10 14:45:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 614. [2018-10-10 14:45:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-10 14:45:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 623 transitions. [2018-10-10 14:45:17,809 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 623 transitions. Word has length 274 [2018-10-10 14:45:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:17,809 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 623 transitions. [2018-10-10 14:45:17,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 14:45:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 623 transitions. [2018-10-10 14:45:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 14:45:17,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:17,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,811 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:17,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash -697896266, now seen corresponding path program 1 times [2018-10-10 14:45:17,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:17,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:17,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:17,820 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:45:17,820 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:45:17,821 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:45:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:17,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:17,942 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:45:17,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:17,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:17,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:45:18,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:18,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:18,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:45:18,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-10 14:45:18,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 14:45:18,472 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 10 treesize of output 9 [2018-10-10 14:45:18,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 14:45:18,496 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 10 treesize of output 9 [2018-10-10 14:45:18,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2018-10-10 14:45:18,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-10 14:45:18,884 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:18,886 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 26 treesize of output 33 [2018-10-10 14:45:18,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-10-10 14:45:18,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:18,929 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 33 treesize of output 42 [2018-10-10 14:45:18,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:18,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:70, output treesize:45 [2018-10-10 14:45:19,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-10 14:45:19,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:45:19,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-10-10 14:45:19,089 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:45:19,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-10-10 14:45:19,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 62 [2018-10-10 14:45:19,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-10-10 14:45:19,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:19,556 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:19,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 21 [2018-10-10 14:45:19,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:19,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-10 14:45:19,582 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:19,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 18 [2018-10-10 14:45:19,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,591 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 5 treesize of output 1 [2018-10-10 14:45:19,592 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:19,601 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:84, output treesize:11 [2018-10-10 14:45:20,106 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:45:20,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:20,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2018-10-10 14:45:20,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 14:45:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 14:45:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:45:20,128 INFO L87 Difference]: Start difference. First operand 614 states and 623 transitions. Second operand 36 states. [2018-10-10 14:45:23,700 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-10 14:45:24,716 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-10-10 14:45:25,093 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-10-10 14:45:25,311 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-10 14:45:25,722 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-10 14:45:25,939 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-10-10 14:45:26,150 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-10-10 14:45:26,652 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-10-10 14:45:26,984 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-10-10 14:45:27,573 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-10-10 14:45:27,848 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-10-10 14:45:28,144 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-10-10 14:45:28,397 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-10-10 14:45:28,661 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-10-10 14:45:28,969 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2018-10-10 14:45:29,290 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2018-10-10 14:45:29,581 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-10-10 14:45:29,905 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-10-10 14:45:30,199 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-10-10 14:45:30,611 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-10-10 14:45:30,938 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-10-10 14:45:31,159 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-10-10 14:45:31,350 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-10-10 14:45:31,591 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-10-10 14:45:31,997 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-10-10 14:45:32,301 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-10-10 14:45:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:33,518 INFO L93 Difference]: Finished difference Result 907 states and 917 transitions. [2018-10-10 14:45:33,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 14:45:33,518 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 275 [2018-10-10 14:45:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:33,522 INFO L225 Difference]: With dead ends: 907 [2018-10-10 14:45:33,522 INFO L226 Difference]: Without dead ends: 907 [2018-10-10 14:45:33,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2166, Invalid=9390, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 14:45:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-10-10 14:45:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 614. [2018-10-10 14:45:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-10 14:45:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 622 transitions. [2018-10-10 14:45:33,530 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 622 transitions. Word has length 275 [2018-10-10 14:45:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:33,531 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 622 transitions. [2018-10-10 14:45:33,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 14:45:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 622 transitions. [2018-10-10 14:45:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 14:45:33,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:33,532 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:33,532 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:33,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1535616413, now seen corresponding path program 1 times [2018-10-10 14:45:33,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:33,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:33,541 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:45:33,541 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:45:33,541 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:45:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:33,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:33,645 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:45:33,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:33,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:33,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:45:33,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:33,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:33,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:45:33,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:33,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:33,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-10 14:45:34,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 14:45:34,231 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 10 treesize of output 9 [2018-10-10 14:45:34,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,248 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:45:34,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-10-10 14:45:34,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-10 14:45:34,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:34,413 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:45:34,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,450 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:45:34,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:26 [2018-10-10 14:45:34,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:45:34,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:45:34,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-10-10 14:45:34,586 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:45:34,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-10 14:45:34,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-10 14:45:34,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-10-10 14:45:34,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:34,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-10-10 14:45:34,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-10 14:45:34,903 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 5 [2018-10-10 14:45:34,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,909 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-10 14:45:34,909 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-10-10 14:45:35,429 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:45:35,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:35,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2018-10-10 14:45:35,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 14:45:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 14:45:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1383, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:45:35,450 INFO L87 Difference]: Start difference. First operand 614 states and 622 transitions. Second operand 39 states. [2018-10-10 14:45:39,403 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2018-10-10 14:45:39,833 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-10-10 14:45:41,504 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-10-10 14:45:41,795 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-10-10 14:45:42,167 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-10-10 14:45:44,356 WARN L178 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 111 [2018-10-10 14:45:44,859 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2018-10-10 14:45:45,361 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-10-10 14:45:45,629 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-10 14:45:45,977 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-10 14:45:46,492 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-10-10 14:45:46,995 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-10-10 14:45:47,463 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-10 14:45:47,915 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-10-10 14:45:48,323 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-10 14:45:49,118 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-10-10 14:45:50,114 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-10-10 14:45:50,466 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-10 14:45:50,663 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-10-10 14:45:50,836 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-10 14:45:51,262 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-10 14:45:52,100 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-10 14:45:52,839 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-10-10 14:45:53,590 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-10-10 14:45:53,832 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-10-10 14:45:54,190 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-10 14:45:54,603 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-10 14:45:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:55,499 INFO L93 Difference]: Finished difference Result 1142 states and 1157 transitions. [2018-10-10 14:45:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 14:45:55,500 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 287 [2018-10-10 14:45:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:55,505 INFO L225 Difference]: With dead ends: 1142 [2018-10-10 14:45:55,505 INFO L226 Difference]: Without dead ends: 1142 [2018-10-10 14:45:55,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10515 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=5056, Invalid=26806, Unknown=0, NotChecked=0, Total=31862 [2018-10-10 14:45:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-10-10 14:45:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 615. [2018-10-10 14:45:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-10-10 14:45:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 623 transitions. [2018-10-10 14:45:55,516 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 623 transitions. Word has length 287 [2018-10-10 14:45:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:55,516 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 623 transitions. [2018-10-10 14:45:55,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 14:45:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 623 transitions. [2018-10-10 14:45:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-10 14:45:55,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:55,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:55,518 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:55,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1058440362, now seen corresponding path program 1 times [2018-10-10 14:45:55,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:55,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:55,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:55,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:55,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:55,527 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:45:55,527 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:45:55,527 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:45:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:55,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:55,671 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:45:55,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:55,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:55,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:45:55,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:55,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:55,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:45:55,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:55,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:55,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-10 14:45:56,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-10 14:45:56,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2018-10-10 14:45:56,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:45:56,536 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:45:56,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-10-10 14:45:56,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:45:56,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,751 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:45:56,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,782 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:45:56,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:40 [2018-10-10 14:45:56,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 14:45:56,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-10 14:45:56,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-10-10 14:45:56,882 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 10 treesize of output 9 [2018-10-10 14:45:56,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-10-10 14:45:57,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-10 14:45:57,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-10-10 14:45:57,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-10-10 14:45:57,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,248 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:45:57,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:56 [2018-10-10 14:45:57,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-10-10 14:45:57,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:45:57,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 51 [2018-10-10 14:45:57,386 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:45:57,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:70 [2018-10-10 14:45:57,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2018-10-10 14:45:57,688 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-10 14:45:57,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-10 14:45:57,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:57,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:57,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:57,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:104, output treesize:47 [2018-10-10 14:45:58,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-10-10 14:45:58,053 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:58,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2018-10-10 14:45:58,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:58,065 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 7 treesize of output 1 [2018-10-10 14:45:58,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:58,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:45:58,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:58,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:58,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:58,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:3 [2018-10-10 14:45:58,748 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:45:58,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2018-10-10 14:45:58,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 14:45:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 14:45:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2125, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:45:58,769 INFO L87 Difference]: Start difference. First operand 615 states and 623 transitions. Second operand 48 states. [2018-10-10 14:46:00,539 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-10 14:46:00,879 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-10 14:46:01,085 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-10 14:46:02,229 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 14:46:02,562 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-10-10 14:46:02,812 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-10-10 14:46:03,100 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-10-10 14:46:03,348 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-10-10 14:46:03,629 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-10-10 14:46:03,821 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-10-10 14:46:04,144 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-10-10 14:46:04,367 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2018-10-10 14:46:04,567 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-10-10 14:46:04,952 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-10 14:46:05,228 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-10-10 14:46:05,622 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2018-10-10 14:46:06,135 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-10-10 14:46:06,406 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-10-10 14:46:06,755 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-10-10 14:46:07,124 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-10-10 14:46:07,513 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-10-10 14:46:07,872 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2018-10-10 14:46:08,305 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-10-10 14:46:08,488 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-10-10 14:46:08,720 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-10-10 14:46:09,121 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2018-10-10 14:46:09,329 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-10 14:46:09,715 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-10-10 14:46:09,995 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-10-10 14:46:10,666 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-10-10 14:46:10,878 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-10 14:46:11,095 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-10-10 14:46:11,445 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-10-10 14:46:11,884 WARN L178 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 123 [2018-10-10 14:46:12,185 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-10-10 14:46:12,749 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-10-10 14:46:13,352 WARN L178 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 142 [2018-10-10 14:46:13,626 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-10-10 14:46:14,291 WARN L178 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 163 [2018-10-10 14:46:14,880 WARN L178 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 146 [2018-10-10 14:46:15,270 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-10-10 14:46:15,983 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-10-10 14:46:16,289 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-10-10 14:46:16,754 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2018-10-10 14:46:17,065 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-10-10 14:46:17,443 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-10-10 14:46:18,141 WARN L178 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 169 [2018-10-10 14:46:18,522 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-10-10 14:46:18,876 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2018-10-10 14:46:19,187 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-10-10 14:46:19,952 WARN L178 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 169 [2018-10-10 14:46:20,292 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-10-10 14:46:20,614 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2018-10-10 14:46:20,885 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-10-10 14:46:21,652 WARN L178 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-10-10 14:46:22,018 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-10-10 14:46:22,362 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-10-10 14:46:22,687 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-10 14:46:23,015 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2018-10-10 14:46:23,225 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-10-10 14:46:23,445 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-10-10 14:46:23,673 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-10 14:46:23,941 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-10-10 14:46:24,277 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-10-10 14:46:24,625 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2018-10-10 14:46:24,885 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-10-10 14:46:25,256 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-10-10 14:46:25,539 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-10-10 14:46:25,792 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-10-10 14:46:26,161 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2018-10-10 14:46:26,812 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2018-10-10 14:46:27,226 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2018-10-10 14:46:28,099 WARN L178 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 175 [2018-10-10 14:46:28,357 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-10 14:46:29,124 WARN L178 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 201 [2018-10-10 14:46:29,497 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-10-10 14:46:29,920 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2018-10-10 14:46:30,663 WARN L178 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 195 [2018-10-10 14:46:30,840 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-10 14:46:31,648 WARN L178 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 214 [2018-10-10 14:46:32,003 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2018-10-10 14:46:32,843 WARN L178 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 226 [2018-10-10 14:46:33,053 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-10-10 14:46:33,346 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2018-10-10 14:46:33,636 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-10-10 14:46:34,700 WARN L178 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 238 [2018-10-10 14:46:34,908 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-10-10 14:46:35,296 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2018-10-10 14:46:38,616 WARN L178 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 260 DAG size of output: 250 [2018-10-10 14:46:39,043 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2018-10-10 14:46:39,290 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-10-10 14:46:40,369 WARN L178 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 230 [2018-10-10 14:46:40,756 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-10-10 14:46:41,082 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-10 14:46:41,352 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-10-10 14:46:41,810 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2018-10-10 14:46:42,054 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-10 14:46:42,942 WARN L178 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 218 [2018-10-10 14:46:43,122 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-10-10 14:46:43,703 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-10-10 14:46:44,502 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-10-10 14:46:44,816 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-10-10 14:46:45,203 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-10-10 14:46:46,261 WARN L178 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 227 [2018-10-10 14:46:46,604 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-10-10 14:46:47,040 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-10-10 14:46:47,340 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-10-10 14:46:47,689 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-10-10 14:46:48,184 WARN L178 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-10-10 14:46:48,606 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2018-10-10 14:46:49,649 WARN L178 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 229 [2018-10-10 14:46:49,879 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2018-10-10 14:46:53,479 WARN L178 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 241 DAG size of output: 231 [2018-10-10 14:46:53,825 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-10-10 14:46:54,288 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2018-10-10 14:46:55,396 WARN L178 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 224 [2018-10-10 14:46:56,396 WARN L178 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 222 [2018-10-10 14:46:56,985 WARN L178 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2018-10-10 14:46:57,541 WARN L178 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2018-10-10 14:46:57,783 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-10-10 14:46:58,115 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-10-10 14:46:58,605 WARN L178 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2018-10-10 14:46:58,980 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2018-10-10 14:46:59,543 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2018-10-10 14:46:59,958 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-10-10 14:47:00,426 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2018-10-10 14:47:01,324 WARN L178 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 210 [2018-10-10 14:47:01,736 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-10-10 14:47:02,192 WARN L178 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 118 [2018-10-10 14:47:02,629 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-10-10 14:47:02,920 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2018-10-10 14:47:03,636 WARN L178 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 198 [2018-10-10 14:47:03,973 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-10-10 14:47:04,356 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 109 [2018-10-10 14:47:04,993 WARN L178 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 174 [2018-10-10 14:47:05,717 WARN L178 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 201 [2018-10-10 14:47:06,077 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-10 14:47:06,345 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-10 14:47:06,773 WARN L178 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2018-10-10 14:47:06,969 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-10-10 14:47:07,653 WARN L178 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 183 [2018-10-10 14:47:07,978 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2018-10-10 14:47:08,411 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-10-10 14:47:08,639 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-10-10 14:47:08,973 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-10 14:47:09,391 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2018-10-10 14:47:09,677 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2018-10-10 14:47:09,996 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-10-10 14:47:10,291 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-10-10 14:47:11,063 WARN L178 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 199 [2018-10-10 14:47:11,429 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2018-10-10 14:47:11,890 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-10-10 14:47:12,349 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-10-10 14:47:13,046 WARN L178 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 181 [2018-10-10 14:47:13,406 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-10-10 14:47:14,180 WARN L178 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 187 [2018-10-10 14:47:14,518 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-10-10 14:47:14,880 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-10-10 14:47:15,268 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2018-10-10 14:47:15,614 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2018-10-10 14:47:16,657 WARN L178 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 165 [2018-10-10 14:47:16,975 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-10-10 14:47:17,677 WARN L178 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 201 [2018-10-10 14:47:18,224 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-10-10 14:47:18,786 WARN L178 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-10-10 14:47:19,140 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-10-10 14:47:19,445 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-10-10 14:47:19,983 WARN L178 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2018-10-10 14:47:20,404 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-10-10 14:47:20,886 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-10-10 14:47:21,349 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-10-10 14:47:21,863 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-10-10 14:47:22,289 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-10-10 14:47:22,681 WARN L178 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2018-10-10 14:47:23,059 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2018-10-10 14:47:23,384 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2018-10-10 14:47:23,765 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2018-10-10 14:47:24,050 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-10 14:47:24,373 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2018-10-10 14:47:24,807 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-10-10 14:47:25,089 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2018-10-10 14:47:25,511 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2018-10-10 14:47:25,793 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-10-10 14:47:26,155 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-10-10 14:47:26,534 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-10-10 14:47:27,027 WARN L178 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2018-10-10 14:47:27,659 WARN L178 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 187 [2018-10-10 14:47:28,261 WARN L178 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 160 [2018-10-10 14:47:28,670 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-10-10 14:47:29,157 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-10-10 14:47:29,421 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-10-10 14:47:29,646 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-10-10 14:47:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:29,656 INFO L93 Difference]: Finished difference Result 1437 states and 1460 transitions. [2018-10-10 14:47:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-10 14:47:29,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 294 [2018-10-10 14:47:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:29,663 INFO L225 Difference]: With dead ends: 1437 [2018-10-10 14:47:29,663 INFO L226 Difference]: Without dead ends: 1437 [2018-10-10 14:47:29,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26144 ImplicationChecksByTransitivity, 81.8s TimeCoverageRelationStatistics Valid=8027, Invalid=67873, Unknown=0, NotChecked=0, Total=75900 [2018-10-10 14:47:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2018-10-10 14:47:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 631. [2018-10-10 14:47:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-10 14:47:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 640 transitions. [2018-10-10 14:47:29,676 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 640 transitions. Word has length 294 [2018-10-10 14:47:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:29,677 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 640 transitions. [2018-10-10 14:47:29,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 14:47:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 640 transitions. [2018-10-10 14:47:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-10 14:47:29,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:29,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:29,679 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:29,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:29,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1548086718, now seen corresponding path program 1 times [2018-10-10 14:47:29,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:29,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:29,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:29,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:29,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:29,687 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:47:29,688 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:47:29,688 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:47:29,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:29,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:47:29,810 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:47:29,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:29,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:29,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:47:29,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:29,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:29,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:47:29,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:29,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:29,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-10 14:47:30,173 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:30,174 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:30,176 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:30,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-10 14:47:30,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2018-10-10 14:47:30,453 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:47:30,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2018-10-10 14:47:30,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:47:30,660 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:47:30,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,687 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:47:30,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-10 14:47:30,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-10 14:47:30,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:30,874 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 18 treesize of output 25 [2018-10-10 14:47:30,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,907 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:47:30,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:42 [2018-10-10 14:47:30,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-10-10 14:47:30,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-10 14:47:30,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:30,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 14:47:31,012 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 10 treesize of output 9 [2018-10-10 14:47:31,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:58 [2018-10-10 14:47:31,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-10-10 14:47:31,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:31,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-10-10 14:47:31,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-10 14:47:31,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:31,311 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:47:31,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:58 [2018-10-10 14:47:31,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-10-10 14:47:31,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:47:31,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-10-10 14:47:31,458 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:47:31,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:72 [2018-10-10 14:47:31,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-10-10 14:47:31,925 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 30 treesize of output 17 [2018-10-10 14:47:31,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:47:31,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:31,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:47:31,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:68 [2018-10-10 14:47:32,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2018-10-10 14:47:32,326 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 13 treesize of output 5 [2018-10-10 14:47:32,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:32,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:47:32,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:32,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-10 14:47:32,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:32,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:32,343 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:47:32,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:5 [2018-10-10 14:47:33,034 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:47:33,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:47:33,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2018-10-10 14:47:33,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 14:47:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 14:47:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2126, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:47:33,056 INFO L87 Difference]: Start difference. First operand 631 states and 640 transitions. Second operand 48 states. [2018-10-10 14:47:34,786 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-10 14:47:35,127 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-10 14:47:35,330 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-10 14:47:35,471 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-10-10 14:47:36,537 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 14:47:36,907 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-10-10 14:47:37,198 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-10-10 14:47:37,496 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-10-10 14:47:37,738 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-10-10 14:47:38,026 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-10-10 14:47:38,217 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-10-10 14:47:38,563 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-10-10 14:47:38,790 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2018-10-10 14:47:38,990 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-10-10 14:47:39,290 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-10-10 14:47:39,572 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2018-10-10 14:47:39,986 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-10-10 14:47:40,548 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-10-10 14:47:40,854 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2018-10-10 14:47:41,232 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-10-10 14:47:41,628 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-10-10 14:47:42,081 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-10-10 14:47:42,484 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2018-10-10 14:47:42,955 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2018-10-10 14:47:43,143 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-10-10 14:47:43,405 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-10 14:47:43,848 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-10-10 14:47:44,078 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-10-10 14:47:44,471 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2018-10-10 14:47:44,702 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-10 14:47:45,112 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-10-10 14:47:45,707 WARN L178 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 129 [2018-10-10 14:47:46,220 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2018-10-10 14:47:46,799 WARN L178 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 149 [2018-10-10 14:47:47,547 WARN L178 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 171 [2018-10-10 14:47:48,157 WARN L178 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 153 [2018-10-10 14:47:49,373 WARN L178 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 177 [2018-10-10 14:47:50,219 WARN L178 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 177 [2018-10-10 14:47:51,608 WARN L178 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 183 [2018-10-10 14:47:52,446 WARN L178 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 210 [2018-10-10 14:47:53,267 WARN L178 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 204 [2018-10-10 14:47:54,124 WARN L178 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 210 [2018-10-10 14:47:54,980 WARN L178 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 216 [2018-10-10 14:47:55,961 WARN L178 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 222 [2018-10-10 14:47:57,017 WARN L178 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 228 [2018-10-10 14:47:58,069 WARN L178 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 217 [2018-10-10 14:47:58,994 WARN L178 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 211 [2018-10-10 14:47:59,957 WARN L178 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 215 [2018-10-10 14:48:01,033 WARN L178 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 218 [2018-10-10 14:48:01,974 WARN L178 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 221 [2018-10-10 14:48:02,298 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-10 14:48:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:48:03,662 INFO L93 Difference]: Finished difference Result 663 states and 671 transitions. [2018-10-10 14:48:03,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 14:48:03,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 295 [2018-10-10 14:48:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:48:03,665 INFO L225 Difference]: With dead ends: 663 [2018-10-10 14:48:03,665 INFO L226 Difference]: Without dead ends: 663 [2018-10-10 14:48:03,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=2227, Invalid=12779, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 14:48:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-10 14:48:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 631. [2018-10-10 14:48:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-10 14:48:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 639 transitions. [2018-10-10 14:48:03,671 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 639 transitions. Word has length 295 [2018-10-10 14:48:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:48:03,672 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 639 transitions. [2018-10-10 14:48:03,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 14:48:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 639 transitions. [2018-10-10 14:48:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-10 14:48:03,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:48:03,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,673 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:48:03,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:48:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 247311312, now seen corresponding path program 1 times [2018-10-10 14:48:03,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:48:03,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:48:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:48:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:48:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:48:03,681 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:48:03,681 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:48:03,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:48:03,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:48:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:48:03,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:48:03,797 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:48:03,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:03,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:03,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:48:03,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:03,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:03,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:48:03,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:03,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:03,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-10 14:48:04,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,212 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:48:04,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:04,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:04,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:48 [2018-10-10 14:48:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,721 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,723 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:04,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-10 14:48:04,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:04,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:04,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2018-10-10 14:48:04,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:48:04,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:48:04,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:04,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:04,991 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:48:04,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:60 [2018-10-10 14:48:05,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-10-10 14:48:05,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-10-10 14:48:05,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,234 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:48:05,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:57 [2018-10-10 14:48:05,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-10-10 14:48:05,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-10 14:48:05,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,470 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:48:05,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:85 [2018-10-10 14:48:05,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2018-10-10 14:48:05,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:05,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 82 [2018-10-10 14:48:05,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,794 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:48:05,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:85 [2018-10-10 14:48:05,877 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:05,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 73 [2018-10-10 14:48:05,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-10 14:48:05,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:48:05,919 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:48:05,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:05,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:95 [2018-10-10 14:48:06,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:48:06,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:48:06,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:48:06,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:95 [2018-10-10 14:48:06,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,789 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 62 [2018-10-10 14:48:06,814 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 47 [2018-10-10 14:48:06,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-10-10 14:48:06,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-10-10 14:48:06,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-10 14:48:06,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-10-10 14:48:06,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-10 14:48:06,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:48:06,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:48:06,924 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:108, output treesize:21 [2018-10-10 14:48:07,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:07,224 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 2 case distinctions, treesize of input 16 treesize of output 19 [2018-10-10 14:48:07,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-10 14:48:07,251 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:07,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-10-10 14:48:07,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:07,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-10 14:48:07,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2018-10-10 14:48:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:48:08,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:48:08,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2018-10-10 14:48:08,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 14:48:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 14:48:08,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3225, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 14:48:08,489 INFO L87 Difference]: Start difference. First operand 631 states and 639 transitions. Second operand 59 states. [2018-10-10 14:48:10,271 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-10-10 14:48:10,645 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-10 14:48:10,874 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-10 14:48:11,029 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-10 14:48:12,057 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-10 14:48:12,419 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-10-10 14:48:12,716 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-10-10 14:48:13,097 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-10 14:48:13,349 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-10-10 14:48:14,151 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-10 14:48:14,421 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-10 14:48:14,687 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-10-10 14:48:15,111 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-10-10 14:48:15,710 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-10-10 14:48:16,026 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2018-10-10 14:48:16,399 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2018-10-10 14:48:16,831 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-10-10 14:48:17,252 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-10-10 14:48:17,671 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2018-10-10 14:48:18,249 WARN L178 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2018-10-10 14:48:18,476 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2018-10-10 14:48:18,777 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-10-10 14:48:19,265 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-10-10 14:48:19,527 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-10-10 14:48:19,935 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-10-10 14:48:20,207 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-10 14:48:20,405 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-10-10 14:48:20,631 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-10 14:48:20,942 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-10-10 14:48:21,198 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-10 14:48:21,546 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-10-10 14:48:21,963 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-10-10 14:48:22,484 WARN L178 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2018-10-10 14:48:22,831 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-10-10 14:48:23,512 WARN L178 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2018-10-10 14:48:24,186 WARN L178 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 146 [2018-10-10 14:48:24,495 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-10-10 14:48:25,243 WARN L178 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 168 [2018-10-10 14:48:25,906 WARN L178 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 150 [2018-10-10 14:48:26,295 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-10-10 14:48:27,135 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2018-10-10 14:48:27,465 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-10 14:48:28,011 WARN L178 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2018-10-10 14:48:28,405 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-10-10 14:48:28,803 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2018-10-10 14:48:29,707 WARN L178 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 189 [2018-10-10 14:48:30,172 WARN L178 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2018-10-10 14:48:30,422 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-10-10 14:48:30,758 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-10-10 14:48:31,627 WARN L178 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 169 [2018-10-10 14:48:31,821 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-10 14:48:32,030 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-10 14:48:32,589 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-10-10 14:48:32,889 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-10-10 14:48:33,242 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-10-10 14:48:33,858 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-10-10 14:48:34,096 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-10 14:48:34,269 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-10 14:48:34,528 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-10 14:48:34,745 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2018-10-10 14:48:35,104 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-10-10 14:48:35,471 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2018-10-10 14:48:35,767 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-10 14:48:36,111 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-10-10 14:48:36,382 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-10-10 14:48:36,671 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-10-10 14:48:37,057 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2018-10-10 14:48:37,747 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-10-10 14:48:38,222 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2018-10-10 14:48:39,244 WARN L178 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 195 [2018-10-10 14:48:39,535 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-10-10 14:48:40,402 WARN L178 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 197 [2018-10-10 14:48:40,855 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-10-10 14:48:41,329 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-10 14:48:42,064 WARN L178 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 191 [2018-10-10 14:48:42,265 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-10 14:48:43,056 WARN L178 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 195 [2018-10-10 14:48:43,488 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2018-10-10 14:48:44,350 WARN L178 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 199 [2018-10-10 14:48:44,589 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-10 14:48:44,917 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-10 14:48:45,223 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-10-10 14:48:46,180 WARN L178 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 203 [2018-10-10 14:48:46,419 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-10 14:48:46,857 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2018-10-10 14:48:47,848 WARN L178 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 207 [2018-10-10 14:48:48,308 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-10-10 14:48:48,608 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-10-10 14:48:49,553 WARN L178 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 203 [2018-10-10 14:48:50,505 WARN L178 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 205 [2018-10-10 14:48:50,803 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2018-10-10 14:48:51,148 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2018-10-10 14:48:51,459 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2018-10-10 14:48:51,954 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2018-10-10 14:48:52,250 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-10-10 14:48:53,099 WARN L178 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 201 [2018-10-10 14:48:53,309 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-10 14:48:53,969 WARN L178 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2018-10-10 14:48:55,105 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2018-10-10 14:48:55,528 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-10 14:48:56,464 WARN L178 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 204 [2018-10-10 14:48:56,847 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-10-10 14:48:57,238 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-10-10 14:48:57,547 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-10-10 14:48:57,899 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-10-10 14:48:58,410 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2018-10-10 14:48:58,862 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2018-10-10 14:48:59,872 WARN L178 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 212 [2018-10-10 14:49:00,119 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-10-10 14:49:01,232 WARN L178 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 216 [2018-10-10 14:49:01,588 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-10-10 14:49:02,032 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-10-10 14:49:03,198 WARN L178 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 219 [2018-10-10 14:49:05,468 WARN L178 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 240 DAG size of output: 223 [2018-10-10 14:49:06,298 WARN L178 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 204 [2018-10-10 14:49:07,243 WARN L178 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 214 [2018-10-10 14:49:08,157 WARN L178 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 210 [2018-10-10 14:49:09,015 WARN L178 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 206 [2018-10-10 14:49:09,593 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2018-10-10 14:49:10,096 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 111 [2018-10-10 14:49:10,376 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-10-10 14:49:10,783 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-10-10 14:49:11,312 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2018-10-10 14:49:12,076 WARN L178 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 195 [2018-10-10 14:49:12,421 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2018-10-10 14:49:13,154 WARN L178 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 188 [2018-10-10 14:49:13,729 WARN L178 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 129 [2018-10-10 14:49:14,199 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2018-10-10 14:49:14,715 WARN L178 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2018-10-10 14:49:15,426 WARN L178 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 183 [2018-10-10 14:49:15,852 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2018-10-10 14:49:16,135 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-10-10 14:49:16,566 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2018-10-10 14:49:16,888 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-10-10 14:49:17,540 WARN L178 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 179 [2018-10-10 14:49:17,738 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-10 14:49:17,974 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-10 14:49:18,540 WARN L178 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2018-10-10 14:49:18,999 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-10-10 14:49:19,394 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-10-10 14:49:19,655 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-10-10 14:49:20,344 WARN L178 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 178 [2018-10-10 14:49:20,542 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-10 14:49:20,913 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2018-10-10 14:49:21,173 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-10 14:49:21,732 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-10-10 14:49:22,048 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-10 14:49:22,311 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2018-10-10 14:49:22,636 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-10-10 14:49:22,930 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-10-10 14:49:23,320 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-10-10 14:49:23,747 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-10-10 14:49:24,175 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-10-10 14:49:25,024 WARN L178 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 199 [2018-10-10 14:49:25,340 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-10-10 14:49:25,728 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-10-10 14:49:26,211 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2018-10-10 14:49:26,582 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-10-10 14:49:27,755 WARN L178 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 175 [2018-10-10 14:49:28,137 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-10-10 14:49:28,835 WARN L178 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2018-10-10 14:49:29,506 WARN L178 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2018-10-10 14:49:29,945 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2018-10-10 14:49:30,246 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-10-10 14:49:30,888 WARN L178 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2018-10-10 14:49:31,342 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2018-10-10 14:49:31,856 WARN L178 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2018-10-10 14:49:32,370 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 115 [2018-10-10 14:49:32,666 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-10-10 14:49:33,145 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2018-10-10 14:49:33,430 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-10-10 14:49:33,674 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-10 14:49:34,193 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-10-10 14:49:34,410 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-10 14:49:34,875 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2018-10-10 14:49:35,417 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-10-10 14:49:35,675 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-10 14:49:36,006 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-10-10 14:49:36,375 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-10-10 14:49:36,841 WARN L178 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2018-10-10 14:49:37,253 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-10-10 14:49:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:49:37,700 INFO L93 Difference]: Finished difference Result 1413 states and 1435 transitions. [2018-10-10 14:49:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-10-10 14:49:37,700 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 304 [2018-10-10 14:49:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:49:37,705 INFO L225 Difference]: With dead ends: 1413 [2018-10-10 14:49:37,705 INFO L226 Difference]: Without dead ends: 1413 [2018-10-10 14:49:37,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26972 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=7821, Invalid=71985, Unknown=0, NotChecked=0, Total=79806 [2018-10-10 14:49:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2018-10-10 14:49:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 632. [2018-10-10 14:49:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-10 14:49:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 640 transitions. [2018-10-10 14:49:37,716 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 640 transitions. Word has length 304 [2018-10-10 14:49:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:49:37,716 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 640 transitions. [2018-10-10 14:49:37,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 14:49:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 640 transitions. [2018-10-10 14:49:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-10 14:49:37,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:49:37,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:37,719 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:49:37,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:49:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1828500188, now seen corresponding path program 1 times [2018-10-10 14:49:37,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:49:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:49:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:37,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:49:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:37,728 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:49:37,728 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:49:37,728 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:49:37,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:49:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:49:37,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:49:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:49:37,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:49:37,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:49:37,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:49:37,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:49:37,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:49:37,997 INFO L87 Difference]: Start difference. First operand 632 states and 640 transitions. Second operand 7 states. [2018-10-10 14:49:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:49:38,173 INFO L93 Difference]: Finished difference Result 644 states and 652 transitions. [2018-10-10 14:49:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:49:38,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 316 [2018-10-10 14:49:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:49:38,176 INFO L225 Difference]: With dead ends: 644 [2018-10-10 14:49:38,176 INFO L226 Difference]: Without dead ends: 644 [2018-10-10 14:49:38,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:49:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-10-10 14:49:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 636. [2018-10-10 14:49:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-10-10 14:49:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 644 transitions. [2018-10-10 14:49:38,182 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 644 transitions. Word has length 316 [2018-10-10 14:49:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:49:38,182 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 644 transitions. [2018-10-10 14:49:38,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:49:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 644 transitions. [2018-10-10 14:49:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-10 14:49:38,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:49:38,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,185 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:49:38,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:49:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash -358213869, now seen corresponding path program 1 times [2018-10-10 14:49:38,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:49:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:49:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:38,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:49:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:38,193 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:49:38,193 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:49:38,194 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:49:38,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:49:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:49:38,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:49:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 14:49:38,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:49:38,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 14:49:38,579 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-0219_true-valid-memsafety.i_34.bpl [2018-10-10 14:49:38,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:49:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:49:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:49:38,582 INFO L87 Difference]: Start difference. First operand 636 states and 644 transitions. Second operand 8 states. [2018-10-10 14:49:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:49:38,789 INFO L93 Difference]: Finished difference Result 656 states and 664 transitions. [2018-10-10 14:49:38,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:49:38,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 322 [2018-10-10 14:49:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:49:38,791 INFO L225 Difference]: With dead ends: 656 [2018-10-10 14:49:38,791 INFO L226 Difference]: Without dead ends: 656 [2018-10-10 14:49:38,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:49:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-10-10 14:49:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 648. [2018-10-10 14:49:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-10-10 14:49:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 656 transitions. [2018-10-10 14:49:38,797 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 656 transitions. Word has length 322 [2018-10-10 14:49:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:49:38,797 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 656 transitions. [2018-10-10 14:49:38,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:49:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 656 transitions. [2018-10-10 14:49:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-10 14:49:38,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:49:38,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,800 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:49:38,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:49:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1476823996, now seen corresponding path program 2 times [2018-10-10 14:49:38,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:49:38,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:49:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:38,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:49:38,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:38,809 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 14:49:38,809 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-10 14:49:38,810 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-10 14:49:38,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:49:39,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:49:39,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:49:39,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:49:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-10 14:49:39,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:49:39,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 14:49:39,351 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:49:39,355 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:49:39,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:49:39 BoogieIcfgContainer [2018-10-10 14:49:39,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:49:39,356 INFO L168 Benchmark]: Toolchain (without parser) took 358211.93 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 563.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -255.1 MB). Peak memory consumption was 308.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:39,356 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:49:39,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:39,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:49:39,357 INFO L168 Benchmark]: Boogie Preprocessor took 133.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.7 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:39,357 INFO L168 Benchmark]: RCFGBuilder took 1840.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:39,357 INFO L168 Benchmark]: TraceAbstraction took 355643.30 ms. Allocated memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: -177.2 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 449.9 MB). Peak memory consumption was 272.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:39,358 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 522.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.7 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1840.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 355643.30 ms. Allocated memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: -177.2 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 449.9 MB). Peak memory consumption was 272.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 768). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 785]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 785). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 769]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 769). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 769]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 769). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 794). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 768). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 794). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 35). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 420 locations, 47 error locations. TIMEOUT Result, 355.5s OverallTime, 35 OverallIterations, 2 TraceHistogramMax, 317.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12706 SDtfs, 112257 SDslu, 102903 SDs, 0 SdLazy, 63362 SolverSat, 2405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8257 GetRequests, 6315 SyntacticMatches, 15 SemanticMatches, 1927 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79778 ImplicationChecksByTransitivity, 260.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=781occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 7219 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 6889 NumberOfCodeBlocks, 6889 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 6855 ConstructedInterpolants, 796 QuantifiedInterpolants, 25482643 SizeOfPredicates, 901 NumberOfNonLiveVariables, 14703 ConjunctsInSsa, 1575 ConjunctsInUnsatCore, 34 InterpolantComputations, 31 PerfectInterpolantSequences, 15/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...