java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 11:31:42,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 11:31:42,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 11:31:42,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 11:31:42,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 11:31:42,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 11:31:42,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 11:31:42,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 11:31:42,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 11:31:42,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 11:31:42,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 11:31:42,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 11:31:42,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 11:31:42,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 11:31:42,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 11:31:42,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 11:31:42,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 11:31:42,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 11:31:42,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 11:31:42,328 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 11:31:42,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 11:31:42,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 11:31:42,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 11:31:42,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 11:31:42,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 11:31:42,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 11:31:42,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 11:31:42,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 11:31:42,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 11:31:42,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 11:31:42,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 11:31:42,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 11:31:42,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 11:31:42,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 11:31:42,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 11:31:42,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 11:31:42,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-10-10 11:31:42,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 11:31:42,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 11:31:42,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 11:31:42,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 11:31:42,367 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 11:31:42,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 11:31:42,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 11:31:42,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 11:31:42,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 11:31:42,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 11:31:42,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 11:31:42,370 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 11:31:42,370 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 11:31:42,370 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 11:31:42,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 11:31:42,371 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-10 11:31:42,371 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-10 11:31:42,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 11:31:42,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 11:31:42,372 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 11:31:42,372 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 11:31:42,372 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 11:31:42,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:31:42,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 11:31:42,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 11:31:42,373 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-10 11:31:42,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 11:31:42,373 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-10 11:31:42,374 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump [2018-10-10 11:31:42,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 11:31:42,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 11:31:42,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 11:31:42,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 11:31:42,455 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 11:31:42,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-10-10 11:31:42,775 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff86af95/d14353fd68c94095b55103409c129d53/FLAG58a0924c0 [2018-10-10 11:31:43,076 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 11:31:43,076 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-10-10 11:31:43,089 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff86af95/d14353fd68c94095b55103409c129d53/FLAG58a0924c0 [2018-10-10 11:31:43,105 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff86af95/d14353fd68c94095b55103409c129d53 [2018-10-10 11:31:43,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 11:31:43,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 11:31:43,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 11:31:43,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 11:31:43,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 11:31:43,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6eb051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43, skipping insertion in model container [2018-10-10 11:31:43,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 11:31:43,203 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 11:31:43,517 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:31:43,542 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 11:31:43,646 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:31:43,723 INFO L193 MainTranslator]: Completed translation [2018-10-10 11:31:43,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43 WrapperNode [2018-10-10 11:31:43,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 11:31:43,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 11:31:43,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 11:31:43,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 11:31:43,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 11:31:43,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 11:31:43,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 11:31:43,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 11:31:43,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:43,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... [2018-10-10 11:31:44,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 11:31:44,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 11:31:44,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 11:31:44,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 11:31:44,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:31:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 11:31:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 11:31:45,810 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 11:31:45,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:45 BoogieIcfgContainer [2018-10-10 11:31:45,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 11:31:45,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 11:31:45,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 11:31:45,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 11:31:45,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:31:43" (1/3) ... [2018-10-10 11:31:45,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ec7b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:45, skipping insertion in model container [2018-10-10 11:31:45,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:43" (2/3) ... [2018-10-10 11:31:45,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ec7b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:45, skipping insertion in model container [2018-10-10 11:31:45,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:45" (3/3) ... [2018-10-10 11:31:45,820 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-10-10 11:31:45,830 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 11:31:45,841 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-10-10 11:31:45,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-10-10 11:31:45,880 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 11:31:45,881 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 11:31:45,881 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 11:31:45,881 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 11:31:45,881 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 11:31:45,882 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 11:31:45,882 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 11:31:45,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 11:31:45,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 11:31:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2018-10-10 11:31:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-10 11:31:45,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:45,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-10 11:31:45,917 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:45,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2018-10-10 11:31:45,929 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:45,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:46,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:46,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:46,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:46,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:46,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 11:31:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:46,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:46,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:46,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:31:46,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:31:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:31:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:31:46,202 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2018-10-10 11:31:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:47,613 INFO L93 Difference]: Finished difference Result 217 states and 225 transitions. [2018-10-10 11:31:47,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:31:47,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-10 11:31:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:47,635 INFO L225 Difference]: With dead ends: 217 [2018-10-10 11:31:47,635 INFO L226 Difference]: Without dead ends: 213 [2018-10-10 11:31:47,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:31:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-10 11:31:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 167. [2018-10-10 11:31:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-10 11:31:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2018-10-10 11:31:47,698 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 3 [2018-10-10 11:31:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:47,698 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2018-10-10 11:31:47,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:31:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2018-10-10 11:31:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-10 11:31:47,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:47,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-10 11:31:47,703 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:47,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2018-10-10 11:31:47,704 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:47,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:47,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:47,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:47,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:47,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:47,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:47,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-10 11:31:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:47,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:47,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:31:47,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:31:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:31:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:31:47,948 INFO L87 Difference]: Start difference. First operand 167 states and 174 transitions. Second operand 3 states. [2018-10-10 11:31:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:48,535 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2018-10-10 11:31:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:31:48,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-10 11:31:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:48,538 INFO L225 Difference]: With dead ends: 166 [2018-10-10 11:31:48,538 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 11:31:48,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:31:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 11:31:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-10 11:31:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-10 11:31:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-10-10 11:31:48,551 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 4 [2018-10-10 11:31:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:48,552 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-10-10 11:31:48,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:31:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-10-10 11:31:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-10 11:31:48,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:48,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-10 11:31:48,555 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:48,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2018-10-10 11:31:48,556 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:48,557 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:48,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:48,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:48,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:48,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:48,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 11:31:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:48,690 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:31:48,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:31:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:31:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:31:48,694 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 5 states. [2018-10-10 11:31:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:49,826 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2018-10-10 11:31:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:31:49,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-10 11:31:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:49,831 INFO L225 Difference]: With dead ends: 234 [2018-10-10 11:31:49,832 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 11:31:49,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:31:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 11:31:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 163. [2018-10-10 11:31:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 11:31:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 170 transitions. [2018-10-10 11:31:49,845 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 170 transitions. Word has length 5 [2018-10-10 11:31:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:49,845 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 170 transitions. [2018-10-10 11:31:49,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:31:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 170 transitions. [2018-10-10 11:31:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-10 11:31:49,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:49,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-10 11:31:49,848 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash 889475910, now seen corresponding path program 1 times [2018-10-10 11:31:49,849 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:49,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:49,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:49,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:49,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:49,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:49,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 11:31:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:49,981 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:49,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:49,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:31:49,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:31:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:31:49,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:31:49,985 INFO L87 Difference]: Start difference. First operand 163 states and 170 transitions. Second operand 4 states. [2018-10-10 11:31:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:50,865 INFO L93 Difference]: Finished difference Result 203 states and 212 transitions. [2018-10-10 11:31:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:31:50,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-10 11:31:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:50,870 INFO L225 Difference]: With dead ends: 203 [2018-10-10 11:31:50,870 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 11:31:50,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:31:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 11:31:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 162. [2018-10-10 11:31:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 11:31:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2018-10-10 11:31:50,892 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 6 [2018-10-10 11:31:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:50,893 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2018-10-10 11:31:50,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:31:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2018-10-10 11:31:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-10 11:31:50,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:50,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:50,898 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:50,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:50,898 INFO L82 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2018-10-10 11:31:50,899 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:50,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:50,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:51,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:51,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:51,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:51,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:51,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:51,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:51,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-10 11:31:51,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:31:51,151 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 11:31:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:51,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:31:51,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:31:51,197 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 13 treesize of output 4 [2018-10-10 11:31:51,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:51,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:51,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-10-10 11:31:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:51,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:31:51,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:31:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:31:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:31:51,251 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 4 states. [2018-10-10 11:31:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:52,198 INFO L93 Difference]: Finished difference Result 199 states and 207 transitions. [2018-10-10 11:31:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:31:52,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-10 11:31:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:52,201 INFO L225 Difference]: With dead ends: 199 [2018-10-10 11:31:52,201 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 11:31:52,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:31:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 11:31:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2018-10-10 11:31:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 11:31:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-10-10 11:31:52,208 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 8 [2018-10-10 11:31:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:52,208 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-10-10 11:31:52,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:31:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-10-10 11:31:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-10 11:31:52,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:52,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:52,211 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:52,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1571339738, now seen corresponding path program 1 times [2018-10-10 11:31:52,212 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:52,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:52,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:52,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:52,319 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:52,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:52,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:31:52,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:31:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:31:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:31:52,322 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 4 states. [2018-10-10 11:31:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:53,007 INFO L93 Difference]: Finished difference Result 171 states and 179 transitions. [2018-10-10 11:31:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:31:53,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-10-10 11:31:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:53,012 INFO L225 Difference]: With dead ends: 171 [2018-10-10 11:31:53,012 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 11:31:53,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:31:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 11:31:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-10-10 11:31:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 11:31:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-10-10 11:31:53,021 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 9 [2018-10-10 11:31:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:53,022 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-10-10 11:31:53,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:31:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-10-10 11:31:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-10 11:31:53,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:53,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:53,026 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:53,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1466891574, now seen corresponding path program 1 times [2018-10-10 11:31:53,027 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:53,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:53,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:53,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:53,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:53,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:31:53,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:31:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:31:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:31:53,248 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 5 states. [2018-10-10 11:31:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:54,017 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-10-10 11:31:54,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:31:54,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-10-10 11:31:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:54,021 INFO L225 Difference]: With dead ends: 159 [2018-10-10 11:31:54,021 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 11:31:54,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:31:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 11:31:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-10 11:31:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 11:31:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-10-10 11:31:54,027 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 10 [2018-10-10 11:31:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:54,027 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-10-10 11:31:54,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:31:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-10-10 11:31:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-10 11:31:54,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:54,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:54,030 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:54,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1771001512, now seen corresponding path program 1 times [2018-10-10 11:31:54,033 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:54,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:54,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:54,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:54,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-10 11:31:54,200 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 11:31:54,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:31:54,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-10 11:31:54,286 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 11:31:54,291 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 11:31:54,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:54,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-10 11:31:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:54,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:54,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:31:54,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:31:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:31:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:31:54,329 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 6 states. [2018-10-10 11:31:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:55,601 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-10-10 11:31:55,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:31:55,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-10 11:31:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:55,603 INFO L225 Difference]: With dead ends: 204 [2018-10-10 11:31:55,603 INFO L226 Difference]: Without dead ends: 204 [2018-10-10 11:31:55,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:31:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-10 11:31:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 158. [2018-10-10 11:31:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 11:31:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-10-10 11:31:55,610 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 11 [2018-10-10 11:31:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:55,610 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-10-10 11:31:55,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:31:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-10-10 11:31:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-10 11:31:55,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:55,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:55,613 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:55,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash -933527924, now seen corresponding path program 1 times [2018-10-10 11:31:55,613 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:55,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:55,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:55,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-10-10 11:31:55,799 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 11:31:55,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:31:55,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,827 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 11:31:55,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:31:55,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,949 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 11:31:55,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-10-10 11:31:55,973 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 11:31:55,977 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 11:31:55,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:55,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:56,073 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 11:31:56,078 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 11:31:56,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:56,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:56,092 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 11:31:56,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-10-10 11:31:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:56,113 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:56,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:56,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:31:56,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:31:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:31:56,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:31:56,117 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 6 states. [2018-10-10 11:31:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:57,718 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-10-10 11:31:57,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:31:57,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-10 11:31:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:57,720 INFO L225 Difference]: With dead ends: 157 [2018-10-10 11:31:57,720 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 11:31:57,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:31:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 11:31:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-10-10 11:31:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 11:31:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2018-10-10 11:31:57,724 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 12 [2018-10-10 11:31:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:57,724 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2018-10-10 11:31:57,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:31:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2018-10-10 11:31:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-10 11:31:57,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:57,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:57,727 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:57,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1125405482, now seen corresponding path program 1 times [2018-10-10 11:31:57,727 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:57,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:57,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:57,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:57,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:57,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-10 11:31:57,888 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 11:31:57,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:31:57,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:57,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:57,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:57,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-10 11:31:58,007 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 11:31:58,021 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 11:31:58,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:31:58,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:58,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:31:58,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-10 11:31:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:31:58,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:31:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:31:58,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:31:58,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:31:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:31:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:31:58,145 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 7 states. [2018-10-10 11:31:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:31:59,857 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-10-10 11:31:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 11:31:59,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-10-10 11:31:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:31:59,859 INFO L225 Difference]: With dead ends: 197 [2018-10-10 11:31:59,859 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 11:31:59,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:31:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 11:31:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 155. [2018-10-10 11:31:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 11:31:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2018-10-10 11:31:59,864 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 13 [2018-10-10 11:31:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:31:59,865 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2018-10-10 11:31:59,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:31:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2018-10-10 11:31:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-10 11:31:59,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:31:59,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:31:59,867 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:31:59,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:31:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash 527831630, now seen corresponding path program 1 times [2018-10-10 11:31:59,867 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:31:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:31:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:31:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:31:59,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:31:59,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:31:59,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-10-10 11:32:00,089 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 11:32:00,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:00,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,120 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 11:32:00,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:00,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,140 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 11:32:00,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-10-10 11:32:00,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:32:00,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:32:00,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,182 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 11:32:00,185 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 11:32:00,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:00,193 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 11:32:00,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-10-10 11:32:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:00,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:00,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:00,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:32:00,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:32:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:32:00,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:32:00,232 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 7 states. [2018-10-10 11:32:00,541 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 11:32:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:01,862 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-10-10 11:32:01,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:32:01,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-10-10 11:32:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:01,865 INFO L225 Difference]: With dead ends: 154 [2018-10-10 11:32:01,865 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 11:32:01,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:32:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 11:32:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-10-10 11:32:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 11:32:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-10-10 11:32:01,869 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 14 [2018-10-10 11:32:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:01,869 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-10-10 11:32:01,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:32:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-10-10 11:32:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-10 11:32:01,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:01,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:01,871 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:01,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:01,872 INFO L82 PathProgramCache]: Analyzing trace with hash 440057360, now seen corresponding path program 1 times [2018-10-10 11:32:01,872 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:01,872 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:02,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:02,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:02,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:02,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-10-10 11:32:02,175 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 11:32:02,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:02,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,208 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 11:32:02,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:02,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,232 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 11:32:02,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-10-10 11:32:02,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:32:02,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:32:02,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,305 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 11:32:02,309 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 11:32:02,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,322 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 11:32:02,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2018-10-10 11:32:02,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:02,352 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 11:32:02,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:02,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:02,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:02,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:02,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-10-10 11:32:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:02,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:02,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:32:02,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:32:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:32:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:32:02,431 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 7 states. [2018-10-10 11:32:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:03,905 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-10-10 11:32:03,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:32:03,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-10-10 11:32:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:03,908 INFO L225 Difference]: With dead ends: 153 [2018-10-10 11:32:03,908 INFO L226 Difference]: Without dead ends: 153 [2018-10-10 11:32:03,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:32:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-10 11:32:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-10-10 11:32:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 11:32:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-10-10 11:32:03,912 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 16 [2018-10-10 11:32:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:03,912 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-10-10 11:32:03,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:32:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-10-10 11:32:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-10 11:32:03,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:03,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:03,914 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:03,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash 756876334, now seen corresponding path program 1 times [2018-10-10 11:32:03,914 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:03,915 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:04,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:04,094 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 7 treesize of output 5 [2018-10-10 11:32:04,096 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 11:32:04,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:04,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:04,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:04,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-10-10 11:32:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:04,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:32:04,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:32:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:32:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:04,128 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 5 states. [2018-10-10 11:32:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:05,101 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2018-10-10 11:32:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:32:05,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-10 11:32:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:05,104 INFO L225 Difference]: With dead ends: 205 [2018-10-10 11:32:05,104 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 11:32:05,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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 11:32:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 11:32:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2018-10-10 11:32:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 11:32:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-10-10 11:32:05,109 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 17 [2018-10-10 11:32:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:05,109 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-10-10 11:32:05,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:32:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-10-10 11:32:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-10 11:32:05,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:05,110 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:05,111 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:05,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329938, now seen corresponding path program 1 times [2018-10-10 11:32:05,112 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:05,112 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:05,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:05,306 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 11:32:05,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:05,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-10 11:32:05,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:32:05,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:32:05,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,382 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 7 treesize of output 5 [2018-10-10 11:32:05,385 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 11:32:05,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:05,388 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 11:32:05,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-10-10 11:32:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:05,477 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:05,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:05,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 11:32:05,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 11:32:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 11:32:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:32:05,484 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 8 states. [2018-10-10 11:32:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:07,061 INFO L93 Difference]: Finished difference Result 320 states and 341 transitions. [2018-10-10 11:32:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 11:32:07,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-10-10 11:32:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:07,065 INFO L225 Difference]: With dead ends: 320 [2018-10-10 11:32:07,065 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 11:32:07,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-10 11:32:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 11:32:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 190. [2018-10-10 11:32:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-10 11:32:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2018-10-10 11:32:07,071 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 18 [2018-10-10 11:32:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:07,072 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2018-10-10 11:32:07,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 11:32:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2018-10-10 11:32:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-10 11:32:07,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:07,073 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 11:32:07,073 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:07,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1508686000, now seen corresponding path program 1 times [2018-10-10 11:32:07,074 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:07,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:07,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:07,233 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 7 treesize of output 5 [2018-10-10 11:32:07,236 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 11:32:07,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,246 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 7 treesize of output 5 [2018-10-10 11:32:07,257 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 11:32:07,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,283 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 11:32:07,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-10 11:32:07,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:07,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 11:32:07,462 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 11:32:07,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:07,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-10 11:32:07,494 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 19 treesize of output 15 [2018-10-10 11:32:07,505 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 7 [2018-10-10 11:32:07,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:07,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-10-10 11:32:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:07,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:07,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:07,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:32:07,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:32:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:32:07,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:07,519 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand 5 states. [2018-10-10 11:32:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:08,623 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2018-10-10 11:32:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:32:08,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-10 11:32:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:08,626 INFO L225 Difference]: With dead ends: 220 [2018-10-10 11:32:08,626 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 11:32:08,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:32:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 11:32:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 189. [2018-10-10 11:32:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 11:32:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 214 transitions. [2018-10-10 11:32:08,634 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 214 transitions. Word has length 19 [2018-10-10 11:32:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:08,634 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 214 transitions. [2018-10-10 11:32:08,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:32:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-10-10 11:32:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-10 11:32:08,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:08,635 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:08,636 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:08,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash -475374188, now seen corresponding path program 1 times [2018-10-10 11:32:08,637 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:08,638 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:08,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:08,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:08,815 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 7 treesize of output 5 [2018-10-10 11:32:08,818 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 11:32:08,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,826 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 7 treesize of output 5 [2018-10-10 11:32:08,828 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 11:32:08,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,830 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 11:32:08,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-10 11:32:08,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:08,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-10 11:32:08,891 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 11:32:08,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:08,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,912 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 11:32:08,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:08,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,931 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 11:32:08,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-10-10 11:32:08,951 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 11:32:08,955 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 11:32:08,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,977 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 11:32:08,980 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 11:32:08,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:08,991 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 11:32:08,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-10-10 11:32:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:09,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:09,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:09,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:32:09,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:32:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:32:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:09,011 INFO L87 Difference]: Start difference. First operand 189 states and 214 transitions. Second operand 5 states. [2018-10-10 11:32:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:10,112 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-10-10 11:32:10,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:32:10,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-10 11:32:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:10,115 INFO L225 Difference]: With dead ends: 277 [2018-10-10 11:32:10,115 INFO L226 Difference]: Without dead ends: 277 [2018-10-10 11:32:10,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:32:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-10 11:32:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 188. [2018-10-10 11:32:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 11:32:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2018-10-10 11:32:10,121 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 20 [2018-10-10 11:32:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:10,121 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2018-10-10 11:32:10,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:32:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2018-10-10 11:32:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-10 11:32:10,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:10,122 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] [2018-10-10 11:32:10,122 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:10,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1851697870, now seen corresponding path program 1 times [2018-10-10 11:32:10,123 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:10,123 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:10,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:10,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:10,310 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 7 treesize of output 5 [2018-10-10 11:32:10,312 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 11:32:10,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,320 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 7 treesize of output 5 [2018-10-10 11:32:10,325 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 11:32:10,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,326 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 11:32:10,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-10 11:32:10,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:10,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 11:32:10,397 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 11:32:10,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:10,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-10 11:32:10,593 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 19 treesize of output 15 [2018-10-10 11:32:10,607 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 7 [2018-10-10 11:32:10,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:10,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-10-10 11:32:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:10,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:10,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:32:10,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:32:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:32:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:32:10,750 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand 6 states. [2018-10-10 11:32:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:12,199 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2018-10-10 11:32:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:32:12,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-10 11:32:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:12,203 INFO L225 Difference]: With dead ends: 251 [2018-10-10 11:32:12,204 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 11:32:12,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:32:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 11:32:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 187. [2018-10-10 11:32:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 11:32:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2018-10-10 11:32:12,210 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 21 [2018-10-10 11:32:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:12,210 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2018-10-10 11:32:12,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:32:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-10-10 11:32:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-10 11:32:12,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:12,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:12,214 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:12,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1568059050, now seen corresponding path program 1 times [2018-10-10 11:32:12,215 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:12,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:12,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:12,494 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 7 treesize of output 5 [2018-10-10 11:32:12,505 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 11:32:12,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,556 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 7 treesize of output 5 [2018-10-10 11:32:12,593 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 11:32:12,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,619 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 11:32:12,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-10 11:32:12,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:12,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-10 11:32:12,894 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 11:32:12,906 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 11:32:12,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:12,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,953 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 11:32:12,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 11:32:12,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:12,969 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 11:32:12,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-10-10 11:32:13,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:32:13,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:32:13,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:13,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:13,040 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 11:32:13,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 13 treesize of output 5 [2018-10-10 11:32:13,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:13,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:13,053 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 11:32:13,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-10-10 11:32:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:13,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:13,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:13,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:32:13,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:32:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:32:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:32:13,093 INFO L87 Difference]: Start difference. First operand 187 states and 212 transitions. Second operand 6 states. [2018-10-10 11:32:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:14,214 INFO L93 Difference]: Finished difference Result 189 states and 215 transitions. [2018-10-10 11:32:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:32:14,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-10-10 11:32:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:14,216 INFO L225 Difference]: With dead ends: 189 [2018-10-10 11:32:14,216 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 11:32:14,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:32:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 11:32:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-10 11:32:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 11:32:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2018-10-10 11:32:14,223 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 22 [2018-10-10 11:32:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:14,223 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2018-10-10 11:32:14,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:32:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2018-10-10 11:32:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:32:14,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:14,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:14,225 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:14,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash 628776216, now seen corresponding path program 1 times [2018-10-10 11:32:14,225 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:14,226 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:14,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:14,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:14,508 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 7 treesize of output 5 [2018-10-10 11:32:14,511 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 11:32:14,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,517 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 7 treesize of output 5 [2018-10-10 11:32:14,521 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 11:32:14,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,525 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 11:32:14,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-10 11:32:14,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:14,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-10 11:32:14,580 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 11:32:14,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:14,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,608 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 11:32:14,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:14,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,627 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 11:32:14,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-10-10 11:32:14,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:32:14,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:32:14,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,706 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 11:32:14,713 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 11:32:14,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:14,785 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 11:32:14,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-10-10 11:32:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:14,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:14,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:32:14,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:32:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:32:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:32:14,820 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand 6 states. [2018-10-10 11:32:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:15,969 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2018-10-10 11:32:15,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:32:15,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-10 11:32:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:15,971 INFO L225 Difference]: With dead ends: 197 [2018-10-10 11:32:15,971 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 11:32:15,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:32:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 11:32:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2018-10-10 11:32:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 11:32:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-10-10 11:32:15,975 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 24 [2018-10-10 11:32:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:15,975 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-10-10 11:32:15,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:32:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-10-10 11:32:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-10 11:32:15,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:15,976 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] [2018-10-10 11:32:15,977 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:15,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -126108512, now seen corresponding path program 1 times [2018-10-10 11:32:15,977 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:15,978 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:16,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:16,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:16,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:16,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 11:32:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:16,242 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:16,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:16,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:32:16,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:32:16,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:32:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:32:16,246 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 3 states. [2018-10-10 11:32:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:16,627 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-10-10 11:32:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:32:16,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-10 11:32:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:16,629 INFO L225 Difference]: With dead ends: 184 [2018-10-10 11:32:16,629 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 11:32:16,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:32:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 11:32:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-10-10 11:32:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-10 11:32:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2018-10-10 11:32:16,634 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 28 [2018-10-10 11:32:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:16,635 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2018-10-10 11:32:16,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:32:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2018-10-10 11:32:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 11:32:16,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:16,638 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] [2018-10-10 11:32:16,639 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:16,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -928327774, now seen corresponding path program 1 times [2018-10-10 11:32:16,639 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:16,639 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:16,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:16,913 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 11:32:16,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 [2018-10-10 11:32:16,941 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 7 treesize of output 5 [2018-10-10 11:32:16,944 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 11:32:16,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,958 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 7 treesize of output 5 [2018-10-10 11:32:16,961 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 11:32:16,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,964 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 11:32:16,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:22, output treesize:7 [2018-10-10 11:32:16,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-10-10 11:32:16,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:16,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-10-10 11:32:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:17,059 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:17,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 11:32:17,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 11:32:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 11:32:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:32:17,064 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 8 states. [2018-10-10 11:32:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:19,094 INFO L93 Difference]: Finished difference Result 278 states and 304 transitions. [2018-10-10 11:32:19,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 11:32:19,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-10-10 11:32:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:19,097 INFO L225 Difference]: With dead ends: 278 [2018-10-10 11:32:19,097 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 11:32:19,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-10-10 11:32:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 11:32:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 203. [2018-10-10 11:32:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-10 11:32:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 235 transitions. [2018-10-10 11:32:19,101 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 235 transitions. Word has length 30 [2018-10-10 11:32:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:19,101 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 235 transitions. [2018-10-10 11:32:19,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 11:32:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 235 transitions. [2018-10-10 11:32:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 11:32:19,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:19,102 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] [2018-10-10 11:32:19,103 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:19,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:19,103 INFO L82 PathProgramCache]: Analyzing trace with hash -931192766, now seen corresponding path program 1 times [2018-10-10 11:32:19,103 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:19,103 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:19,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:19,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:19,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:19,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:19,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:19,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 11:32:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:19,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:19,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:19,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:32:19,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:32:19,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:32:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:32:19,352 INFO L87 Difference]: Start difference. First operand 203 states and 235 transitions. Second operand 4 states. [2018-10-10 11:32:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:19,966 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-10-10 11:32:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:32:19,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-10-10 11:32:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:19,969 INFO L225 Difference]: With dead ends: 237 [2018-10-10 11:32:19,969 INFO L226 Difference]: Without dead ends: 237 [2018-10-10 11:32:19,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-10 11:32:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 200. [2018-10-10 11:32:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 11:32:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 232 transitions. [2018-10-10 11:32:19,972 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 232 transitions. Word has length 30 [2018-10-10 11:32:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:19,972 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 232 transitions. [2018-10-10 11:32:19,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:32:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 232 transitions. [2018-10-10 11:32:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-10 11:32:19,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:19,973 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] [2018-10-10 11:32:19,973 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:19,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:19,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1286611068, now seen corresponding path program 1 times [2018-10-10 11:32:19,974 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:19,974 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:19,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:20,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:20,150 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:20,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:20,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:32:20,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:32:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:32:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:32:20,152 INFO L87 Difference]: Start difference. First operand 200 states and 232 transitions. Second operand 4 states. [2018-10-10 11:32:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:20,370 INFO L93 Difference]: Finished difference Result 260 states and 278 transitions. [2018-10-10 11:32:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:32:20,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-10-10 11:32:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:20,373 INFO L225 Difference]: With dead ends: 260 [2018-10-10 11:32:20,373 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 11:32:20,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 11:32:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 200. [2018-10-10 11:32:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 11:32:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 231 transitions. [2018-10-10 11:32:20,376 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 231 transitions. Word has length 31 [2018-10-10 11:32:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:20,377 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 231 transitions. [2018-10-10 11:32:20,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:32:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2018-10-10 11:32:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-10 11:32:20,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:20,377 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] [2018-10-10 11:32:20,378 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:20,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1286610333, now seen corresponding path program 1 times [2018-10-10 11:32:20,379 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:20,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:20,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:20,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:20,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:20,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-10 11:32:20,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:20,717 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 11:32:20,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:20,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:20,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:20,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-10-10 11:32:20,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:32:20,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:20,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2018-10-10 11:32:20,863 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 7 treesize of output 5 [2018-10-10 11:32:20,867 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 11:32:20,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,887 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 16 treesize of output 12 [2018-10-10 11:32:20,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, 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 4 [2018-10-10 11:32:20,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:20,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:22 [2018-10-10 11:32:20,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:20,988 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 12 treesize of output 15 [2018-10-10 11:32:20,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:21,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:21,027 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:21,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:21,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:21,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:21,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-10-10 11:32:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:21,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:21,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:21,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 11:32:21,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 11:32:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 11:32:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:32:21,146 INFO L87 Difference]: Start difference. First operand 200 states and 231 transitions. Second operand 10 states. [2018-10-10 11:32:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:23,413 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-10-10 11:32:23,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 11:32:23,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-10-10 11:32:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:23,415 INFO L225 Difference]: With dead ends: 270 [2018-10-10 11:32:23,415 INFO L226 Difference]: Without dead ends: 270 [2018-10-10 11:32:23,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-10-10 11:32:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-10 11:32:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 201. [2018-10-10 11:32:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 11:32:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2018-10-10 11:32:23,419 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 31 [2018-10-10 11:32:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:23,419 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2018-10-10 11:32:23,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 11:32:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2018-10-10 11:32:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-10 11:32:23,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:23,420 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] [2018-10-10 11:32:23,420 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:23,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1197795423, now seen corresponding path program 1 times [2018-10-10 11:32:23,421 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:23,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:23,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:23,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:23,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:23,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 11:32:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:23,699 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:23,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:23,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:32:23,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:32:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:32:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:32:23,702 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand 4 states. [2018-10-10 11:32:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:24,266 INFO L93 Difference]: Finished difference Result 294 states and 343 transitions. [2018-10-10 11:32:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:32:24,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-10-10 11:32:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:24,269 INFO L225 Difference]: With dead ends: 294 [2018-10-10 11:32:24,269 INFO L226 Difference]: Without dead ends: 294 [2018-10-10 11:32:24,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-10 11:32:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 198. [2018-10-10 11:32:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 11:32:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2018-10-10 11:32:24,273 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 31 [2018-10-10 11:32:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:24,273 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 227 transitions. [2018-10-10 11:32:24,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:32:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 227 transitions. [2018-10-10 11:32:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-10 11:32:24,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:24,274 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] [2018-10-10 11:32:24,275 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:24,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1230214916, now seen corresponding path program 1 times [2018-10-10 11:32:24,275 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:24,275 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:24,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:24,506 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:24,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:24,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:32:24,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:32:24,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:32:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:24,509 INFO L87 Difference]: Start difference. First operand 198 states and 227 transitions. Second operand 5 states. [2018-10-10 11:32:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:25,395 INFO L93 Difference]: Finished difference Result 261 states and 303 transitions. [2018-10-10 11:32:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:32:25,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-10 11:32:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:25,397 INFO L225 Difference]: With dead ends: 261 [2018-10-10 11:32:25,397 INFO L226 Difference]: Without dead ends: 261 [2018-10-10 11:32:25,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 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 11:32:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-10 11:32:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 195. [2018-10-10 11:32:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 11:32:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2018-10-10 11:32:25,401 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 32 [2018-10-10 11:32:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:25,401 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2018-10-10 11:32:25,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:32:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2018-10-10 11:32:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-10 11:32:25,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:25,402 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] [2018-10-10 11:32:25,402 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:25,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -518043009, now seen corresponding path program 1 times [2018-10-10 11:32:25,403 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:25,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:25,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:25,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:25,693 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:25,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:25,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:32:25,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:32:25,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:32:25,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:32:25,696 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand 6 states. [2018-10-10 11:32:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:26,596 INFO L93 Difference]: Finished difference Result 271 states and 291 transitions. [2018-10-10 11:32:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:32:26,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-10-10 11:32:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:26,598 INFO L225 Difference]: With dead ends: 271 [2018-10-10 11:32:26,598 INFO L226 Difference]: Without dead ends: 271 [2018-10-10 11:32:26,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:32:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-10 11:32:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 195. [2018-10-10 11:32:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 11:32:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2018-10-10 11:32:26,602 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 33 [2018-10-10 11:32:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:26,603 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2018-10-10 11:32:26,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:32:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-10-10 11:32:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-10 11:32:26,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:26,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:26,604 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:26,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1201525238, now seen corresponding path program 1 times [2018-10-10 11:32:26,605 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:26,605 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:26,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:26,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:26,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:26,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:26,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:26,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 11:32:26,977 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:26,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:26,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:26,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,023 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 11:32:27,025 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 11:32:27,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,057 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 11:32:27,061 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 11:32:27,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,085 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:32 [2018-10-10 11:32:27,124 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 11:32:27,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:27,134 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 23 [2018-10-10 11:32:27,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,202 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 11:32:27,209 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:27,212 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 11:32:27,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,261 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 11:32:27,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:43 [2018-10-10 11:32:27,414 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:27,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:27,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:27,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:27,522 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 36 treesize of output 37 [2018-10-10 11:32:27,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:27,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:27,782 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 28 treesize of output 33 [2018-10-10 11:32:27,803 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 12 treesize of output 11 [2018-10-10 11:32:27,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:27,991 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2018-10-10 11:32:28,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:28,080 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 40 treesize of output 41 [2018-10-10 11:32:28,104 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 12 treesize of output 11 [2018-10-10 11:32:28,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,254 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 43 treesize of output 48 [2018-10-10 11:32:28,259 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 16 treesize of output 15 [2018-10-10 11:32:28,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,323 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 11:32:28,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:52 [2018-10-10 11:32:28,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:28,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 73 [2018-10-10 11:32:28,614 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 69 treesize of output 68 [2018-10-10 11:32:28,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 51 [2018-10-10 11:32:28,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-10 11:32:28,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 11:32:28,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:28,926 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 76 treesize of output 77 [2018-10-10 11:32:28,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:28,935 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:28,974 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:28,988 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 59 treesize of output 64 [2018-10-10 11:32:28,992 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 12 treesize of output 15 [2018-10-10 11:32:28,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:29,022 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:29,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 11:32:29,120 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:83, output treesize:99 [2018-10-10 11:32:29,231 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-10-10 11:32:29,234 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 12 treesize of output 11 [2018-10-10 11:32:29,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:29,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:29,504 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2018-10-10 11:32:29,508 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 20 treesize of output 19 [2018-10-10 11:32:29,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:29,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:29,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 94 [2018-10-10 11:32:29,785 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 78 treesize of output 79 [2018-10-10 11:32:29,786 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-10 11:32:30,023 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 85 treesize of output 84 [2018-10-10 11:32:30,024 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,138 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 11:32:30,304 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 60 treesize of output 53 [2018-10-10 11:32:30,309 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 12 treesize of output 11 [2018-10-10 11:32:30,309 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,335 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 11:32:30,472 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:185, output treesize:77 [2018-10-10 11:32:30,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:32:30,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:32:30,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,696 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 17 [2018-10-10 11:32:30,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-10 11:32:30,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:30,708 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 11:32:30,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-10-10 11:32:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:30,757 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:30,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:30,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-10 11:32:30,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 11:32:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 11:32:30,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-10-10 11:32:30,760 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 17 states. [2018-10-10 11:32:31,434 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-10-10 11:32:31,730 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-10-10 11:32:32,045 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-10 11:32:32,358 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-10-10 11:32:32,712 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-10-10 11:32:33,042 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-10-10 11:32:33,349 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-10 11:32:33,660 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-10-10 11:32:34,045 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2018-10-10 11:32:34,510 WARN L178 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-10-10 11:32:34,779 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-10 11:32:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:37,196 INFO L93 Difference]: Finished difference Result 227 states and 255 transitions. [2018-10-10 11:32:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 11:32:37,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-10-10 11:32:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:37,198 INFO L225 Difference]: With dead ends: 227 [2018-10-10 11:32:37,198 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 11:32:37,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2018-10-10 11:32:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 11:32:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2018-10-10 11:32:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 11:32:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2018-10-10 11:32:37,202 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2018-10-10 11:32:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:37,202 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2018-10-10 11:32:37,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 11:32:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2018-10-10 11:32:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 11:32:37,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:37,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:37,203 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:37,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1379597168, now seen corresponding path program 1 times [2018-10-10 11:32:37,204 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:37,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:37,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:37,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:37,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:37,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:37,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:32:37,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:32:37,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:32:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:32:37,520 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand 7 states. [2018-10-10 11:32:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:38,623 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2018-10-10 11:32:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 11:32:38,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-10 11:32:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:38,625 INFO L225 Difference]: With dead ends: 275 [2018-10-10 11:32:38,626 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 11:32:38,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-10 11:32:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 11:32:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 206. [2018-10-10 11:32:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 11:32:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 232 transitions. [2018-10-10 11:32:38,630 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 232 transitions. Word has length 41 [2018-10-10 11:32:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:38,630 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 232 transitions. [2018-10-10 11:32:38,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:32:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2018-10-10 11:32:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 11:32:38,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:38,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:38,631 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:38,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash 322934262, now seen corresponding path program 1 times [2018-10-10 11:32:38,631 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:38,631 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:38,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:38,938 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 11:32:38,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:38,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:38,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 [2018-10-10 11:32:38,965 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 7 treesize of output 5 [2018-10-10 11:32:38,969 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 11:32:38,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:38,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:38,981 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 7 treesize of output 5 [2018-10-10 11:32:38,983 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 11:32:38,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:38,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:38,998 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 11:32:38,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-10-10 11:32:39,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:39,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:39,022 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 11:32:39,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:39,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:39,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-10 11:32:39,160 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 19 treesize of output 20 [2018-10-10 11:32:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:39,173 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 11:32:39,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-10-10 11:32:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:39,290 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:39,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:39,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 11:32:39,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 11:32:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 11:32:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:32:39,293 INFO L87 Difference]: Start difference. First operand 206 states and 232 transitions. Second operand 10 states. [2018-10-10 11:32:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:42,093 INFO L93 Difference]: Finished difference Result 289 states and 317 transitions. [2018-10-10 11:32:42,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 11:32:42,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-10-10 11:32:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:42,095 INFO L225 Difference]: With dead ends: 289 [2018-10-10 11:32:42,095 INFO L226 Difference]: Without dead ends: 289 [2018-10-10 11:32:42,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-10-10 11:32:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-10 11:32:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 212. [2018-10-10 11:32:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 11:32:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 241 transitions. [2018-10-10 11:32:42,100 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 241 transitions. Word has length 41 [2018-10-10 11:32:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:42,101 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 241 transitions. [2018-10-10 11:32:42,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 11:32:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 241 transitions. [2018-10-10 11:32:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 11:32:42,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:42,101 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] [2018-10-10 11:32:42,102 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:42,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1421027688, now seen corresponding path program 1 times [2018-10-10 11:32:42,103 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:42,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:42,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:42,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:42,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-10 11:32:42,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:42,608 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 11:32:42,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:42,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:42,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:42,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-10-10 11:32:42,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:32:42,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:42,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-10-10 11:32:42,841 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 7 treesize of output 5 [2018-10-10 11:32:42,844 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 11:32:42,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,884 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 16 treesize of output 12 [2018-10-10 11:32:42,894 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 12 treesize of output 4 [2018-10-10 11:32:42,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:42,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:22 [2018-10-10 11:32:42,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:42,991 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 12 treesize of output 15 [2018-10-10 11:32:42,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:43,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:43,164 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:43,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 11:32:43,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:43,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:43,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-10-10 11:32:43,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:43,284 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 12 treesize of output 15 [2018-10-10 11:32:43,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:43,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:43,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:43,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:43,318 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 18 treesize of output 13 [2018-10-10 11:32:43,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:43,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:43,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:9 [2018-10-10 11:32:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:43,395 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:43,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:43,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 11:32:43,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 11:32:43,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 11:32:43,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:32:43,398 INFO L87 Difference]: Start difference. First operand 212 states and 241 transitions. Second operand 11 states. [2018-10-10 11:32:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:46,306 INFO L93 Difference]: Finished difference Result 289 states and 305 transitions. [2018-10-10 11:32:46,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 11:32:46,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-10-10 11:32:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:46,308 INFO L225 Difference]: With dead ends: 289 [2018-10-10 11:32:46,308 INFO L226 Difference]: Without dead ends: 289 [2018-10-10 11:32:46,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-10-10 11:32:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-10 11:32:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 212. [2018-10-10 11:32:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 11:32:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 239 transitions. [2018-10-10 11:32:46,312 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 239 transitions. Word has length 42 [2018-10-10 11:32:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:46,313 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 239 transitions. [2018-10-10 11:32:46,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 11:32:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 239 transitions. [2018-10-10 11:32:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 11:32:46,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:46,314 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] [2018-10-10 11:32:46,314 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:46,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1102185528, now seen corresponding path program 1 times [2018-10-10 11:32:46,315 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:46,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:46,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:46,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:46,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:46,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:46,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 11:32:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:46,549 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:32:46,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:32:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:32:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:32:46,551 INFO L87 Difference]: Start difference. First operand 212 states and 239 transitions. Second operand 4 states. [2018-10-10 11:32:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:47,168 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2018-10-10 11:32:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:32:47,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-10 11:32:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:47,170 INFO L225 Difference]: With dead ends: 240 [2018-10-10 11:32:47,170 INFO L226 Difference]: Without dead ends: 240 [2018-10-10 11:32:47,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-10 11:32:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 211. [2018-10-10 11:32:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 11:32:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2018-10-10 11:32:47,174 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 43 [2018-10-10 11:32:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:47,174 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2018-10-10 11:32:47,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:32:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2018-10-10 11:32:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-10 11:32:47,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:47,175 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] [2018-10-10 11:32:47,175 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:47,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -191986838, now seen corresponding path program 1 times [2018-10-10 11:32:47,176 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:47,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:47,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:47,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:47,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:47,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 11:32:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:47,489 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-10 11:32:47,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:32:47,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:32:47,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:32:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:32:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:32:47,493 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand 4 states. [2018-10-10 11:32:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:32:48,098 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2018-10-10 11:32:48,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:32:48,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-10 11:32:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:32:48,100 INFO L225 Difference]: With dead ends: 267 [2018-10-10 11:32:48,100 INFO L226 Difference]: Without dead ends: 267 [2018-10-10 11:32:48,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:32:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-10 11:32:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 210. [2018-10-10 11:32:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 11:32:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 235 transitions. [2018-10-10 11:32:48,104 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 235 transitions. Word has length 44 [2018-10-10 11:32:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:32:48,104 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 235 transitions. [2018-10-10 11:32:48,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:32:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 235 transitions. [2018-10-10 11:32:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 11:32:48,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:32:48,105 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:32:48,105 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:32:48,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:32:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash 20726789, now seen corresponding path program 1 times [2018-10-10 11:32:48,106 INFO L227 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-10 11:32:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-10 11:32:48,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:32:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:32:48,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:32:48,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 11:32:48,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:48,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:48,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 11:32:48,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:48,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:48,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:48,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:48,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:48,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-10-10 11:32:48,835 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 11:32:48,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:32:48,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:48,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:48,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-10-10 11:32:49,121 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 7 treesize of output 5 [2018-10-10 11:32:49,123 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 11:32:49,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:26 [2018-10-10 11:32:49,436 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-10 11:32:49,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:49,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:49,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:32:49,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:49,519 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 27 treesize of output 28 [2018-10-10 11:32:49,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:49,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,572 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:29 [2018-10-10 11:32:49,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:49,671 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 27 treesize of output 28 [2018-10-10 11:32:49,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:32:49,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:49,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-10-10 11:32:49,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:49,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2018-10-10 11:32:49,931 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 63 treesize of output 62 [2018-10-10 11:32:49,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:50,057 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 38 treesize of output 41 [2018-10-10 11:32:50,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-10 11:32:50,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 11:32:50,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 11:32:50,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:73 [2018-10-10 11:32:50,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 66 [2018-10-10 11:32:50,398 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 50 treesize of output 53 [2018-10-10 11:32:50,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 11:32:50,525 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 51 treesize of output 50 [2018-10-10 11:32:50,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:50,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 11:32:50,784 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-10-10 11:32:50,787 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 12 treesize of output 11 [2018-10-10 11:32:50,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:50,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:50,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 11:32:50,938 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:105, output treesize:59 [2018-10-10 11:32:51,111 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 33 treesize of output 26 [2018-10-10 11:32:51,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:51,119 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 26 treesize of output 35 [2018-10-10 11:32:51,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2018-10-10 11:32:51,200 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 11:32:51,203 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 11:32:51,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-10-10 11:32:51,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:32:51,257 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 14 treesize of output 23 [2018-10-10 11:32:51,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:32:51,266 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 11:32:51,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-10-10 11:32:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:32:51,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-10 11:32:53,375 WARN L178 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-10 11:32:54,931 WARN L178 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 11:32:56,055 WARN L178 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-10 11:32:58,131 WARN L178 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-10 11:32:59,275 WARN L178 SmtUtils]: Spent 920.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 11:33:00,471 WARN L178 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-10 11:33:00,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 64 [2018-10-10 11:33:00,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:00,540 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 66 treesize of output 59 [2018-10-10 11:33:00,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:00,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-10-10 11:33:00,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:136, output treesize:118 [2018-10-10 11:33:03,264 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 (_ BitVec 32)) (|ULTIMATE.start_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|ULTIMATE.start_write~$Pointer$_#value.base| (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (|v_ULTIMATE.start_#Ultimate.alloc_#res.base_5| (_ BitVec 32))) (or (= c_ULTIMATE.start_main_~bcki~0.base (select (select (let ((.cse0 (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base| |c_ULTIMATE.start_write~$Pointer$_#ptr.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base| |c_ULTIMATE.start_write~$Pointer$_#ptr.base|) |ULTIMATE.start_write~$Pointer$_#ptr.offset| |ULTIMATE.start_write~$Pointer$_#value.base|)))) (store .cse1 c_ULTIMATE.start_main_~bcki~0.base (store (select .cse1 c_ULTIMATE.start_main_~bcki~0.base) c_ULTIMATE.start_main_~bcki~0.offset |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5|))))) (store .cse0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5| (store (store (select .cse0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5|) v_prenex_15 v_prenex_16) v_subst_1 v_subst_2))) c_ULTIMATE.start_main_~bucket~0.base) c_ULTIMATE.start_main_~bucket~0.offset)) (not (= (select |c_#valid| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5|) (_ bv0 1))))) (forall ((v_prenex_20 (_ BitVec 32)) (v_subst_3 (_ BitVec 32)) (v_subst_4 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (or (not (= c_ULTIMATE.start_main_~bucket~0.base (select (select (let ((.cse2 (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base| |c_ULTIMATE.start_write~$Pointer$_#ptr.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base| |c_ULTIMATE.start_write~$Pointer$_#ptr.base|) v_prenex_19 v_prenex_18)))) (store .cse3 c_ULTIMATE.start_main_~bcki~0.base (store (select .cse3 c_ULTIMATE.start_main_~bcki~0.base) c_ULTIMATE.start_main_~bcki~0.offset v_prenex_20))))) (store .cse2 v_prenex_20 (store (store (select .cse2 v_prenex_20) v_subst_3 v_subst_4) v_prenex_13 v_prenex_14))) c_ULTIMATE.start_main_~bucket~0.base) c_ULTIMATE.start_main_~bucket~0.offset))) (not (= (select |c_#valid| v_prenex_20) (_ bv0 1)))))) is different from false [2018-10-10 11:33:05,283 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 (_ BitVec 32)) (|ULTIMATE.start_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (|ULTIMATE.start_write~$Pointer$_#value.base| (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (|v_ULTIMATE.start_#Ultimate.alloc_#res.base_5| (_ BitVec 32))) (or (= c_ULTIMATE.start_main_~bcki~0.base (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~bcki~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~bcki~0.base) |ULTIMATE.start_write~$Pointer$_#ptr.offset| |ULTIMATE.start_write~$Pointer$_#value.base|) c_ULTIMATE.start_main_~bcki~0.offset |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5|)))) (store .cse0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5| (store (store (select .cse0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5|) v_prenex_15 v_prenex_16) v_subst_1 v_subst_2))) c_ULTIMATE.start_main_~bucket~0.base) c_ULTIMATE.start_main_~bucket~0.offset)) (not (= (select |c_#valid| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_5|) (_ bv0 1))))) (forall ((v_prenex_20 (_ BitVec 32)) (v_subst_3 (_ BitVec 32)) (v_subst_4 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (or (not (= c_ULTIMATE.start_main_~bucket~0.base (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~bcki~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~bcki~0.base) v_prenex_19 v_prenex_18) c_ULTIMATE.start_main_~bcki~0.offset v_prenex_20)))) (store .cse1 v_prenex_20 (store (store (select .cse1 v_prenex_20) v_subst_3 v_subst_4) v_prenex_13 v_prenex_14))) c_ULTIMATE.start_main_~bucket~0.base) c_ULTIMATE.start_main_~bucket~0.offset))) (not (= (select |c_#valid| v_prenex_20) (_ bv0 1)))))) is different from false [2018-10-10 11:33:05,305 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 72 treesize of output 68 [2018-10-10 11:33:05,320 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 61 treesize of output 57 [2018-10-10 11:33:05,320 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 11:33:05,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 11:33:05,498 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 75 treesize of output 71 [2018-10-10 11:33:05,503 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 64 treesize of output 60 [2018-10-10 11:33:05,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 11:33:05,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 11:33:05,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 2 xjuncts. [2018-10-10 11:33:05,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:148, output treesize:132 [2018-10-10 11:33:21,337 WARN L178 SmtUtils]: Spent 8.07 s on a formula simplification that was a NOOP. DAG size: 58 [2018-10-10 11:33:23,143 WARN L178 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2018-10-10 11:33:23,150 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:23,151 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:23,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 96 [2018-10-10 11:33:23,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:23,163 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:23,163 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:23,164 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 96 treesize of output 85 [2018-10-10 11:33:23,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:23,170 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:23,171 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:23,172 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 107 treesize of output 96 [2018-10-10 11:33:23,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:24,437 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:24,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:24,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 99 [2018-10-10 11:33:24,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:24,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:24,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 11:33:24,446 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 179 treesize of output 168 [2018-10-10 11:33:24,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:25,409 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 122 [2018-10-10 11:33:28,009 WARN L178 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 155 DAG size of output: 136 [2018-10-10 11:33:28,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 95 treesize of output 99 [2018-10-10 11:33:28,089 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 11:33:30,429 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 101 treesize of output 100 [2018-10-10 11:33:30,430 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:30,443 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 107 treesize of output 106 [2018-10-10 11:33:30,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-10 11:33: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 86 treesize of output 85 [2018-10-10 11:33:30,453 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-10 11:33:32,568 INFO L303 Elim1Store]: Index analysis took 257 ms [2018-10-10 11:33:33,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 24 case distinctions, treesize of input 85 treesize of output 186 [2018-10-10 11:33:33,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11