./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5083763cd1026dac92f37bc5a05779baf01a71b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:54:59,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:54:59,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:54:59,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:54:59,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:54:59,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:54:59,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:54:59,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:54:59,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:54:59,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:54:59,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:54:59,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:54:59,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:54:59,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:54:59,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:54:59,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:54:59,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:54:59,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:54:59,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:54:59,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:54:59,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:54:59,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:54:59,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:54:59,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:54:59,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:54:59,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:54:59,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:54:59,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:54:59,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:54:59,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:54:59,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:54:59,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:54:59,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:54:59,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:54:59,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:54:59,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:54:59,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:54:59,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:54:59,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:54:59,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:54:59,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:54:59,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:54:59,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:54:59,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:54:59,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:54:59,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:54:59,522 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:54:59,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:54:59,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:54:59,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:54:59,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:54:59,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:54:59,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:54:59,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:54:59,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:54:59,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:54:59,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:54:59,525 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:54:59,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:54:59,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:54:59,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:54:59,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:54:59,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:54:59,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:54:59,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:54:59,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:54:59,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:54:59,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:54:59,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:54:59,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:54:59,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5083763cd1026dac92f37bc5a05779baf01a71b [2019-11-27 23:54:59,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:54:59,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:54:59,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:54:59,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:54:59,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:54:59,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-11-27 23:54:59,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a671ae1/643307e4513a4294befcb6cb275abf08/FLAG95772eb56 [2019-11-27 23:55:00,409 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:55:00,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-11-27 23:55:00,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a671ae1/643307e4513a4294befcb6cb275abf08/FLAG95772eb56 [2019-11-27 23:55:00,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a671ae1/643307e4513a4294befcb6cb275abf08 [2019-11-27 23:55:00,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:55:00,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:55:00,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:55:00,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:55:00,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:55:00,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:55:00" (1/1) ... [2019-11-27 23:55:00,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672988f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:00, skipping insertion in model container [2019-11-27 23:55:00,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:55:00" (1/1) ... [2019-11-27 23:55:00,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:55:00,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:55:01,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:55:01,244 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:55:01,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:55:01,354 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:55:01,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01 WrapperNode [2019-11-27 23:55:01,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:55:01,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:55:01,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:55:01,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:55:01,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:55:01,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:55:01,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:55:01,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:55:01,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:55:01,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:55:01,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:55:01,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:55:01,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (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 [2019-11-27 23:55:01,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:55:01,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:55:01,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:55:01,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:55:01,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:55:01,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:55:01,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:55:01,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:55:02,079 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:55:02,080 INFO L297 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-27 23:55:02,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:02 BoogieIcfgContainer [2019-11-27 23:55:02,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:55:02,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:55:02,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:55:02,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:55:02,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:55:00" (1/3) ... [2019-11-27 23:55:02,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3785b94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:55:02, skipping insertion in model container [2019-11-27 23:55:02,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01" (2/3) ... [2019-11-27 23:55:02,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3785b94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:55:02, skipping insertion in model container [2019-11-27 23:55:02,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:02" (3/3) ... [2019-11-27 23:55:02,098 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-11-27 23:55:02,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:55:02,116 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-27 23:55:02,127 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-27 23:55:02,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:55:02,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:55:02,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:55:02,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:55:02,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:55:02,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:55:02,150 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:55:02,150 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:55:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-27 23:55:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-27 23:55:02,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:02,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-27 23:55:02,177 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2019-11-27 23:55:02,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:02,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273957025] [2019-11-27 23:55:02,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:02,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273957025] [2019-11-27 23:55:02,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:02,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:55:02,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880781023] [2019-11-27 23:55:02,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:55:02,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:55:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:55:02,384 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2019-11-27 23:55:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:02,413 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2019-11-27 23:55:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:55:02,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-27 23:55:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:02,426 INFO L225 Difference]: With dead ends: 168 [2019-11-27 23:55:02,426 INFO L226 Difference]: Without dead ends: 80 [2019-11-27 23:55:02,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:55:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-27 23:55:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-27 23:55:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-27 23:55:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-11-27 23:55:02,467 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-11-27 23:55:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:02,468 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-11-27 23:55:02,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:55:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-11-27 23:55:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 23:55:02,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:02,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 23:55:02,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2019-11-27 23:55:02,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:02,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849228321] [2019-11-27 23:55:02,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:02,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849228321] [2019-11-27 23:55:02,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:02,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:02,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790049648] [2019-11-27 23:55:02,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:02,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:02,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:02,532 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2019-11-27 23:55:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:02,574 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-27 23:55:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:02,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-27 23:55:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:02,576 INFO L225 Difference]: With dead ends: 80 [2019-11-27 23:55:02,576 INFO L226 Difference]: Without dead ends: 70 [2019-11-27 23:55:02,578 INFO L630 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 [2019-11-27 23:55:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-27 23:55:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-27 23:55:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-27 23:55:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-11-27 23:55:02,587 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2019-11-27 23:55:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:02,588 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-11-27 23:55:02,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-11-27 23:55:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:55:02,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:02,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:02,591 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2019-11-27 23:55:02,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:02,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122567522] [2019-11-27 23:55:02,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:02,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122567522] [2019-11-27 23:55:02,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:02,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:02,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194418987] [2019-11-27 23:55:02,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:02,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:02,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:02,710 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 3 states. [2019-11-27 23:55:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:02,763 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-27 23:55:02,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:02,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-27 23:55:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:02,766 INFO L225 Difference]: With dead ends: 70 [2019-11-27 23:55:02,766 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 23:55:02,767 INFO L630 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 [2019-11-27 23:55:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 23:55:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-27 23:55:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-27 23:55:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-11-27 23:55:02,775 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2019-11-27 23:55:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:02,775 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-11-27 23:55:02,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-11-27 23:55:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 23:55:02,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:02,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:02,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2019-11-27 23:55:02,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:02,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057139300] [2019-11-27 23:55:02,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:02,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057139300] [2019-11-27 23:55:02,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:02,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:02,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988455824] [2019-11-27 23:55:02,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:02,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:02,852 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 3 states. [2019-11-27 23:55:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:02,901 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-11-27 23:55:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:02,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 23:55:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:02,903 INFO L225 Difference]: With dead ends: 153 [2019-11-27 23:55:02,903 INFO L226 Difference]: Without dead ends: 87 [2019-11-27 23:55:02,905 INFO L630 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 [2019-11-27 23:55:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-27 23:55:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-11-27 23:55:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 23:55:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-27 23:55:02,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2019-11-27 23:55:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:02,914 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-27 23:55:02,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-27 23:55:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:55:02,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:02,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:02,916 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2019-11-27 23:55:02,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:02,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366180622] [2019-11-27 23:55:02,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:02,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366180622] [2019-11-27 23:55:02,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:02,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:55:02,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828562632] [2019-11-27 23:55:02,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:55:02,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:55:03,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:03,000 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-11-27 23:55:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:03,144 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-27 23:55:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:55:03,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 23:55:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:03,148 INFO L225 Difference]: With dead ends: 91 [2019-11-27 23:55:03,150 INFO L226 Difference]: Without dead ends: 71 [2019-11-27 23:55:03,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:55:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-27 23:55:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-27 23:55:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-27 23:55:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-11-27 23:55:03,161 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2019-11-27 23:55:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:03,162 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-11-27 23:55:03,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:55:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-11-27 23:55:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:55:03,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:03,165 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:03,165 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2019-11-27 23:55:03,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:03,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139514599] [2019-11-27 23:55:03,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:03,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139514599] [2019-11-27 23:55:03,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243099551] [2019-11-27 23:55:03,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:03,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-27 23:55:03,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:03,413 INFO L377 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 [2019-11-27 23:55:03,414 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,430 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:03,430 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:03,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:03,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:55:03,464 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,474 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:03,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 23:55:03,482 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,492 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:03,492 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,492 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-27 23:55:03,590 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-27 23:55:03,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-27 23:55:03,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:03,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:03,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:03,605 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-27 23:55:03,632 INFO L588 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-11-27 23:55:03,633 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:03,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-27 23:55:03,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:03,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-27 23:55:03,722 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,735 INFO L588 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-27 23:55:03,736 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:03,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-27 23:55:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:03,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:03,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-27 23:55:03,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155080582] [2019-11-27 23:55:03,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:55:03,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:03,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:55:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:55:03,756 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 9 states. [2019-11-27 23:55:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:03,992 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2019-11-27 23:55:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:55:03,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-27 23:55:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:03,994 INFO L225 Difference]: With dead ends: 134 [2019-11-27 23:55:03,995 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 23:55:03,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:55:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 23:55:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 84. [2019-11-27 23:55:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-27 23:55:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-27 23:55:04,016 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2019-11-27 23:55:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:04,016 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-27 23:55:04,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:55:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-27 23:55:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:55:04,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:04,019 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:04,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:04,226 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2019-11-27 23:55:04,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:04,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071571436] [2019-11-27 23:55:04,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:04,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071571436] [2019-11-27 23:55:04,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:04,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:04,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854424226] [2019-11-27 23:55:04,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:04,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:04,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:04,287 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 3 states. [2019-11-27 23:55:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:04,331 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2019-11-27 23:55:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:04,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 23:55:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:04,333 INFO L225 Difference]: With dead ends: 174 [2019-11-27 23:55:04,333 INFO L226 Difference]: Without dead ends: 108 [2019-11-27 23:55:04,335 INFO L630 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 [2019-11-27 23:55:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-27 23:55:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-11-27 23:55:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-27 23:55:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-11-27 23:55:04,344 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-11-27 23:55:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:04,344 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-11-27 23:55:04,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-11-27 23:55:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:55:04,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:04,346 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:04,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2019-11-27 23:55:04,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:04,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089478892] [2019-11-27 23:55:04,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 23:55:04,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089478892] [2019-11-27 23:55:04,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:04,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:04,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200674696] [2019-11-27 23:55:04,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:04,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:04,428 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 3 states. [2019-11-27 23:55:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:04,473 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-11-27 23:55:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:04,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 23:55:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:04,475 INFO L225 Difference]: With dead ends: 201 [2019-11-27 23:55:04,475 INFO L226 Difference]: Without dead ends: 122 [2019-11-27 23:55:04,476 INFO L630 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 [2019-11-27 23:55:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-27 23:55:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-11-27 23:55:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-27 23:55:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-11-27 23:55:04,496 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2019-11-27 23:55:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:04,496 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-11-27 23:55:04,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-11-27 23:55:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:55:04,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:04,502 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:04,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2019-11-27 23:55:04,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:04,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566627564] [2019-11-27 23:55:04,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:04,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566627564] [2019-11-27 23:55:04,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159820784] [2019-11-27 23:55:04,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:04,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-27 23:55:04,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:04,799 INFO L377 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 [2019-11-27 23:55:04,800 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,813 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,814 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:04,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,844 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:55:04,845 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,879 INFO L588 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-27 23:55:04,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 23:55:04,885 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,900 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,900 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-27 23:55:04,948 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:04,948 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:04,949 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,961 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,961 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2019-11-27 23:55:05,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:05,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-27 23:55:05,004 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:05,029 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:05,098 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:05,099 INFO L377 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 4 case distinctions, treesize of input 79 treesize of output 100 [2019-11-27 23:55:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:05,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:05,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:05,111 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:05,170 INFO L588 ElimStorePlain]: treesize reduction 209, result has 18.4 percent of original size [2019-11-27 23:55:05,171 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:05,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2019-11-27 23:55:05,355 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-27 23:55:05,358 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-27 23:55:05,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 142 [2019-11-27 23:55:05,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:05,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:05,366 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:05,396 INFO L588 ElimStorePlain]: treesize reduction 116, result has 34.1 percent of original size [2019-11-27 23:55:05,397 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:05,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2019-11-27 23:55:05,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:05,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 65 [2019-11-27 23:55:05,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:05,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:05,499 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:05,510 INFO L588 ElimStorePlain]: treesize reduction 9, result has 50.0 percent of original size [2019-11-27 23:55:05,510 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:05,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2019-11-27 23:55:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:05,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:05,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-27 23:55:05,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110656008] [2019-11-27 23:55:05,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:55:05,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:05,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:55:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:55:05,522 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-11-27 23:55:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:06,001 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-11-27 23:55:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:55:06,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-27 23:55:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:06,007 INFO L225 Difference]: With dead ends: 170 [2019-11-27 23:55:06,007 INFO L226 Difference]: Without dead ends: 168 [2019-11-27 23:55:06,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:55:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-27 23:55:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2019-11-27 23:55:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-27 23:55:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2019-11-27 23:55:06,021 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2019-11-27 23:55:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:06,022 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2019-11-27 23:55:06,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:55:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2019-11-27 23:55:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:55:06,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:06,023 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 23:55:06,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:06,227 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2019-11-27 23:55:06,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:06,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133609663] [2019-11-27 23:55:06,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:55:06,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133609663] [2019-11-27 23:55:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:06,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:06,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994037980] [2019-11-27 23:55:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:06,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:06,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:06,254 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 3 states. [2019-11-27 23:55:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:06,265 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-11-27 23:55:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:06,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-27 23:55:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:06,266 INFO L225 Difference]: With dead ends: 129 [2019-11-27 23:55:06,267 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 23:55:06,267 INFO L630 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 [2019-11-27 23:55:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 23:55:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-27 23:55:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 23:55:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2019-11-27 23:55:06,273 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2019-11-27 23:55:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:06,273 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2019-11-27 23:55:06,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2019-11-27 23:55:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:55:06,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:06,274 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 23:55:06,274 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:06,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2019-11-27 23:55:06,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:06,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616218343] [2019-11-27 23:55:06,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:06,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616218343] [2019-11-27 23:55:06,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120245814] [2019-11-27 23:55:06,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:06,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-27 23:55:06,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:06,653 INFO L377 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 [2019-11-27 23:55:06,653 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,658 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,659 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:06,693 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:55:06,695 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,712 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:06,718 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,733 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:06,739 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,750 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,750 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,750 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-27 23:55:06,793 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 4=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_30|]} [2019-11-27 23:55:06,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2019-11-27 23:55:06,798 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,824 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,831 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-27 23:55:06,832 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,846 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,872 INFO L377 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 2 case distinctions, treesize of input 69 treesize of output 90 [2019-11-27 23:55:06,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:06,874 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,898 INFO L588 ElimStorePlain]: treesize reduction 56, result has 46.7 percent of original size [2019-11-27 23:55:06,898 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,899 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-11-27 23:55:06,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2019-11-27 23:55:06,941 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,959 INFO L588 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-27 23:55:06,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-27 23:55:06,963 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,969 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:06,969 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:06,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-11-27 23:55:06,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:07,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:07,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-11-27 23:55:07,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44687460] [2019-11-27 23:55:07,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:55:07,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:55:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:55:07,004 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand 14 states. [2019-11-27 23:55:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:07,702 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2019-11-27 23:55:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:07,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-27 23:55:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:07,703 INFO L225 Difference]: With dead ends: 163 [2019-11-27 23:55:07,703 INFO L226 Difference]: Without dead ends: 161 [2019-11-27 23:55:07,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-11-27 23:55:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-27 23:55:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2019-11-27 23:55:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-27 23:55:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2019-11-27 23:55:07,710 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2019-11-27 23:55:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:07,710 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2019-11-27 23:55:07,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:55:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2019-11-27 23:55:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:55:07,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:07,711 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:07,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:07,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2019-11-27 23:55:07,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:07,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135910188] [2019-11-27 23:55:07,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:08,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135910188] [2019-11-27 23:55:08,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354855116] [2019-11-27 23:55:08,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:08,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-27 23:55:08,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:08,192 INFO L377 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 [2019-11-27 23:55:08,193 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,201 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,201 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:08,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:55:08,246 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,308 INFO L588 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-27 23:55:08,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:08,314 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,336 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:08,345 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,363 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,364 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,364 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-27 23:55:08,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:08,407 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:08,408 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,438 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:08,444 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:08,445 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,461 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,462 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-27 23:55:08,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-27 23:55:08,518 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,554 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-27 23:55:08,563 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,587 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,631 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 103 [2019-11-27 23:55:08,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,633 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,680 INFO L588 ElimStorePlain]: treesize reduction 76, result has 47.2 percent of original size [2019-11-27 23:55:08,681 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,682 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:147, output treesize:57 [2019-11-27 23:55:08,722 INFO L404 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_28|], 12=[|v_#memory_$Pointer$.base_34|]} [2019-11-27 23:55:08,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:08,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-27 23:55:08,735 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:08,754 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:08,849 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-27 23:55:08,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 149 [2019-11-27 23:55:08,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:08,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:08,873 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-27 23:55:08,962 INFO L588 ElimStorePlain]: treesize reduction 1591, result has 5.1 percent of original size [2019-11-27 23:55:08,963 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:08,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:172, output treesize:86 [2019-11-27 23:55:09,024 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-27 23:55:09,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-11-27 23:55:09,028 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:09,040 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:09,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:09,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2019-11-27 23:55:09,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:09,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:09,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:09,062 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:09,073 INFO L588 ElimStorePlain]: treesize reduction 30, result has 23.1 percent of original size [2019-11-27 23:55:09,073 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:09,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:101, output treesize:4 [2019-11-27 23:55:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:09,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:09,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-27 23:55:09,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142651017] [2019-11-27 23:55:09,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:55:09,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:55:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:55:09,086 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand 12 states. [2019-11-27 23:55:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:09,657 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2019-11-27 23:55:09,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:09,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-27 23:55:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:09,659 INFO L225 Difference]: With dead ends: 169 [2019-11-27 23:55:09,659 INFO L226 Difference]: Without dead ends: 167 [2019-11-27 23:55:09,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:55:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-27 23:55:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-11-27 23:55:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-27 23:55:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2019-11-27 23:55:09,668 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 31 [2019-11-27 23:55:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:09,668 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2019-11-27 23:55:09,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:55:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2019-11-27 23:55:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 23:55:09,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:09,669 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:09,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:09,876 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2019-11-27 23:55:09,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:09,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920566021] [2019-11-27 23:55:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-27 23:55:09,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920566021] [2019-11-27 23:55:09,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:09,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:09,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806915080] [2019-11-27 23:55:09,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:09,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:09,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:09,916 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 3 states. [2019-11-27 23:55:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:09,981 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2019-11-27 23:55:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:09,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 23:55:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:09,982 INFO L225 Difference]: With dead ends: 204 [2019-11-27 23:55:09,982 INFO L226 Difference]: Without dead ends: 111 [2019-11-27 23:55:09,983 INFO L630 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 [2019-11-27 23:55:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-27 23:55:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-11-27 23:55:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 23:55:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2019-11-27 23:55:09,988 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2019-11-27 23:55:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:09,989 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2019-11-27 23:55:09,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2019-11-27 23:55:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 23:55:09,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:09,990 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:09,990 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2019-11-27 23:55:09,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:09,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705222594] [2019-11-27 23:55:09,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:10,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705222594] [2019-11-27 23:55:10,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:10,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:55:10,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295610230] [2019-11-27 23:55:10,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:55:10,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:55:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:55:10,019 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2019-11-27 23:55:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:10,061 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-27 23:55:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:55:10,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-27 23:55:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:10,062 INFO L225 Difference]: With dead ends: 118 [2019-11-27 23:55:10,062 INFO L226 Difference]: Without dead ends: 107 [2019-11-27 23:55:10,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-27 23:55:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-27 23:55:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-27 23:55:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-27 23:55:10,070 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2019-11-27 23:55:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:10,070 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-27 23:55:10,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:55:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-27 23:55:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 23:55:10,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:10,071 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:10,071 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2019-11-27 23:55:10,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:10,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838470025] [2019-11-27 23:55:10,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:10,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838470025] [2019-11-27 23:55:10,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363844704] [2019-11-27 23:55:10,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:10,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-27 23:55:10,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:10,343 INFO L377 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 [2019-11-27 23:55:10,344 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,352 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,352 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:10,385 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:55:10,386 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,413 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:10,426 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,446 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:10,454 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,471 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,471 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,472 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-27 23:55:10,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,542 INFO L377 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 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-27 23:55:10,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:10,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:10,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:10,546 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-27 23:55:10,609 INFO L588 ElimStorePlain]: treesize reduction 221, result has 22.7 percent of original size [2019-11-27 23:55:10,613 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-27 23:55:10,614 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,627 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,628 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-27 23:55:10,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-27 23:55:10,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:10,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:10,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:10,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:10,748 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:10,780 INFO L588 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-27 23:55:10,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-27 23:55:10,792 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,800 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:10,801 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:10,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-27 23:55:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:10,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-27 23:55:10,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082009686] [2019-11-27 23:55:10,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:55:10,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:55:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:55:10,817 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 14 states. [2019-11-27 23:55:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:11,235 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-11-27 23:55:11,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:55:11,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-27 23:55:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:11,236 INFO L225 Difference]: With dead ends: 111 [2019-11-27 23:55:11,236 INFO L226 Difference]: Without dead ends: 80 [2019-11-27 23:55:11,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-27 23:55:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-27 23:55:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-27 23:55:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-27 23:55:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-11-27 23:55:11,244 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 37 [2019-11-27 23:55:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:11,245 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-11-27 23:55:11,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:55:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-11-27 23:55:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 23:55:11,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:11,246 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:11,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:11,447 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2019-11-27 23:55:11,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:11,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751577405] [2019-11-27 23:55:11,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:11,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751577405] [2019-11-27 23:55:11,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465155681] [2019-11-27 23:55:11,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:11,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 23:55:11,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:11,709 INFO L377 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 [2019-11-27 23:55:11,710 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,714 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:11,715 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:11,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:11,739 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:55:11,740 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,782 INFO L588 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-27 23:55:11,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 23:55:11,788 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,800 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:11,801 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-27 23:55:11,837 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:11,837 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:11,838 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,851 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:11,852 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-27 23:55:11,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:11,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-27 23:55:11,921 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:11,996 INFO L588 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-11-27 23:55:12,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:12,040 INFO L377 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 4 case distinctions, treesize of input 88 treesize of output 105 [2019-11-27 23:55:12,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,048 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:12,148 INFO L588 ElimStorePlain]: treesize reduction 902, result has 7.1 percent of original size [2019-11-27 23:55:12,149 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:12,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-11-27 23:55:12,298 INFO L343 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-11-27 23:55:12,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-11-27 23:55:12,299 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:12,347 INFO L588 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-11-27 23:55:12,348 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:12,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2019-11-27 23:55:12,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:12,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-27 23:55:12,384 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:12,406 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:12,571 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-27 23:55:12,572 INFO L343 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-27 23:55:12,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 177 [2019-11-27 23:55:12,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:12,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:12,628 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:12,764 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-27 23:55:12,765 INFO L588 ElimStorePlain]: treesize reduction 3972, result has 2.2 percent of original size [2019-11-27 23:55:12,765 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:12,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2019-11-27 23:55:12,995 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-27 23:55:12,996 INFO L343 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-27 23:55:12,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 222 [2019-11-27 23:55:12,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:13,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:13,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:13,004 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-27 23:55:13,074 INFO L588 ElimStorePlain]: treesize reduction 625, result has 16.6 percent of original size [2019-11-27 23:55:13,075 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:13,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2019-11-27 23:55:13,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:13,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 116 [2019-11-27 23:55:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:13,175 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:13,204 INFO L588 ElimStorePlain]: treesize reduction 271, result has 3.2 percent of original size [2019-11-27 23:55:13,204 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:13,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2019-11-27 23:55:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:13,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:13,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-27 23:55:13,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11537633] [2019-11-27 23:55:13,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 23:55:13,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 23:55:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-27 23:55:13,221 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 17 states. [2019-11-27 23:55:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:13,870 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-11-27 23:55:13,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:55:13,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-27 23:55:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:13,872 INFO L225 Difference]: With dead ends: 149 [2019-11-27 23:55:13,872 INFO L226 Difference]: Without dead ends: 147 [2019-11-27 23:55:13,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-11-27 23:55:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-27 23:55:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2019-11-27 23:55:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-27 23:55:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-27 23:55:13,879 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2019-11-27 23:55:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:13,879 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-27 23:55:13,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 23:55:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-27 23:55:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 23:55:13,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:13,880 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:14,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:14,084 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2019-11-27 23:55:14,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:14,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125120713] [2019-11-27 23:55:14,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:14,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125120713] [2019-11-27 23:55:14,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705122034] [2019-11-27 23:55:14,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:14,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-27 23:55:14,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:14,500 INFO L377 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 [2019-11-27 23:55:14,500 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,505 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,506 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:14,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:55:14,560 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,608 INFO L588 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-27 23:55:14,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:14,614 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,633 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:14,640 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,657 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,658 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,658 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-27 23:55:14,701 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 6=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_44|]} [2019-11-27 23:55:14,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:55:14,710 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,754 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:14,763 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:14,764 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,801 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:14,809 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:14,810 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,831 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,832 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:14,832 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-11-27 23:55:14,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:14,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-27 23:55:14,942 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,017 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,020 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_int_18|], 9=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_33|]} [2019-11-27 23:55:15,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-27 23:55:15,041 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,101 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-27 23:55:15,112 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,156 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,220 INFO L377 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 4 case distinctions, treesize of input 136 treesize of output 137 [2019-11-27 23:55:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,237 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,591 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-11-27 23:55:15,592 INFO L588 ElimStorePlain]: treesize reduction 1388, result has 7.4 percent of original size [2019-11-27 23:55:15,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-27 23:55:15,601 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,631 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,632 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,632 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-11-27 23:55:15,688 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_int_21|], 6=[|v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_$Pointer$.base_46|]} [2019-11-27 23:55:15,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-11-27 23:55:15,696 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,742 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:15,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-27 23:55:15,752 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:15,788 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:15,957 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-27 23:55:15,958 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-27 23:55:15,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 161 [2019-11-27 23:55:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:15,993 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-11-27 23:55:16,178 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-27 23:55:16,179 INFO L588 ElimStorePlain]: treesize reduction 1955, result has 5.0 percent of original size [2019-11-27 23:55:16,180 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:16,180 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-11-27 23:55:16,273 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-27 23:55:16,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-27 23:55:16,279 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:16,305 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:16,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:16,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 77 [2019-11-27 23:55:16,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:16,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:16,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:16,344 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:16,389 INFO L588 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-11-27 23:55:16,390 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:16,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-11-27 23:55:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:16,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:16,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-27 23:55:16,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036240673] [2019-11-27 23:55:16,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:55:16,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:55:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:55:16,495 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 15 states. [2019-11-27 23:55:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:17,783 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-27 23:55:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:55:17,784 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-27 23:55:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:17,785 INFO L225 Difference]: With dead ends: 101 [2019-11-27 23:55:17,785 INFO L226 Difference]: Without dead ends: 99 [2019-11-27 23:55:17,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-11-27 23:55:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-27 23:55:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2019-11-27 23:55:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-27 23:55:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-11-27 23:55:17,803 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2019-11-27 23:55:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:17,804 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-11-27 23:55:17,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:55:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-11-27 23:55:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 23:55:17,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:17,806 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:18,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:18,023 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2019-11-27 23:55:18,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:18,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802414435] [2019-11-27 23:55:18,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-27 23:55:18,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802414435] [2019-11-27 23:55:18,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:18,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:18,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36553542] [2019-11-27 23:55:18,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:18,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:18,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:18,068 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 3 states. [2019-11-27 23:55:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:18,097 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-27 23:55:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:18,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-27 23:55:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:18,098 INFO L225 Difference]: With dead ends: 110 [2019-11-27 23:55:18,098 INFO L226 Difference]: Without dead ends: 98 [2019-11-27 23:55:18,099 INFO L630 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 [2019-11-27 23:55:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-27 23:55:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-11-27 23:55:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-27 23:55:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-27 23:55:18,105 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2019-11-27 23:55:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:18,106 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-27 23:55:18,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-27 23:55:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 23:55:18,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:18,107 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:18,108 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2019-11-27 23:55:18,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:18,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578799945] [2019-11-27 23:55:18,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:18,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578799945] [2019-11-27 23:55:18,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576033076] [2019-11-27 23:55:18,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:18,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-27 23:55:18,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:18,557 INFO L377 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 [2019-11-27 23:55:18,558 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,563 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,563 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:18,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:55:18,590 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,639 INFO L588 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-27 23:55:18,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:18,645 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,661 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:18,667 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,681 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,681 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,682 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-27 23:55:18,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:18,727 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:18,728 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,749 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:18,754 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:18,754 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,774 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,775 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,775 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-27 23:55:18,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:18,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-27 23:55:18,859 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:18,961 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-27 23:55:18,962 INFO L588 ElimStorePlain]: treesize reduction 40, result has 80.2 percent of original size [2019-11-27 23:55:18,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-27 23:55:18,968 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,018 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:19,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:19,058 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 108 [2019-11-27 23:55:19,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,063 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,167 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-27 23:55:19,168 INFO L588 ElimStorePlain]: treesize reduction 481, result has 15.8 percent of original size [2019-11-27 23:55:19,169 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,169 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:156, output treesize:79 [2019-11-27 23:55:19,267 INFO L404 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_$Pointer$.base_50|]} [2019-11-27 23:55:19,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:19,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:19,284 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,311 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:19,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:19,365 INFO L343 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-27 23:55:19,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 78 [2019-11-27 23:55:19,366 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,438 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.3 percent of original size [2019-11-27 23:55:19,438 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:76 [2019-11-27 23:55:19,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:19,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-27 23:55:19,482 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,526 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:19,527 INFO L404 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_39|], 18=[|v_#memory_$Pointer$.base_51|]} [2019-11-27 23:55:19,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 36 [2019-11-27 23:55:19,535 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:19,577 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:19,778 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-27 23:55:19,779 INFO L343 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-27 23:55:19,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 184 [2019-11-27 23:55:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:19,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:19,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:20,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:20,067 INFO L508 ElimStorePlain]: Start of recursive call 4: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:20,941 WARN L192 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 577 DAG size of output: 44 [2019-11-27 23:55:20,941 INFO L588 ElimStorePlain]: treesize reduction 18185, result has 0.7 percent of original size [2019-11-27 23:55:20,942 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:20,943 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:236, output treesize:109 [2019-11-27 23:55:21,001 INFO L404 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_40|], 20=[|v_#memory_$Pointer$.base_52|]} [2019-11-27 23:55:21,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:21,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 33 [2019-11-27 23:55:21,014 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:21,045 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:21,265 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-27 23:55:21,266 INFO L343 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-27 23:55:21,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 229 [2019-11-27 23:55:21,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:21,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:21,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:21,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:21,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:21,281 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-11-27 23:55:21,434 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-11-27 23:55:21,435 INFO L588 ElimStorePlain]: treesize reduction 3649, result has 4.0 percent of original size [2019-11-27 23:55:21,436 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:21,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:264, output treesize:154 [2019-11-27 23:55:21,501 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-11-27 23:55:21,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2019-11-27 23:55:21,506 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:21,524 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:21,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:21,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 116 [2019-11-27 23:55:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:21,573 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:21,583 INFO L588 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-11-27 23:55:21,583 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:21,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:169, output treesize:4 [2019-11-27 23:55:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:21,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:21,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-27 23:55:21,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79310820] [2019-11-27 23:55:21,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-27 23:55:21,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:21,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-27 23:55:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-11-27 23:55:21,609 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2019-11-27 23:55:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:22,543 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-27 23:55:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 23:55:22,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-11-27 23:55:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:22,544 INFO L225 Difference]: With dead ends: 131 [2019-11-27 23:55:22,545 INFO L226 Difference]: Without dead ends: 129 [2019-11-27 23:55:22,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-11-27 23:55:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-27 23:55:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-11-27 23:55:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-27 23:55:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-11-27 23:55:22,553 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 41 [2019-11-27 23:55:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:22,553 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-11-27 23:55:22,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-27 23:55:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-11-27 23:55:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 23:55:22,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:22,554 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:22,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:22,755 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1699655007, now seen corresponding path program 1 times [2019-11-27 23:55:22,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:22,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031762985] [2019-11-27 23:55:22,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:23,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031762985] [2019-11-27 23:55:23,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902401490] [2019-11-27 23:55:23,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:23,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-27 23:55:23,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:23,154 INFO L377 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 [2019-11-27 23:55:23,155 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,159 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,159 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:55:23,184 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:55:23,185 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,233 INFO L588 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-27 23:55:23,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:23,240 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,263 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-27 23:55:23,268 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,288 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,288 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,288 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-27 23:55:23,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:23,334 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:23,334 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,354 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:23,359 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:23,359 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,373 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,374 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-27 23:55:23,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-27 23:55:23,421 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,531 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-27 23:55:23,532 INFO L588 ElimStorePlain]: treesize reduction 40, result has 79.8 percent of original size [2019-11-27 23:55:23,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-27 23:55:23,540 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,574 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,617 INFO L377 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 4 case distinctions, treesize of input 91 treesize of output 100 [2019-11-27 23:55:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:23,623 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,707 INFO L588 ElimStorePlain]: treesize reduction 256, result has 25.1 percent of original size [2019-11-27 23:55:23,708 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,708 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:152, output treesize:86 [2019-11-27 23:55:23,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:23,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,808 INFO L377 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 2 case distinctions, treesize of input 74 treesize of output 71 [2019-11-27 23:55:23,809 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,899 INFO L588 ElimStorePlain]: treesize reduction 52, result has 66.9 percent of original size [2019-11-27 23:55:23,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:23,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-27 23:55:23,910 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,939 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,939 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:23,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2019-11-27 23:55:23,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:23,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-27 23:55:23,981 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:24,029 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:24,160 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-27 23:55:24,160 INFO L343 Elim1Store]: treesize reduction 19, result has 87.2 percent of original size [2019-11-27 23:55:24,161 INFO L377 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 216 treesize of output 206 [2019-11-27 23:55:24,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,245 INFO L508 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:24,345 INFO L588 ElimStorePlain]: treesize reduction 111, result has 47.6 percent of original size [2019-11-27 23:55:24,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:24,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-11-27 23:55:24,352 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:24,381 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:24,381 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:24,382 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:239, output treesize:96 [2019-11-27 23:55:24,428 INFO L404 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_46|], 19=[|v_#memory_$Pointer$.base_58|]} [2019-11-27 23:55:24,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:24,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2019-11-27 23:55:24,435 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:24,465 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:24,648 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-27 23:55:24,649 INFO L343 Elim1Store]: treesize reduction 62, result has 72.4 percent of original size [2019-11-27 23:55:24,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 201 treesize of output 228 [2019-11-27 23:55:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:24,669 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-27 23:55:24,832 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-27 23:55:24,832 INFO L588 ElimStorePlain]: treesize reduction 3627, result has 4.0 percent of original size [2019-11-27 23:55:24,833 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:24,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:263, output treesize:153 [2019-11-27 23:55:24,904 INFO L404 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 29=[|#memory_$Pointer$.base|]} [2019-11-27 23:55:24,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:24,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2019-11-27 23:55:24,915 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:24,964 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:25,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:25,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 108 [2019-11-27 23:55:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:55:25,016 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:25,039 INFO L588 ElimStorePlain]: treesize reduction 261, result has 3.3 percent of original size [2019-11-27 23:55:25,040 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:25,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:184, output treesize:4 [2019-11-27 23:55:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:25,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:25,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-27 23:55:25,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551273521] [2019-11-27 23:55:25,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:55:25,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:55:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:55:25,068 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 16 states. [2019-11-27 23:55:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:25,837 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-27 23:55:25,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:55:25,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-27 23:55:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:25,838 INFO L225 Difference]: With dead ends: 129 [2019-11-27 23:55:25,839 INFO L226 Difference]: Without dead ends: 127 [2019-11-27 23:55:25,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-11-27 23:55:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-27 23:55:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-11-27 23:55:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-27 23:55:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-11-27 23:55:25,850 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 44 [2019-11-27 23:55:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:25,851 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-11-27 23:55:25,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:55:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-11-27 23:55:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 23:55:25,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:25,852 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-11-27 23:55:26,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:26,055 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1057023877, now seen corresponding path program 1 times [2019-11-27 23:55:26,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:26,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347246778] [2019-11-27 23:55:26,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:55:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:55:26,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:55:26,154 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:55:26,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:55:26 BoogieIcfgContainer [2019-11-27 23:55:26,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:55:26,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:55:26,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:55:26,225 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:55:26,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:02" (3/4) ... [2019-11-27 23:55:26,228 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:55:26,301 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:55:26,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:55:26,304 INFO L168 Benchmark]: Toolchain (without parser) took 25558.62 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 327.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:26,304 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:55:26,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:26,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:26,305 INFO L168 Benchmark]: Boogie Preprocessor took 44.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:55:26,310 INFO L168 Benchmark]: RCFGBuilder took 592.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:26,310 INFO L168 Benchmark]: TraceAbstraction took 24138.88 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.1 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:26,311 INFO L168 Benchmark]: Witness Printer took 76.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:55:26,319 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 592.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24138.88 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.1 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. * Witness Printer took 76.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND FALSE !(status == 1) [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) [L1018] COND FALSE !(status == 1) [L1023] COND FALSE !(status == 2) [L1029] COND TRUE status == 3 [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] EXPR head->next [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 14 error locations. Result: UNSAFE, OverallTime: 24.0s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1403 SDtfs, 1526 SDslu, 4780 SDs, 0 SdLazy, 2816 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 298 SyntacticMatches, 13 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 360 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 824 ConstructedInterpolants, 141 QuantifiedInterpolants, 982205 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1117 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 87/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...