java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rew.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:39:31,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:39:31,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:39:31,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:39:31,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:39:31,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:39:31,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:39:31,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:39:31,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:39:31,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:39:31,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:39:31,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:39:31,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:39:31,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:39:31,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:39:31,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:39:31,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:39:31,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:39:31,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:39:31,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:39:31,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:39:31,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:39:31,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:39:31,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:39:31,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:39:31,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:39:31,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:39:31,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:39:31,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:39:31,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:39:31,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:39:31,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:39:31,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:39:31,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:39:31,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:39:31,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:39:31,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:39:31,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:39:31,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:39:31,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:39:31,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:39:31,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:39:31,405 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:39:31,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:39:31,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:39:31,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:39:31,409 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:39:31,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:39:31,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:39:31,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:39:31,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:39:31,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:39:31,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:39:31,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:39:31,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:39:31,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:39:31,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:39:31,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:39:31,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:39:31,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:39:31,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:39:31,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:39:31,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:39:31,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:39:31,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:39:31,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:39:31,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:39:31,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:39:31,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:39:31,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:39:31,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:39:31,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:39:31,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:39:31,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:39:31,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:39:31,477 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:39:31,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rew.c [2019-10-02 00:39:31,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82167cfff/f2f1e188ce944329987a05b583a85f9c/FLAGe004acf57 [2019-10-02 00:39:31,951 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:39:31,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rew.c [2019-10-02 00:39:31,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82167cfff/f2f1e188ce944329987a05b583a85f9c/FLAGe004acf57 [2019-10-02 00:39:32,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82167cfff/f2f1e188ce944329987a05b583a85f9c [2019-10-02 00:39:32,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:39:32,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:39:32,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:39:32,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:39:32,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:39:32,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641eaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32, skipping insertion in model container [2019-10-02 00:39:32,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,384 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:39:32,402 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:39:32,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:39:32,627 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:39:32,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:39:32,769 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:39:32,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32 WrapperNode [2019-10-02 00:39:32,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:39:32,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:39:32,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:39:32,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:39:32,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (1/1) ... [2019-10-02 00:39:32,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:39:32,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:39:32,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:39:32,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:39:32,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (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-10-02 00:39:32,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:39:32,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:39:32,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:39:32,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:39:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:39:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:39:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:39:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:39:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 00:39:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:39:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 00:39:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:39:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:39:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:39:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:39:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:39:33,152 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:39:33,152 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 00:39:33,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:39:33 BoogieIcfgContainer [2019-10-02 00:39:33,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:39:33,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:39:33,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:39:33,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:39:33,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:39:32" (1/3) ... [2019-10-02 00:39:33,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673dedd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:39:33, skipping insertion in model container [2019-10-02 00:39:33,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:32" (2/3) ... [2019-10-02 00:39:33,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673dedd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:39:33, skipping insertion in model container [2019-10-02 00:39:33,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:39:33" (3/3) ... [2019-10-02 00:39:33,161 INFO L109 eAbstractionObserver]: Analyzing ICFG rew.c [2019-10-02 00:39:33,170 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:39:33,175 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:39:33,190 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:39:33,214 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:39:33,215 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:39:33,215 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:39:33,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:39:33,215 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:39:33,215 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:39:33,216 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:39:33,216 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:39:33,216 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:39:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-02 00:39:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 00:39:33,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:33,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:33,238 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-10-02 00:39:33,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:33,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 00:39:33,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 00:39:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 00:39:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:39:33,392 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-02 00:39:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:33,410 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-02 00:39:33,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 00:39:33,411 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-02 00:39:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:33,418 INFO L225 Difference]: With dead ends: 43 [2019-10-02 00:39:33,418 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 00:39:33,421 INFO L640 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-10-02 00:39:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 00:39:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-02 00:39:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 00:39:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-02 00:39:33,453 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-02 00:39:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:33,453 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-02 00:39:33,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 00:39:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-02 00:39:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 00:39:33,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:33,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:33,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-10-02 00:39:33,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:33,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:33,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:33,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:39:33,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:39:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:39:33,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:39:33,573 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-10-02 00:39:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:33,668 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-02 00:39:33,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:39:33,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 00:39:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:33,671 INFO L225 Difference]: With dead ends: 41 [2019-10-02 00:39:33,671 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 00:39:33,672 INFO L640 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-10-02 00:39:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 00:39:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-02 00:39:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-02 00:39:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-02 00:39:33,684 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-02 00:39:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:33,685 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-02 00:39:33,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:39:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-02 00:39:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 00:39:33,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:33,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:33,687 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:33,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-10-02 00:39:33,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:33,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:33,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:33,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:33,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:39:33,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:39:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:39:33,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:39:33,816 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-10-02 00:39:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:33,890 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-02 00:39:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:39:33,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-02 00:39:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:33,892 INFO L225 Difference]: With dead ends: 38 [2019-10-02 00:39:33,892 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 00:39:33,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:39:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 00:39:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 00:39:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 00:39:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-02 00:39:33,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-02 00:39:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:33,904 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-02 00:39:33,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:39:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-02 00:39:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 00:39:33,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:33,906 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:33,907 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-10-02 00:39:33,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:33,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:34,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:34,272 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:39:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:34,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 00:39:34,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:34,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:39:34,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:34,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:34,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:34,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 00:39:34,538 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-10-02 00:39:34,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2019-10-02 00:39:34,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:34,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:34,551 INFO L496 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-10-02 00:39:34,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:33 [2019-10-02 00:39:34,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:34,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2019-10-02 00:39:34,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:34,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:34,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:34,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:7 [2019-10-02 00:39:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:34,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-02 00:39:34,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 00:39:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 00:39:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:39:34,747 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2019-10-02 00:39:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:36,014 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-10-02 00:39:36,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 00:39:36,015 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-02 00:39:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:36,016 INFO L225 Difference]: With dead ends: 42 [2019-10-02 00:39:36,016 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 00:39:36,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:39:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 00:39:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-02 00:39:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 00:39:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-02 00:39:36,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-02 00:39:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:36,027 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-02 00:39:36,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 00:39:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-02 00:39:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 00:39:36,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:36,029 INFO L411 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] [2019-10-02 00:39:36,029 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-10-02 00:39:36,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:36,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:36,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:36,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:36,262 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:39:36,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:36,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:39:36,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:36,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 00:39:36,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:36,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:36,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:36,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:39:36,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:39:36,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:36,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:36,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:36,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:39:36,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:36,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:36,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-10-02 00:39:36,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:39:36,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:39:36,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:39:36,636 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 22 states. [2019-10-02 00:39:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:49,285 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-10-02 00:39:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 00:39:49,287 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-10-02 00:39:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:49,292 INFO L225 Difference]: With dead ends: 74 [2019-10-02 00:39:49,292 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 00:39:49,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:39:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 00:39:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-10-02 00:39:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 00:39:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-02 00:39:49,306 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2019-10-02 00:39:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:49,307 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-02 00:39:49,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:39:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-02 00:39:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 00:39:49,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:49,308 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:49,309 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 515182859, now seen corresponding path program 2 times [2019-10-02 00:39:49,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:49,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:49,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:49,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:49,473 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:49,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:39:49,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:39:49,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:49,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 00:39:49,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:49,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:39:49,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:49,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:49,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:49,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-02 00:39:49,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:39:49,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-10-02 00:39:49,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:49,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:49,669 INFO L496 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-10-02 00:39:49,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-10-02 00:39:49,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:39:49,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:49,891 INFO L375 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 1 case distinctions, treesize of input 30 treesize of output 10 [2019-10-02 00:39:49,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:49,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:49,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:49,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-10-02 00:39:49,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:39:49,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-10-02 00:39:49,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 00:39:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 00:39:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:39:49,973 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 25 states. [2019-10-02 00:40:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:00,971 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-10-02 00:40:00,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:40:00,971 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-10-02 00:40:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:00,974 INFO L225 Difference]: With dead ends: 84 [2019-10-02 00:40:00,974 INFO L226 Difference]: Without dead ends: 82 [2019-10-02 00:40:00,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 00:40:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-02 00:40:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 41. [2019-10-02 00:40:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 00:40:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-02 00:40:00,986 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2019-10-02 00:40:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:00,986 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-02 00:40:00,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 00:40:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-02 00:40:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 00:40:00,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:00,988 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:00,988 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash 783487204, now seen corresponding path program 3 times [2019-10-02 00:40:00,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:00,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:40:01,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:01,053 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:01,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:40:01,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 00:40:01,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:01,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 00:40:01,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:40:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:01,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-10-02 00:40:01,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 00:40:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 00:40:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-10-02 00:40:01,166 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2019-10-02 00:40:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:01,346 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2019-10-02 00:40:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 00:40:01,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-10-02 00:40:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:01,350 INFO L225 Difference]: With dead ends: 102 [2019-10-02 00:40:01,350 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 00:40:01,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:40:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 00:40:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-10-02 00:40:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 00:40:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-10-02 00:40:01,364 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2019-10-02 00:40:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:01,368 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-10-02 00:40:01,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 00:40:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-10-02 00:40:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 00:40:01,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:01,370 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:01,371 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1309226143, now seen corresponding path program 4 times [2019-10-02 00:40:01,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:01,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:01,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:40:01,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:01,581 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:01,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:40:01,631 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:40:01,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:01,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 00:40:01,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:01,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 00:40:01,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:01,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:01,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:01,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:40:01,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:40:02,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:02,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:02,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:02,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:40:02,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 00:40:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-10-02 00:40:02,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:40:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:40:02,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:40:02,087 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2019-10-02 00:40:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:17,838 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-10-02 00:40:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:40:17,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-02 00:40:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:17,843 INFO L225 Difference]: With dead ends: 94 [2019-10-02 00:40:17,843 INFO L226 Difference]: Without dead ends: 92 [2019-10-02 00:40:17,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:40:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-02 00:40:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2019-10-02 00:40:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 00:40:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-02 00:40:17,855 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 42 [2019-10-02 00:40:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:17,856 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-02 00:40:17,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:40:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-02 00:40:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 00:40:17,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:17,857 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:17,857 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -908000550, now seen corresponding path program 5 times [2019-10-02 00:40:17,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:17,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:17,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:17,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:40:18,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:18,054 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:40:18,129 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 00:40:18,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:18,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 00:40:18,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:18,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:40:18,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:18,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:18,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:18,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-02 00:40:18,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:18,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-10-02 00:40:18,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:18,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:18,288 INFO L496 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-10-02 00:40:18,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2019-10-02 00:40:19,137 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 00:40:19,983 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 00:40:20,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:20,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:20,731 INFO L375 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 1 case distinctions, treesize of input 28 treesize of output 10 [2019-10-02 00:40:20,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:20,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:20,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:20,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-10-02 00:40:20,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 00:40:20,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:20,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-10-02 00:40:20,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 00:40:20,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 00:40:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=716, Unknown=3, NotChecked=0, Total=812 [2019-10-02 00:40:20,831 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 29 states. [2019-10-02 00:40:35,586 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-10-02 00:40:36,563 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-10-02 00:40:40,721 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-10-02 00:40:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:44,633 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2019-10-02 00:40:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:40:44,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2019-10-02 00:40:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:44,635 INFO L225 Difference]: With dead ends: 92 [2019-10-02 00:40:44,635 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 00:40:44,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=191, Invalid=1445, Unknown=4, NotChecked=0, Total=1640 [2019-10-02 00:40:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 00:40:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2019-10-02 00:40:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 00:40:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-10-02 00:40:44,647 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 46 [2019-10-02 00:40:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:44,648 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-10-02 00:40:44,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 00:40:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-10-02 00:40:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 00:40:44,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:44,649 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:44,649 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -65371085, now seen corresponding path program 6 times [2019-10-02 00:40:44,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:44,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:40:44,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:44,726 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:40:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:44,776 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-02 00:40:44,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:44,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 00:40:44,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:40:44,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:44,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-10-02 00:40:44,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 00:40:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 00:40:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:40:44,851 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 15 states. [2019-10-02 00:40:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:45,049 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-10-02 00:40:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 00:40:45,050 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-10-02 00:40:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:45,051 INFO L225 Difference]: With dead ends: 100 [2019-10-02 00:40:45,051 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 00:40:45,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-10-02 00:40:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 00:40:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-10-02 00:40:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 00:40:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-10-02 00:40:45,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2019-10-02 00:40:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:45,062 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-10-02 00:40:45,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 00:40:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-10-02 00:40:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 00:40:45,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:45,064 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:45,064 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash -301340818, now seen corresponding path program 7 times [2019-10-02 00:40:45,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:45,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:45,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:40:45,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:45,256 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:45,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:45,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 00:40:45,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:45,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 00:40:45,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:45,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:45,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:45,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:40:45,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:40:45,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:45,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:45,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:45,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:40:45,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 00:40:45,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:45,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2019-10-02 00:40:45,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:40:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:40:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:40:45,800 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 30 states. [2019-10-02 00:41:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:03,870 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2019-10-02 00:41:03,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:41:03,871 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-10-02 00:41:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:03,872 INFO L225 Difference]: With dead ends: 114 [2019-10-02 00:41:03,872 INFO L226 Difference]: Without dead ends: 112 [2019-10-02 00:41:03,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 00:41:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-02 00:41:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 73. [2019-10-02 00:41:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 00:41:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-10-02 00:41:03,887 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 54 [2019-10-02 00:41:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:03,887 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-10-02 00:41:03,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:41:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-10-02 00:41:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 00:41:03,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:03,892 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:03,892 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash -959498967, now seen corresponding path program 8 times [2019-10-02 00:41:03,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:03,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:41:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:41:04,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:04,215 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:04,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:41:04,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:41:04,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:04,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 00:41:04,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:04,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:41:04,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:04,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:04,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:04,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-02 00:41:04,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:04,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-10-02 00:41:04,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:04,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:04,503 INFO L496 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-10-02 00:41:04,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-10-02 00:41:05,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:05,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:05,436 INFO L375 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 1 case distinctions, treesize of input 30 treesize of output 10 [2019-10-02 00:41:05,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:05,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:05,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:05,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-10-02 00:41:05,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 00:41:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-10-02 00:41:05,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 00:41:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 00:41:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:41:05,539 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 33 states. [2019-10-02 00:41:22,183 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-10-02 00:41:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:32,037 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2019-10-02 00:41:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 00:41:32,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2019-10-02 00:41:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:32,041 INFO L225 Difference]: With dead ends: 149 [2019-10-02 00:41:32,041 INFO L226 Difference]: Without dead ends: 147 [2019-10-02 00:41:32,042 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=262, Invalid=2185, Unknown=3, NotChecked=0, Total=2450 [2019-10-02 00:41:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-02 00:41:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 77. [2019-10-02 00:41:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 00:41:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-10-02 00:41:32,059 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 58 [2019-10-02 00:41:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:32,060 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-10-02 00:41:32,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 00:41:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-10-02 00:41:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 00:41:32,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:32,062 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:32,062 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash 345962498, now seen corresponding path program 9 times [2019-10-02 00:41:32,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:32,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:32,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:32,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:32,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:41:32,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:32,160 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:32,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:41:32,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 00:41:32,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:32,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 00:41:32,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:41:32,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:32,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2019-10-02 00:41:32,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 00:41:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 00:41:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:41:32,393 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 18 states. [2019-10-02 00:41:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:32,698 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2019-10-02 00:41:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 00:41:32,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2019-10-02 00:41:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:32,700 INFO L225 Difference]: With dead ends: 140 [2019-10-02 00:41:32,700 INFO L226 Difference]: Without dead ends: 93 [2019-10-02 00:41:32,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:41:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-02 00:41:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2019-10-02 00:41:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 00:41:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-02 00:41:32,734 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 62 [2019-10-02 00:41:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:32,734 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-02 00:41:32,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 00:41:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-02 00:41:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 00:41:32,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:32,736 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:32,738 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash -59691676, now seen corresponding path program 10 times [2019-10-02 00:41:32,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:32,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:32,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:41:32,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:32,996 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:33,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:41:33,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:41:33,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:33,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 00:41:33,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:33,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:41:33,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:33,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 00:41:33,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:33,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-10-02 00:41:33,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,261 INFO L567 ElimStorePlain]: treesize reduction 32, result has 49.2 percent of original size [2019-10-02 00:41:33,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:41:33,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:33,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-10-02 00:41:33,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,304 INFO L567 ElimStorePlain]: treesize reduction 30, result has 50.0 percent of original size [2019-10-02 00:41:33,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-10-02 00:41:33,387 INFO L341 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2019-10-02 00:41:33,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2019-10-02 00:41:33,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:33,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:33,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-10-02 00:41:51,731 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-10-02 00:41:51,732 INFO L375 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2019-10-02 00:41:51,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:51,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:51,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:51,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:7 [2019-10-02 00:41:51,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 00:41:51,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:51,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-10-02 00:41:51,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 00:41:51,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 00:41:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1131, Unknown=3, NotChecked=0, Total=1260 [2019-10-02 00:41:51,848 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 36 states. [2019-10-02 00:43:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:09,728 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2019-10-02 00:43:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 00:43:09,728 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2019-10-02 00:43:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:09,729 INFO L225 Difference]: With dead ends: 173 [2019-10-02 00:43:09,730 INFO L226 Difference]: Without dead ends: 171 [2019-10-02 00:43:09,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=386, Invalid=3513, Unknown=7, NotChecked=0, Total=3906 [2019-10-02 00:43:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-02 00:43:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2019-10-02 00:43:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-02 00:43:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2019-10-02 00:43:09,755 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 62 [2019-10-02 00:43:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:09,755 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2019-10-02 00:43:09,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 00:43:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2019-10-02 00:43:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 00:43:09,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:09,758 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:09,758 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1002724029, now seen corresponding path program 11 times [2019-10-02 00:43:09,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:09,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:09,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:09,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:09,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:43:10,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:10,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:43:10,147 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 00:43:10,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:10,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 00:43:10,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:10,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 00:43:10,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:10,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:10,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:10,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-10-02 00:43:10,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:43:10,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:10,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:10,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:10,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 00:43:10,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 3 proven. 91 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 00:43:10,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:10,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2019-10-02 00:43:10,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:43:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:43:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:43:10,840 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 34 states. [2019-10-02 00:43:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:25,839 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2019-10-02 00:43:25,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 00:43:25,839 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-10-02 00:43:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:25,841 INFO L225 Difference]: With dead ends: 180 [2019-10-02 00:43:25,841 INFO L226 Difference]: Without dead ends: 178 [2019-10-02 00:43:25,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=1640, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 00:43:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-02 00:43:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2019-10-02 00:43:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 00:43:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2019-10-02 00:43:25,872 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 66 [2019-10-02 00:43:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:25,872 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2019-10-02 00:43:25,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:43:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2019-10-02 00:43:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 00:43:25,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:25,874 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:25,874 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2024493999, now seen corresponding path program 12 times [2019-10-02 00:43:25,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:25,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 62 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:43:25,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:25,975 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:43:26,045 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 00:43:26,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:26,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 00:43:26,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:43:26,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:26,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2019-10-02 00:43:26,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 00:43:26,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 00:43:26,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:43:26,172 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 21 states. [2019-10-02 00:43:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:26,467 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2019-10-02 00:43:26,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 00:43:26,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-10-02 00:43:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:26,469 INFO L225 Difference]: With dead ends: 184 [2019-10-02 00:43:26,469 INFO L226 Difference]: Without dead ends: 129 [2019-10-02 00:43:26,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2019-10-02 00:43:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-02 00:43:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2019-10-02 00:43:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-02 00:43:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-10-02 00:43:26,484 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 74 [2019-10-02 00:43:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:26,484 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-10-02 00:43:26,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 00:43:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-10-02 00:43:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 00:43:26,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:26,486 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:26,486 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1680638446, now seen corresponding path program 13 times [2019-10-02 00:43:26,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:26,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:26,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 12 proven. 148 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:43:26,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:26,856 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:26,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:43:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:26,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 00:43:26,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:27,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:43:27,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:27,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 00:43:27,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:27,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-10-02 00:43:27,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,180 INFO L567 ElimStorePlain]: treesize reduction 32, result has 49.2 percent of original size [2019-10-02 00:43:27,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:27,258 INFO L341 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2019-10-02 00:43:27,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 69 [2019-10-02 00:43:27,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,295 INFO L567 ElimStorePlain]: treesize reduction 30, result has 58.3 percent of original size [2019-10-02 00:43:27,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-10-02 00:43:27,450 INFO L341 Elim1Store]: treesize reduction 68, result has 57.5 percent of original size [2019-10-02 00:43:27,451 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 110 [2019-10-02 00:43:27,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,490 INFO L567 ElimStorePlain]: treesize reduction 82, result has 35.9 percent of original size [2019-10-02 00:43:27,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-10-02 00:43:27,671 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-10-02 00:43:27,672 INFO L341 Elim1Store]: treesize reduction 120, result has 52.0 percent of original size [2019-10-02 00:43:27,672 INFO L375 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 150 [2019-10-02 00:43:27,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,728 INFO L567 ElimStorePlain]: treesize reduction 110, result has 25.2 percent of original size [2019-10-02 00:43:27,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:37 [2019-10-02 00:43:27,927 INFO L341 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2019-10-02 00:43:27,928 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 46 [2019-10-02 00:43:27,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:27,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:27,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2019-10-02 00:44:09,407 INFO L341 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-10-02 00:44:09,408 INFO L375 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 16 [2019-10-02 00:44:09,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:09,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:09,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:09,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:7 [2019-10-02 00:44:09,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 00:44:09,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:09,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2019-10-02 00:44:09,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 00:44:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 00:44:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1802, Unknown=4, NotChecked=0, Total=1980 [2019-10-02 00:44:09,568 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 45 states. [2019-10-02 00:46:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:46:11,171 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2019-10-02 00:46:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 00:46:11,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 78 [2019-10-02 00:46:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:46:11,174 INFO L225 Difference]: With dead ends: 247 [2019-10-02 00:46:11,174 INFO L226 Difference]: Without dead ends: 245 [2019-10-02 00:46:11,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 12 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=519, Invalid=5789, Unknown=12, NotChecked=0, Total=6320 [2019-10-02 00:46:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-02 00:46:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 197. [2019-10-02 00:46:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-02 00:46:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 206 transitions. [2019-10-02 00:46:11,205 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 206 transitions. Word has length 78 [2019-10-02 00:46:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:46:11,206 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 206 transitions. [2019-10-02 00:46:11,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 00:46:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2019-10-02 00:46:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 00:46:11,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:46:11,207 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:46:11,207 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:46:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:46:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2047876832, now seen corresponding path program 14 times [2019-10-02 00:46:11,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:46:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:46:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:46:11,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:46:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:46:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:46:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 63 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:46:11,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:46:11,352 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:46:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:46:11,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:46:11,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:46:11,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 00:46:11,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:46:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 84 proven. 66 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:46:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:46:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2019-10-02 00:46:11,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 00:46:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 00:46:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:46:11,630 INFO L87 Difference]: Start difference. First operand 197 states and 206 transitions. Second operand 24 states. [2019-10-02 00:46:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:46:12,008 INFO L93 Difference]: Finished difference Result 262 states and 273 transitions. [2019-10-02 00:46:12,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:46:12,008 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2019-10-02 00:46:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:46:12,010 INFO L225 Difference]: With dead ends: 262 [2019-10-02 00:46:12,010 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 00:46:12,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2019-10-02 00:46:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 00:46:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2019-10-02 00:46:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-02 00:46:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2019-10-02 00:46:12,036 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 86 [2019-10-02 00:46:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:46:12,036 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2019-10-02 00:46:12,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 00:46:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2019-10-02 00:46:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 00:46:12,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:46:12,038 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:46:12,038 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:46:12,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:46:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash -623410469, now seen corresponding path program 15 times [2019-10-02 00:46:12,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:46:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:46:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:46:12,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:46:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:46:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:46:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 12 proven. 163 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:46:12,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:46:12,391 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:46:12,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:46:12,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 00:46:12,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:46:12,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 00:46:12,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:46:12,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:46:12,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:46:12,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:46:12,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:46:12,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2019-10-02 00:46:16,936 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-02 00:46:24,417 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-10-02 00:46:28,488 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-10-02 00:46:34,758 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-10-02 00:46:46,937 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-10-02 00:46:51,441 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-10-02 00:47:00,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:00,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:47:00,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:00,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:47:00,363 INFO L567 ElimStorePlain]: treesize reduction 13, result has 55.2 percent of original size [2019-10-02 00:47:00,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:00,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2019-10-02 00:47:00,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 78 proven. 109 refuted. 24 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:47:00,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:00,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2019-10-02 00:47:00,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 00:47:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 00:47:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1857, Unknown=6, NotChecked=0, Total=2070 [2019-10-02 00:47:00,516 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 46 states. [2019-10-02 00:47:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:07,993 INFO L93 Difference]: Finished difference Result 211 states and 219 transitions. [2019-10-02 00:47:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 00:47:07,994 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-10-02 00:47:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:07,995 INFO L225 Difference]: With dead ends: 211 [2019-10-02 00:47:07,995 INFO L226 Difference]: Without dead ends: 152 [2019-10-02 00:47:07,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=535, Invalid=5009, Unknown=6, NotChecked=0, Total=5550 [2019-10-02 00:47:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-02 00:47:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-10-02 00:47:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 00:47:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2019-10-02 00:47:08,019 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 90 [2019-10-02 00:47:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:08,019 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2019-10-02 00:47:08,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 00:47:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2019-10-02 00:47:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 00:47:08,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:08,020 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:47:08,021 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1528889464, now seen corresponding path program 16 times [2019-10-02 00:47:08,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:08,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:47:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 22 proven. 228 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:47:08,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:08,575 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:47:08,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:47:08,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:47:08,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:47:08,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 00:47:08,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:08,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:47:08,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:08,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:08,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:08,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 00:47:09,001 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:47:09,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:47:09,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:09,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-02 00:47:09,086 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-10-02 00:47:09,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2019-10-02 00:47:09,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:09,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-10-02 00:47:09,260 INFO L341 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2019-10-02 00:47:09,261 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-10-02 00:47:09,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:09,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2019-10-02 00:47:09,386 INFO L341 Elim1Store]: treesize reduction 222, result has 14.3 percent of original size [2019-10-02 00:47:09,386 INFO L375 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 60 [2019-10-02 00:47:09,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:09,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:57 [2019-10-02 00:47:09,644 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-10-02 00:47:09,645 INFO L341 Elim1Store]: treesize reduction 104, result has 56.1 percent of original size [2019-10-02 00:47:09,645 INFO L375 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 154 [2019-10-02 00:47:09,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,710 INFO L567 ElimStorePlain]: treesize reduction 123, result has 30.9 percent of original size [2019-10-02 00:47:09,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:09,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2019-10-02 00:47:09,936 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2019-10-02 00:47:09,936 INFO L341 Elim1Store]: treesize reduction 171, result has 49.7 percent of original size [2019-10-02 00:47:09,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 192 [2019-10-02 00:47:09,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:10,010 INFO L567 ElimStorePlain]: treesize reduction 138, result has 25.8 percent of original size [2019-10-02 00:47:10,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:10,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:48 [2019-10-02 00:47:10,186 INFO L341 Elim1Store]: treesize reduction 176, result has 17.4 percent of original size [2019-10-02 00:47:10,187 INFO L375 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 58 [2019-10-02 00:47:10,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:10,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:10,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:10,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-02 00:48:56,880 INFO L341 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2019-10-02 00:48:56,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 19 [2019-10-02 00:48:56,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:48:56,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:48:56,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:56,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:82, output treesize:7 [2019-10-02 00:48:56,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:48:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 262 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 00:48:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:48:57,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 32] total 53 [2019-10-02 00:48:57,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 00:48:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 00:48:57,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2526, Unknown=9, NotChecked=0, Total=2756 [2019-10-02 00:48:57,064 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 53 states. [2019-10-02 00:51:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:51:38,130 INFO L93 Difference]: Finished difference Result 295 states and 316 transitions. [2019-10-02 00:51:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-02 00:51:38,130 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 94 [2019-10-02 00:51:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:51:38,133 INFO L225 Difference]: With dead ends: 295 [2019-10-02 00:51:38,133 INFO L226 Difference]: Without dead ends: 293 [2019-10-02 00:51:38,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 57 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2836 ImplicationChecksByTransitivity, 123.0s TimeCoverageRelationStatistics Valid=636, Invalid=8091, Unknown=15, NotChecked=0, Total=8742 [2019-10-02 00:51:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-02 00:51:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2019-10-02 00:51:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-02 00:51:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 248 transitions. [2019-10-02 00:51:38,171 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 248 transitions. Word has length 94 [2019-10-02 00:51:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:51:38,171 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 248 transitions. [2019-10-02 00:51:38,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 00:51:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 248 transitions. [2019-10-02 00:51:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 00:51:38,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:51:38,173 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:51:38,173 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:51:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:51:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash -87569346, now seen corresponding path program 17 times [2019-10-02 00:51:38,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:51:38,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:51:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:51:38,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:51:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:51:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:51:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 115 proven. 149 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:51:38,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:51:38,380 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:51:38,447 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:51:38,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-02 00:51:38,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:51:38,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 00:51:38,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:51:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 144 proven. 120 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:51:38,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:51:38,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2019-10-02 00:51:38,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:51:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:51:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:51:38,778 INFO L87 Difference]: Start difference. First operand 237 states and 248 transitions. Second operand 30 states. [2019-10-02 00:51:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:51:39,323 INFO L93 Difference]: Finished difference Result 318 states and 333 transitions. [2019-10-02 00:51:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 00:51:39,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 110 [2019-10-02 00:51:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:51:39,331 INFO L225 Difference]: With dead ends: 318 [2019-10-02 00:51:39,331 INFO L226 Difference]: Without dead ends: 247 [2019-10-02 00:51:39,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 00:51:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-02 00:51:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 237. [2019-10-02 00:51:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-02 00:51:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 247 transitions. [2019-10-02 00:51:39,375 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 247 transitions. Word has length 110 [2019-10-02 00:51:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:51:39,376 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 247 transitions. [2019-10-02 00:51:39,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:51:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 247 transitions. [2019-10-02 00:51:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 00:51:39,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:51:39,379 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:51:39,379 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:51:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:51:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1654871806, now seen corresponding path program 18 times [2019-10-02 00:51:39,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:51:39,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:51:39,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:51:39,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:51:39,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:51:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:51:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 324 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:51:40,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:51:40,443 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:51:40,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:51:40,837 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 00:51:40,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:51:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-02 00:51:40,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:51:41,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-10-02 00:51:41,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-02 00:51:41,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:51:41,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-02 00:51:41,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,256 INFO L375 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 1 case distinctions, treesize of input 37 treesize of output 39 [2019-10-02 00:51:41,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-10-02 00:51:41,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,401 INFO L375 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 3 case distinctions, treesize of input 44 treesize of output 49 [2019-10-02 00:51:41,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-02 00:51:41,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 93 [2019-10-02 00:51:41,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,566 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.5 percent of original size [2019-10-02 00:51:41,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:73 [2019-10-02 00:51:41,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:41,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:41,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:41,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 109 [2019-10-02 00:51:41,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:41,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:41,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 73 [2019-10-02 00:51:41,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:42,066 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-02 00:51:42,066 INFO L567 ElimStorePlain]: treesize reduction 28, result has 83.5 percent of original size [2019-10-02 00:51:42,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-02 00:51:42,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:142 [2019-10-02 00:51:42,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:42,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:42,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 117 [2019-10-02 00:51:42,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:42,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:42,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:42,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 162 [2019-10-02 00:51:42,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:42,616 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-02 00:51:42,617 INFO L567 ElimStorePlain]: treesize reduction 60, result has 75.7 percent of original size [2019-10-02 00:51:42,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:42,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-02 00:51:42,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:187 [2019-10-02 00:51:42,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:42,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:42,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:42,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:42,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:45,110 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 00:51:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 00:51:45,288 INFO L392 ElimStorePlain]: Different costs {30=[|v_#memory_int_46|], 42=[v_prenex_24, v_prenex_28], 56=[v_prenex_26]} [2019-10-02 00:51:45,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 82 [2019-10-02 00:51:45,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:45,742 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-10-02 00:51:45,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:45,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:45,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:45,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 121 [2019-10-02 00:51:45,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:46,402 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-10-02 00:51:46,402 INFO L567 ElimStorePlain]: treesize reduction 23, result has 94.3 percent of original size [2019-10-02 00:51:46,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:46,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 118 [2019-10-02 00:51:46,460 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:46,914 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-10-02 00:51:46,914 INFO L567 ElimStorePlain]: treesize reduction 20, result has 95.0 percent of original size [2019-10-02 00:51:46,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:46,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:46,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 157 [2019-10-02 00:51:46,981 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:47,269 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-02 00:51:47,269 INFO L567 ElimStorePlain]: treesize reduction 51, result has 88.0 percent of original size [2019-10-02 00:51:47,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-10-02 00:51:47,270 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:388, output treesize:375 [2019-10-02 00:51:47,657 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-02 00:51:47,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 00:51:47,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:47,926 INFO L235 Elim1Store]: Index analysis took 253 ms [2019-10-02 00:51:47,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:47,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 171 [2019-10-02 00:51:47,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:48,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,223 INFO L235 Elim1Store]: Index analysis took 228 ms [2019-10-02 00:51:48,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:48,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 33 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 210 [2019-10-02 00:51:48,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:48,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,444 INFO L235 Elim1Store]: Index analysis took 147 ms [2019-10-02 00:51:48,490 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:48,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 174 [2019-10-02 00:51:48,492 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:48,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:51:48,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:51:48,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 126 [2019-10-02 00:51:48,561 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 00:51:48,959 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 106 [2019-10-02 00:51:48,959 INFO L567 ElimStorePlain]: treesize reduction 206, result has 69.6 percent of original size [2019-10-02 00:51:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:48,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:48,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:48,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-10-02 00:51:48,963 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:435, output treesize:471 [2019-10-02 00:51:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,175 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 115 [2019-10-02 00:51:51,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 00:51:51,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:51:51,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:52:07,157 WARN L191 SmtUtils]: Spent 15.63 s on a formula simplification that was a NOOP. DAG size: 135 [2019-10-02 00:52:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 00:52:08,167 INFO L392 ElimStorePlain]: Different costs {30=[v_prenex_49], 56=[|v_#memory_int_48|, v_prenex_52, v_prenex_47], 72=[v_prenex_45, v_prenex_55, v_prenex_59], 90=[v_prenex_63]} [2019-10-02 00:52:09,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:09,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:09,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:10,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:10,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:11,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:12,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:12,024 INFO L235 Elim1Store]: Index analysis took 2733 ms [2019-10-02 00:52:12,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 81 [2019-10-02 00:52:12,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:52:50,284 WARN L191 SmtUtils]: Spent 38.26 s on a formula simplification that was a NOOP. DAG size: 294 [2019-10-02 00:52:50,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:52:50,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:50,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:50,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:50,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:50,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:51,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:52,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:52,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:52,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:53,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:54,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:54,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:54,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:52:54,374 INFO L235 Elim1Store]: Index analysis took 3931 ms [2019-10-02 00:52:54,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:52:54,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 165 [2019-10-02 00:52:54,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:53:52,235 WARN L191 SmtUtils]: Spent 57.84 s on a formula simplification. DAG size of input: 295 DAG size of output: 288 [2019-10-02 00:53:52,236 INFO L567 ElimStorePlain]: treesize reduction 62, result has 94.8 percent of original size [2019-10-02 00:53:52,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:52,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:52,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:52,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:53,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:54,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:54,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:54,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:54,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:53:54,152 INFO L235 Elim1Store]: Index analysis took 1706 ms [2019-10-02 00:53:54,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:53:54,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 169 [2019-10-02 00:53:54,175 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.