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/pr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:39:37,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:39:37,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:39:37,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:39:37,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:39:37,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:39:37,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:39:37,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:39:37,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:39:37,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:39:37,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:39:37,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:39:37,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:39:37,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:39:37,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:39:37,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:39:37,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:39:37,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:39:37,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:39:37,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:39:37,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:39:37,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:39:37,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:39:37,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:39:37,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:39:37,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:39:37,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:39:37,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:39:37,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:39:37,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:39:37,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:39:37,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:39:37,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:39:37,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:39:37,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:39:37,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:39:37,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:39:37,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:39:37,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:39:37,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:39:37,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:39:37,465 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-09-07 11:39:37,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:39:37,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:39:37,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:39:37,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:39:37,482 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:39:37,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:39:37,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:39:37,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:39:37,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:39:37,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:39:37,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:39:37,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:39:37,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:39:37,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:39:37,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:39:37,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:39:37,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:39:37,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:39:37,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:39:37,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:39:37,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:39:37,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:39:37,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:39:37,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:39:37,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:39:37,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:39:37,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:39:37,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:39:37,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:39:37,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:39:37,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:39:37,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:39:37,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:39:37,550 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:39:37,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr5.c [2019-09-07 11:39:37,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bb1285/5c460addb0d64142a69c681e1ca83cf0/FLAG2096e8ab3 [2019-09-07 11:39:38,092 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:39:38,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr5.c [2019-09-07 11:39:38,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bb1285/5c460addb0d64142a69c681e1ca83cf0/FLAG2096e8ab3 [2019-09-07 11:39:38,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bb1285/5c460addb0d64142a69c681e1ca83cf0 [2019-09-07 11:39:38,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:39:38,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:39:38,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:39:38,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:39:38,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:39:38,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c157ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38, skipping insertion in model container [2019-09-07 11:39:38,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,515 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:39:38,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:39:38,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:39:38,721 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:39:38,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:39:38,855 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:39:38,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38 WrapperNode [2019-09-07 11:39:38,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:39:38,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:39:38,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:39:38,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:39:38,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (1/1) ... [2019-09-07 11:39:38,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:39:38,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:39:38,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:39:38,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:39:38,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (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-09-07 11:39:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:39:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:39:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:39:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:39:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:39:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:39:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:39:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:39:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:39:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:39:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:39:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:39:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:39:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:39:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:39:39,324 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:39:39,325 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 11:39:39,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:39:39 BoogieIcfgContainer [2019-09-07 11:39:39,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:39:39,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:39:39,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:39:39,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:39:39,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:39:38" (1/3) ... [2019-09-07 11:39:39,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58978699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:39:39, skipping insertion in model container [2019-09-07 11:39:39,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:39:38" (2/3) ... [2019-09-07 11:39:39,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58978699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:39:39, skipping insertion in model container [2019-09-07 11:39:39,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:39:39" (3/3) ... [2019-09-07 11:39:39,334 INFO L109 eAbstractionObserver]: Analyzing ICFG pr5.c [2019-09-07 11:39:39,343 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:39:39,352 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:39:39,369 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:39:39,398 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:39:39,399 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:39:39,399 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:39:39,399 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:39:39,399 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:39:39,399 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:39:39,399 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:39:39,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:39:39,400 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:39:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-07 11:39:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 11:39:39,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:39,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:39,423 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash 65656709, now seen corresponding path program 1 times [2019-09-07 11:39:39,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:39,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:39,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:39,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 11:39:39,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:39:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:39:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:39:39,670 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-07 11:39:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:39,798 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-09-07 11:39:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:39:39,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-07 11:39:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:39,819 INFO L225 Difference]: With dead ends: 57 [2019-09-07 11:39:39,819 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 11:39:39,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:39:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 11:39:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 11:39:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 11:39:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-09-07 11:39:39,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 16 [2019-09-07 11:39:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:39,878 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-09-07 11:39:39,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:39:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-09-07 11:39:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 11:39:39,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:39,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:39,881 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 67503751, now seen corresponding path program 1 times [2019-09-07 11:39:39,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:39,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:39,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:40,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:40,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:39:40,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:39:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:39:40,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:39:40,064 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-09-07 11:39:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:40,169 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-09-07 11:39:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:39:40,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-07 11:39:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:40,173 INFO L225 Difference]: With dead ends: 56 [2019-09-07 11:39:40,173 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 11:39:40,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:39:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 11:39:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-09-07 11:39:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:39:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-07 11:39:40,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2019-09-07 11:39:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:40,184 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-07 11:39:40,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:39:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-07 11:39:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 11:39:40,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:40,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:40,185 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash -335534155, now seen corresponding path program 1 times [2019-09-07 11:39:40,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:40,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:40,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:40,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:40,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:40,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:39:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:40,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:39:40,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:40,712 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 16 treesize of output 12 [2019-09-07 11:39:40,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:39:40,750 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:39:40,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-09-07 11:39:40,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,771 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-09-07 11:39:40,808 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:39:40,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-09-07 11:39:40,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,839 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-09-07 11:39:40,884 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:39:40,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-09-07 11:39:40,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,915 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-09-07 11:39:40,943 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-09-07 11:39:40,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:40,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-09-07 11:39:40,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,965 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:40,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:40,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2019-09-07 11:39:41,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:41,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:41,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-09-07 11:39:41,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:39:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:39:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:39:41,054 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 11 states. [2019-09-07 11:39:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:41,611 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2019-09-07 11:39:41,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 11:39:41,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-09-07 11:39:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:41,618 INFO L225 Difference]: With dead ends: 116 [2019-09-07 11:39:41,618 INFO L226 Difference]: Without dead ends: 100 [2019-09-07 11:39:41,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:39:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-07 11:39:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 43. [2019-09-07 11:39:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 11:39:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2019-09-07 11:39:41,657 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 23 [2019-09-07 11:39:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:41,657 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2019-09-07 11:39:41,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:39:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2019-09-07 11:39:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 11:39:41,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:41,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:41,660 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1346651405, now seen corresponding path program 1 times [2019-09-07 11:39:41,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:41,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:41,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:41,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:41,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:39:41,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:42,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:39:42,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:42,039 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 16 treesize of output 12 [2019-09-07 11:39:42,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:39:42,077 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:39:42,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-09-07 11:39:42,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,103 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-09-07 11:39:42,129 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:39:42,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-09-07 11:39:42,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,157 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-09-07 11:39:42,183 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:39:42,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-09-07 11:39:42,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,205 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,222 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-09-07 11:39:42,238 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-09-07 11:39:42,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:42,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-09-07 11:39:42,250 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,256 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:42,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:42,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2019-09-07 11:39:42,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:42,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:42,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-09-07 11:39:42,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:39:42,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:39:42,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:39:42,351 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand 14 states. [2019-09-07 11:39:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:42,966 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2019-09-07 11:39:42,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:39:42,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-09-07 11:39:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:42,968 INFO L225 Difference]: With dead ends: 118 [2019-09-07 11:39:42,968 INFO L226 Difference]: Without dead ends: 116 [2019-09-07 11:39:42,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:39:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-07 11:39:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 54. [2019-09-07 11:39:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 11:39:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2019-09-07 11:39:42,980 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 23 [2019-09-07 11:39:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:42,981 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-09-07 11:39:42,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:39:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2019-09-07 11:39:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 11:39:42,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:42,983 INFO L399 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-09-07 11:39:42,983 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1807780357, now seen corresponding path program 1 times [2019-09-07 11:39:42,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:42,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:43,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:43,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:39:43,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:39:43,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:39:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:39:43,018 INFO L87 Difference]: Start difference. First operand 54 states and 75 transitions. Second operand 3 states. [2019-09-07 11:39:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:43,053 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2019-09-07 11:39:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:39:43,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 11:39:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:43,054 INFO L225 Difference]: With dead ends: 84 [2019-09-07 11:39:43,055 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 11:39:43,055 INFO L628 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-09-07 11:39:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 11:39:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-09-07 11:39:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 11:39:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2019-09-07 11:39:43,064 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 30 [2019-09-07 11:39:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:43,064 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2019-09-07 11:39:43,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:39:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2019-09-07 11:39:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 11:39:43,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:43,066 INFO L399 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-09-07 11:39:43,066 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1053367863, now seen corresponding path program 2 times [2019-09-07 11:39:43,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:43,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:43,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:39:43,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:39:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:39:43,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:39:43,099 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand 3 states. [2019-09-07 11:39:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:43,139 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2019-09-07 11:39:43,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:39:43,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 11:39:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:43,140 INFO L225 Difference]: With dead ends: 76 [2019-09-07 11:39:43,140 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 11:39:43,141 INFO L628 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-09-07 11:39:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 11:39:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-09-07 11:39:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 11:39:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-09-07 11:39:43,149 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 30 [2019-09-07 11:39:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:43,149 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-09-07 11:39:43,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:39:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2019-09-07 11:39:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:39:43,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:43,151 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:43,151 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash 290616554, now seen corresponding path program 1 times [2019-09-07 11:39:43,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:43,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:43,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:39:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:43,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:43,368 INFO L223 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-09-07 11:39:43,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:43,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:39:43,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:43,503 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 16 treesize of output 12 [2019-09-07 11:39:43,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:43,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:39:43,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:43,543 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 29 treesize of output 28 [2019-09-07 11:39:43,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:43,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:39:43,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:43,560 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 29 treesize of output 28 [2019-09-07 11:39:43,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:43,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:39:43,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:43,581 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 23 treesize of output 22 [2019-09-07 11:39:43,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:43,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:43,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:39:43,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:43,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-09-07 11:39:43,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:39:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:39:43,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:39:43,734 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand 18 states. [2019-09-07 11:39:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:44,487 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2019-09-07 11:39:44,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:39:44,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-07 11:39:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:44,489 INFO L225 Difference]: With dead ends: 142 [2019-09-07 11:39:44,489 INFO L226 Difference]: Without dead ends: 116 [2019-09-07 11:39:44,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:39:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-07 11:39:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 61. [2019-09-07 11:39:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 11:39:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-09-07 11:39:44,501 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 32 [2019-09-07 11:39:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:44,501 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-09-07 11:39:44,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:39:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2019-09-07 11:39:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:39:44,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:44,505 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:44,505 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1514821780, now seen corresponding path program 1 times [2019-09-07 11:39:44,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:44,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:44,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:44,653 INFO L223 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-09-07 11:39:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:44,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:39:44,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:44,743 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 16 treesize of output 12 [2019-09-07 11:39:44,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:44,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:39:44,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:44,785 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 29 treesize of output 28 [2019-09-07 11:39:44,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:44,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:39:44,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:44,803 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 29 treesize of output 28 [2019-09-07 11:39:44,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:44,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:39:44,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:44,822 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 23 treesize of output 22 [2019-09-07 11:39:44,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:44,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:44,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:39:44,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:44,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:44,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-07 11:39:44,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 11:39:44,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 11:39:44,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:39:44,975 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 17 states. [2019-09-07 11:39:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:46,553 INFO L93 Difference]: Finished difference Result 233 states and 313 transitions. [2019-09-07 11:39:46,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:39:46,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-09-07 11:39:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:46,557 INFO L225 Difference]: With dead ends: 233 [2019-09-07 11:39:46,558 INFO L226 Difference]: Without dead ends: 217 [2019-09-07 11:39:46,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:39:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-07 11:39:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 77. [2019-09-07 11:39:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 11:39:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2019-09-07 11:39:46,589 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 32 [2019-09-07 11:39:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:46,589 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2019-09-07 11:39:46,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 11:39:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2019-09-07 11:39:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:39:46,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:46,591 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:46,591 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash -643526488, now seen corresponding path program 1 times [2019-09-07 11:39:46,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:46,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:46,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:39:46,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:46,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:39:46,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:39:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:39:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:39:46,620 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. Second operand 4 states. [2019-09-07 11:39:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:46,667 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2019-09-07 11:39:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:39:46,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-09-07 11:39:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:46,669 INFO L225 Difference]: With dead ends: 122 [2019-09-07 11:39:46,669 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 11:39:46,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:39:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 11:39:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2019-09-07 11:39:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 11:39:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2019-09-07 11:39:46,679 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 32 [2019-09-07 11:39:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:46,680 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2019-09-07 11:39:46,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:39:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2019-09-07 11:39:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:39:46,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:46,681 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:46,682 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1295967062, now seen corresponding path program 1 times [2019-09-07 11:39:46,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:46,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:39:46,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:46,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:39:46,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:39:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:39:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:39:46,714 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand 4 states. [2019-09-07 11:39:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:46,770 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2019-09-07 11:39:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:39:46,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-09-07 11:39:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:46,772 INFO L225 Difference]: With dead ends: 123 [2019-09-07 11:39:46,773 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 11:39:46,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:39:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 11:39:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2019-09-07 11:39:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 11:39:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2019-09-07 11:39:46,797 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 32 [2019-09-07 11:39:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:46,798 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2019-09-07 11:39:46,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:39:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2019-09-07 11:39:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:39:46,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:46,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:46,801 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2113615512, now seen corresponding path program 1 times [2019-09-07 11:39:46,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:46,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:46,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:46,913 INFO L223 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-09-07 11:39:46,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:46,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:39:46,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:46,993 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 16 treesize of output 12 [2019-09-07 11:39:46,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:47,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:39:47,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:47,027 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 29 treesize of output 28 [2019-09-07 11:39:47,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:47,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:39:47,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:47,045 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 29 treesize of output 28 [2019-09-07 11:39:47,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:47,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:39:47,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:47,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:47,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:47,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:47,093 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 32 treesize of output 34 [2019-09-07 11:39:47,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:47,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:47,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:39:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:47,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:47,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-09-07 11:39:47,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:39:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:39:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:39:47,277 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 20 states. [2019-09-07 11:39:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:47,844 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2019-09-07 11:39:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:39:47,845 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-09-07 11:39:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:47,847 INFO L225 Difference]: With dead ends: 149 [2019-09-07 11:39:47,847 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 11:39:47,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:39:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 11:39:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2019-09-07 11:39:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-07 11:39:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2019-09-07 11:39:47,862 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 32 [2019-09-07 11:39:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:47,863 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2019-09-07 11:39:47,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:39:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2019-09-07 11:39:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 11:39:47,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:47,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:47,864 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 633197530, now seen corresponding path program 1 times [2019-09-07 11:39:47,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:47,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:47,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:39:47,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:47,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:39:47,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:39:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:39:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:39:47,892 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand 3 states. [2019-09-07 11:39:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:47,931 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2019-09-07 11:39:47,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:39:47,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 11:39:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:47,934 INFO L225 Difference]: With dead ends: 165 [2019-09-07 11:39:47,934 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 11:39:47,934 INFO L628 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-09-07 11:39:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 11:39:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2019-09-07 11:39:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-07 11:39:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2019-09-07 11:39:47,950 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 39 [2019-09-07 11:39:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:47,950 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2019-09-07 11:39:47,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:39:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2019-09-07 11:39:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 11:39:47,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:47,951 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:47,952 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1972826024, now seen corresponding path program 1 times [2019-09-07 11:39:47,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:47,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:47,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:47,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:47,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:48,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:48,145 INFO L223 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-09-07 11:39:48,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:39:48,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:48,252 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 16 treesize of output 12 [2019-09-07 11:39:48,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-09-07 11:39:48,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,307 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 29 treesize of output 28 [2019-09-07 11:39:48,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-09-07 11:39:48,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,364 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 41 treesize of output 43 [2019-09-07 11:39:48,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 11:39:48,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,439 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 53 treesize of output 58 [2019-09-07 11:39:48,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-09-07 11:39:48,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,568 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 6 case distinctions, treesize of input 53 treesize of output 61 [2019-09-07 11:39:48,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:70 [2019-09-07 11:39:48,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,669 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 10 case distinctions, treesize of input 83 treesize of output 79 [2019-09-07 11:39:48,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:85 [2019-09-07 11:39:48,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 91 [2019-09-07 11:39:48,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:97 [2019-09-07 11:39:48,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 103 [2019-09-07 11:39:48,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:48,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:48,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:103 [2019-09-07 11:39:48,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:48,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:49,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:49,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 115 [2019-09-07 11:39:49,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:49,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:49,074 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-09-07 11:39:49,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2019-09-07 11:39:49,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:39:49,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:49,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2019-09-07 11:39:49,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:39:49,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:39:49,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:39:49,432 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand 28 states. [2019-09-07 11:39:51,253 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-07 11:39:51,528 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-07 11:39:51,706 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 11:39:52,115 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 11:39:52,347 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-07 11:39:52,713 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-07 11:39:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:54,463 INFO L93 Difference]: Finished difference Result 302 states and 396 transitions. [2019-09-07 11:39:54,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 11:39:54,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-09-07 11:39:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:54,467 INFO L225 Difference]: With dead ends: 302 [2019-09-07 11:39:54,467 INFO L226 Difference]: Without dead ends: 276 [2019-09-07 11:39:54,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=820, Invalid=4436, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 11:39:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-07 11:39:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 145. [2019-09-07 11:39:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-07 11:39:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 192 transitions. [2019-09-07 11:39:54,491 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 192 transitions. Word has length 39 [2019-09-07 11:39:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:54,491 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 192 transitions. [2019-09-07 11:39:54,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:39:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 192 transitions. [2019-09-07 11:39:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 11:39:54,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:54,492 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:54,492 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1686362668, now seen corresponding path program 1 times [2019-09-07 11:39:54,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:54,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:54,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:54,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:54,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:39:54,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:54,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:39:54,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:39:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:39:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:39:54,520 INFO L87 Difference]: Start difference. First operand 145 states and 192 transitions. Second operand 3 states. [2019-09-07 11:39:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:54,553 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-09-07 11:39:54,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:39:54,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 11:39:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:54,555 INFO L225 Difference]: With dead ends: 174 [2019-09-07 11:39:54,555 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 11:39:54,556 INFO L628 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-09-07 11:39:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 11:39:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-09-07 11:39:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 11:39:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2019-09-07 11:39:54,577 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 39 [2019-09-07 11:39:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:54,577 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2019-09-07 11:39:54,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:39:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2019-09-07 11:39:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 11:39:54,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:54,579 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:54,579 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1404214042, now seen corresponding path program 1 times [2019-09-07 11:39:54,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:54,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:54,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:54,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:54,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:39:54,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:39:54,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:39:54,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:39:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:39:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:39:54,613 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 3 states. [2019-09-07 11:39:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:54,657 INFO L93 Difference]: Finished difference Result 154 states and 196 transitions. [2019-09-07 11:39:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:39:54,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 11:39:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:54,659 INFO L225 Difference]: With dead ends: 154 [2019-09-07 11:39:54,659 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 11:39:54,660 INFO L628 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-09-07 11:39:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 11:39:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-07 11:39:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 11:39:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2019-09-07 11:39:54,679 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 39 [2019-09-07 11:39:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:54,680 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2019-09-07 11:39:54,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:39:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2019-09-07 11:39:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 11:39:54,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:54,681 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:54,682 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:54,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1920676693, now seen corresponding path program 2 times [2019-09-07 11:39:54,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:54,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:54,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:54,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:39:54,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:39:54,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:54,836 INFO L223 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-09-07 11:39:54,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:39:54,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:39:54,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:39:54,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:39:54,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:54,955 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 16 treesize of output 12 [2019-09-07 11:39:54,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:54,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:54,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:54,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:39:55,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:55,010 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 29 treesize of output 28 [2019-09-07 11:39:55,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:55,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:55,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:55,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:39:55,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:55,031 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 23 treesize of output 22 [2019-09-07 11:39:55,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:55,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:55,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:55,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:39:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:39:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-07 11:39:55,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:39:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:39:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:39:55,303 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand 20 states. [2019-09-07 11:39:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:56,247 INFO L93 Difference]: Finished difference Result 292 states and 377 transitions. [2019-09-07 11:39:56,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:39:56,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-09-07 11:39:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:56,250 INFO L225 Difference]: With dead ends: 292 [2019-09-07 11:39:56,250 INFO L226 Difference]: Without dead ends: 235 [2019-09-07 11:39:56,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:39:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-07 11:39:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 189. [2019-09-07 11:39:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-07 11:39:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 239 transitions. [2019-09-07 11:39:56,280 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 239 transitions. Word has length 41 [2019-09-07 11:39:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:56,281 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 239 transitions. [2019-09-07 11:39:56,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:39:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 239 transitions. [2019-09-07 11:39:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 11:39:56,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:56,282 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:56,283 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2099530989, now seen corresponding path program 2 times [2019-09-07 11:39:56,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:56,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:39:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:39:56,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:56,409 INFO L223 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) [2019-09-07 11:39:56,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:39:56,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:39:56,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:39:56,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:39:56,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:56,517 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 16 treesize of output 12 [2019-09-07 11:39:56,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:56,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:56,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:56,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:39:56,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:56,556 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 29 treesize of output 28 [2019-09-07 11:39:56,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:56,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:56,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:56,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:39:56,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:56,576 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 23 treesize of output 22 [2019-09-07 11:39:56,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:56,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:56,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:56,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:39:56,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:39:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-07 11:39:56,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:39:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:39:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:39:56,825 INFO L87 Difference]: Start difference. First operand 189 states and 239 transitions. Second operand 20 states. [2019-09-07 11:39:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:39:58,870 INFO L93 Difference]: Finished difference Result 387 states and 488 transitions. [2019-09-07 11:39:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 11:39:58,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-09-07 11:39:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:39:58,874 INFO L225 Difference]: With dead ends: 387 [2019-09-07 11:39:58,874 INFO L226 Difference]: Without dead ends: 356 [2019-09-07 11:39:58,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=495, Invalid=2261, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 11:39:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-07 11:39:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 189. [2019-09-07 11:39:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-07 11:39:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 238 transitions. [2019-09-07 11:39:58,907 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 238 transitions. Word has length 41 [2019-09-07 11:39:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:39:58,908 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 238 transitions. [2019-09-07 11:39:58,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:39:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 238 transitions. [2019-09-07 11:39:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 11:39:58,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:39:58,909 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:39:58,909 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:39:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:39:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash -11727721, now seen corresponding path program 2 times [2019-09-07 11:39:58,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:39:58,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:39:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:58,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:39:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:39:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:39:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:39:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:39:59,005 INFO L223 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-09-07 11:39:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:39:59,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:39:59,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:39:59,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:39:59,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:39:59,078 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 16 treesize of output 12 [2019-09-07 11:39:59,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:59,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:59,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:59,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:39:59,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:59,115 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 29 treesize of output 28 [2019-09-07 11:39:59,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:59,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:59,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:59,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:39:59,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:59,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:59,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:39:59,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:59,158 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 32 treesize of output 34 [2019-09-07 11:39:59,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:39:59,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:39:59,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:39:59,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:39:59,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:39:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:39:59,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:39:59,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2019-09-07 11:39:59,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:39:59,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:39:59,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:39:59,390 INFO L87 Difference]: Start difference. First operand 189 states and 238 transitions. Second operand 18 states. [2019-09-07 11:40:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:00,495 INFO L93 Difference]: Finished difference Result 486 states and 609 transitions. [2019-09-07 11:40:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:40:00,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-09-07 11:40:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:00,500 INFO L225 Difference]: With dead ends: 486 [2019-09-07 11:40:00,500 INFO L226 Difference]: Without dead ends: 456 [2019-09-07 11:40:00,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:40:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-07 11:40:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 275. [2019-09-07 11:40:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-07 11:40:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 349 transitions. [2019-09-07 11:40:00,565 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 349 transitions. Word has length 41 [2019-09-07 11:40:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:00,565 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 349 transitions. [2019-09-07 11:40:00,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:40:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2019-09-07 11:40:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 11:40:00,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:00,567 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:00,567 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 10904533, now seen corresponding path program 1 times [2019-09-07 11:40:00,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:00,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:00,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:40:00,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:00,711 INFO L223 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) [2019-09-07 11:40:00,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:40:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:00,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:40:00,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:00,816 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 16 treesize of output 12 [2019-09-07 11:40:00,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:00,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:00,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:00,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:40:00,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:40:00,843 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 29 treesize of output 28 [2019-09-07 11:40:00,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:00,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:00,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:00,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:40:00,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:40:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:40:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:40:00,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:00,885 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 32 treesize of output 34 [2019-09-07 11:40:00,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:00,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:00,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:00,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:40:01,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:40:01,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:01,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2019-09-07 11:40:01,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:40:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:40:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:40:01,135 INFO L87 Difference]: Start difference. First operand 275 states and 349 transitions. Second operand 22 states. [2019-09-07 11:40:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:02,343 INFO L93 Difference]: Finished difference Result 396 states and 492 transitions. [2019-09-07 11:40:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:40:02,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-09-07 11:40:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:02,346 INFO L225 Difference]: With dead ends: 396 [2019-09-07 11:40:02,347 INFO L226 Difference]: Without dead ends: 394 [2019-09-07 11:40:02,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 11:40:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-07 11:40:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 348. [2019-09-07 11:40:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-07 11:40:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 439 transitions. [2019-09-07 11:40:02,420 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 439 transitions. Word has length 41 [2019-09-07 11:40:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:02,420 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 439 transitions. [2019-09-07 11:40:02,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:40:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 439 transitions. [2019-09-07 11:40:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 11:40:02,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:02,425 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:02,425 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -991855766, now seen corresponding path program 2 times [2019-09-07 11:40:02,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:02,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:40:02,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:02,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:40:02,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:40:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:40:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:02,461 INFO L87 Difference]: Start difference. First operand 348 states and 439 transitions. Second operand 3 states. [2019-09-07 11:40:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:02,539 INFO L93 Difference]: Finished difference Result 433 states and 542 transitions. [2019-09-07 11:40:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:40:02,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 11:40:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:02,542 INFO L225 Difference]: With dead ends: 433 [2019-09-07 11:40:02,542 INFO L226 Difference]: Without dead ends: 346 [2019-09-07 11:40:02,543 INFO L628 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-09-07 11:40:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-07 11:40:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 336. [2019-09-07 11:40:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 11:40:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 422 transitions. [2019-09-07 11:40:02,598 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 422 transitions. Word has length 46 [2019-09-07 11:40:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:02,598 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 422 transitions. [2019-09-07 11:40:02,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:40:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 422 transitions. [2019-09-07 11:40:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 11:40:02,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:02,600 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:02,600 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1116400357, now seen corresponding path program 1 times [2019-09-07 11:40:02,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:02,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:02,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:02,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:02,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:40:02,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:02,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:40:02,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:40:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:40:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:02,628 INFO L87 Difference]: Start difference. First operand 336 states and 422 transitions. Second operand 3 states. [2019-09-07 11:40:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:02,706 INFO L93 Difference]: Finished difference Result 545 states and 682 transitions. [2019-09-07 11:40:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:40:02,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-07 11:40:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:02,708 INFO L225 Difference]: With dead ends: 545 [2019-09-07 11:40:02,708 INFO L226 Difference]: Without dead ends: 334 [2019-09-07 11:40:02,709 INFO L628 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-09-07 11:40:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-07 11:40:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 289. [2019-09-07 11:40:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-07 11:40:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 350 transitions. [2019-09-07 11:40:02,760 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 350 transitions. Word has length 48 [2019-09-07 11:40:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:02,760 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 350 transitions. [2019-09-07 11:40:02,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:40:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 350 transitions. [2019-09-07 11:40:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:40:02,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:02,762 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:02,762 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:02,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2063236426, now seen corresponding path program 3 times [2019-09-07 11:40:02,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:02,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:02,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:40:02,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:02,956 INFO L223 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) [2019-09-07 11:40:02,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:40:03,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 11:40:03,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:40:03,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:40:03,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:03,065 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 16 treesize of output 12 [2019-09-07 11:40:03,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:03,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:40:03,108 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:40:03,108 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-09-07 11:40:03,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:03,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:40:03,132 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:40:03,132 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-09-07 11:40:03,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:03,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:40:03,155 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:40:03,156 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-09-07 11:40:03,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:03,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-09-07 11:40:03,203 INFO L341 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2019-09-07 11:40:03,203 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 30 treesize of output 32 [2019-09-07 11:40:03,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:03,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:03,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-09-07 11:40:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:40:03,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:03,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2019-09-07 11:40:03,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:40:03,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:40:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:40:03,739 INFO L87 Difference]: Start difference. First operand 289 states and 350 transitions. Second operand 24 states. [2019-09-07 11:40:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:07,284 INFO L93 Difference]: Finished difference Result 492 states and 589 transitions. [2019-09-07 11:40:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 11:40:07,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-07 11:40:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:07,289 INFO L225 Difference]: With dead ends: 492 [2019-09-07 11:40:07,289 INFO L226 Difference]: Without dead ends: 396 [2019-09-07 11:40:07,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=540, Invalid=2882, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:40:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-07 11:40:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 286. [2019-09-07 11:40:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-07 11:40:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 342 transitions. [2019-09-07 11:40:07,340 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 342 transitions. Word has length 50 [2019-09-07 11:40:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:07,340 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 342 transitions. [2019-09-07 11:40:07,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:40:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 342 transitions. [2019-09-07 11:40:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:40:07,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:07,341 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:07,342 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1533324534, now seen corresponding path program 3 times [2019-09-07 11:40:07,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:07,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:07,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:07,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:07,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:40:07,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:07,442 INFO L223 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-09-07 11:40:07,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:40:07,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 11:40:07,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:40:07,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:40:07,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:07,493 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 16 treesize of output 12 [2019-09-07 11:40:07,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:07,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:07,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:07,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-09-07 11:40:07,511 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-09-07 11:40:07,522 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:40:07,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2019-09-07 11:40:07,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:07,538 INFO L567 ElimStorePlain]: treesize reduction 21, result has 47.5 percent of original size [2019-09-07 11:40:07,538 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:07,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:07,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:07,544 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-09-07 11:40:07,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:40:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:07,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-09-07 11:40:07,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:40:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:40:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:40:07,806 INFO L87 Difference]: Start difference. First operand 286 states and 342 transitions. Second operand 16 states. [2019-09-07 11:40:20,352 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-07 11:40:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:38,337 INFO L93 Difference]: Finished difference Result 748 states and 895 transitions. [2019-09-07 11:40:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:40:38,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-09-07 11:40:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:38,341 INFO L225 Difference]: With dead ends: 748 [2019-09-07 11:40:38,341 INFO L226 Difference]: Without dead ends: 718 [2019-09-07 11:40:38,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 11:40:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-09-07 11:40:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 352. [2019-09-07 11:40:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-07 11:40:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 427 transitions. [2019-09-07 11:40:38,408 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 427 transitions. Word has length 50 [2019-09-07 11:40:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:38,408 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 427 transitions. [2019-09-07 11:40:38,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:40:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 427 transitions. [2019-09-07 11:40:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:40:38,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:38,410 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:38,410 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1457523850, now seen corresponding path program 1 times [2019-09-07 11:40:38,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:38,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:38,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:38,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:40:38,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:38,540 INFO L223 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) [2019-09-07 11:40:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:40:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:38,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:40:38,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:38,624 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 16 treesize of output 12 [2019-09-07 11:40:38,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:38,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:38,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:38,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:40:38,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:40:38,653 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 23 treesize of output 22 [2019-09-07 11:40:38,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:38,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:38,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:38,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:40:38,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:40:38,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:38,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-09-07 11:40:38,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:40:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:40:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:40:38,951 INFO L87 Difference]: Start difference. First operand 352 states and 427 transitions. Second operand 23 states. [2019-09-07 11:40:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:40,575 INFO L93 Difference]: Finished difference Result 639 states and 777 transitions. [2019-09-07 11:40:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:40:40,575 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-07 11:40:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:40,578 INFO L225 Difference]: With dead ends: 639 [2019-09-07 11:40:40,578 INFO L226 Difference]: Without dead ends: 637 [2019-09-07 11:40:40,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=352, Invalid=1810, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 11:40:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-07 11:40:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 479. [2019-09-07 11:40:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-07 11:40:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 590 transitions. [2019-09-07 11:40:40,666 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 590 transitions. Word has length 50 [2019-09-07 11:40:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:40,666 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 590 transitions. [2019-09-07 11:40:40,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:40:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 590 transitions. [2019-09-07 11:40:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 11:40:40,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:40,668 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:40,668 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1627206315, now seen corresponding path program 1 times [2019-09-07 11:40:40,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:40,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:40,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:40,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:40,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 11:40:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:40:40,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:40:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:40:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:40,720 INFO L87 Difference]: Start difference. First operand 479 states and 590 transitions. Second operand 3 states. [2019-09-07 11:40:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:40,818 INFO L93 Difference]: Finished difference Result 539 states and 661 transitions. [2019-09-07 11:40:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:40:40,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-07 11:40:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:40,821 INFO L225 Difference]: With dead ends: 539 [2019-09-07 11:40:40,821 INFO L226 Difference]: Without dead ends: 414 [2019-09-07 11:40:40,822 INFO L628 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-09-07 11:40:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-07 11:40:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-09-07 11:40:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-07 11:40:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 505 transitions. [2019-09-07 11:40:40,895 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 505 transitions. Word has length 55 [2019-09-07 11:40:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:40,896 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 505 transitions. [2019-09-07 11:40:40,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:40:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 505 transitions. [2019-09-07 11:40:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 11:40:40,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:40,898 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:40,898 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1704694390, now seen corresponding path program 1 times [2019-09-07 11:40:40,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:40,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:40,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 11:40:40,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:40,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:40:40,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:40:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:40:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:40,922 INFO L87 Difference]: Start difference. First operand 411 states and 505 transitions. Second operand 3 states. [2019-09-07 11:40:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:41,004 INFO L93 Difference]: Finished difference Result 599 states and 737 transitions. [2019-09-07 11:40:41,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:40:41,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-07 11:40:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:41,006 INFO L225 Difference]: With dead ends: 599 [2019-09-07 11:40:41,006 INFO L226 Difference]: Without dead ends: 407 [2019-09-07 11:40:41,007 INFO L628 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-09-07 11:40:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-07 11:40:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 344. [2019-09-07 11:40:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-07 11:40:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 415 transitions. [2019-09-07 11:40:41,078 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 415 transitions. Word has length 57 [2019-09-07 11:40:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:41,078 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 415 transitions. [2019-09-07 11:40:41,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:40:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 415 transitions. [2019-09-07 11:40:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 11:40:41,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:41,080 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:41,080 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1290180341, now seen corresponding path program 4 times [2019-09-07 11:40:41,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:41,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:41,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:41,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:40:41,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:41,229 INFO L223 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-09-07 11:40:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:40:41,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:40:41,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:40:41,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:40:41,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:41,337 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-09-07 11:40:41,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:41,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:41,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:41,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-07 11:40:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:40:41,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:41,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-09-07 11:40:41,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:40:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:40:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:40:41,677 INFO L87 Difference]: Start difference. First operand 344 states and 415 transitions. Second operand 24 states. [2019-09-07 11:40:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:44,397 INFO L93 Difference]: Finished difference Result 678 states and 812 transitions. [2019-09-07 11:40:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 11:40:44,398 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2019-09-07 11:40:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:44,402 INFO L225 Difference]: With dead ends: 678 [2019-09-07 11:40:44,402 INFO L226 Difference]: Without dead ends: 676 [2019-09-07 11:40:44,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:40:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-07 11:40:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 495. [2019-09-07 11:40:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-07 11:40:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 605 transitions. [2019-09-07 11:40:44,540 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 605 transitions. Word has length 59 [2019-09-07 11:40:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:44,540 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 605 transitions. [2019-09-07 11:40:44,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:40:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 605 transitions. [2019-09-07 11:40:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 11:40:44,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:44,542 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:44,543 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash -638092361, now seen corresponding path program 2 times [2019-09-07 11:40:44,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:44,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:44,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:44,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:44,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:40:44,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:44,736 INFO L223 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) [2019-09-07 11:40:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:40:44,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:40:44,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:40:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:40:44,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:44,828 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-09-07 11:40:44,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:44,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:44,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:44,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-09-07 11:40:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:40:45,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-07 11:40:45,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:40:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:40:45,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:40:45,369 INFO L87 Difference]: Start difference. First operand 495 states and 605 transitions. Second operand 22 states. [2019-09-07 11:40:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:46,423 INFO L93 Difference]: Finished difference Result 575 states and 691 transitions. [2019-09-07 11:40:46,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:40:46,424 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2019-09-07 11:40:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:46,427 INFO L225 Difference]: With dead ends: 575 [2019-09-07 11:40:46,427 INFO L226 Difference]: Without dead ends: 559 [2019-09-07 11:40:46,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:40:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-07 11:40:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 500. [2019-09-07 11:40:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-07 11:40:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 611 transitions. [2019-09-07 11:40:46,541 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 611 transitions. Word has length 59 [2019-09-07 11:40:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:46,541 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 611 transitions. [2019-09-07 11:40:46,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:40:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 611 transitions. [2019-09-07 11:40:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 11:40:46,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:46,544 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:46,544 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:46,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1033186730, now seen corresponding path program 5 times [2019-09-07 11:40:46,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:46,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 54 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:40:46,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:46,989 INFO L223 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-09-07 11:40:47,000 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:40:47,034 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 11:40:47,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:40:47,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:40:47,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:47,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:40:47,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:47,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:40:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:40:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:40:47,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-07 11:40:47,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:40:47,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:40:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:40:47,331 INFO L87 Difference]: Start difference. First operand 500 states and 611 transitions. Second operand 22 states. [2019-09-07 11:40:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:47,791 INFO L93 Difference]: Finished difference Result 793 states and 946 transitions. [2019-09-07 11:40:47,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:40:47,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-09-07 11:40:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:47,794 INFO L225 Difference]: With dead ends: 793 [2019-09-07 11:40:47,794 INFO L226 Difference]: Without dead ends: 509 [2019-09-07 11:40:47,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:40:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-07 11:40:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 491. [2019-09-07 11:40:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-07 11:40:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 591 transitions. [2019-09-07 11:40:47,907 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 591 transitions. Word has length 68 [2019-09-07 11:40:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:47,908 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 591 transitions. [2019-09-07 11:40:47,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:40:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 591 transitions. [2019-09-07 11:40:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 11:40:47,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:47,910 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:47,911 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1503533126, now seen corresponding path program 1 times [2019-09-07 11:40:47,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:47,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:47,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:40:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 11:40:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:47,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:40:47,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:40:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:40:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:47,947 INFO L87 Difference]: Start difference. First operand 491 states and 591 transitions. Second operand 3 states. [2019-09-07 11:40:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:48,092 INFO L93 Difference]: Finished difference Result 565 states and 680 transitions. [2019-09-07 11:40:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:40:48,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-07 11:40:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:48,094 INFO L225 Difference]: With dead ends: 565 [2019-09-07 11:40:48,095 INFO L226 Difference]: Without dead ends: 426 [2019-09-07 11:40:48,095 INFO L628 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-09-07 11:40:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-07 11:40:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2019-09-07 11:40:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-07 11:40:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 506 transitions. [2019-09-07 11:40:48,203 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 506 transitions. Word has length 71 [2019-09-07 11:40:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:48,203 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 506 transitions. [2019-09-07 11:40:48,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:40:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 506 transitions. [2019-09-07 11:40:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 11:40:48,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:48,205 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:48,206 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:48,206 INFO L82 PathProgramCache]: Analyzing trace with hash -302205992, now seen corresponding path program 6 times [2019-09-07 11:40:48,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:48,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:40:48,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:48,417 INFO L223 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-09-07 11:40:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:40:48,505 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-07 11:40:48,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:40:48,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:40:48,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:40:48,542 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 16 treesize of output 12 [2019-09-07 11:40:48,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:48,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:40:48,635 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:40:48,635 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 25 [2019-09-07 11:40:48,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:48,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-09-07 11:40:48,662 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:40:48,662 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 25 [2019-09-07 11:40:48,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:48,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-09-07 11:40:48,682 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:40:48,683 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 25 [2019-09-07 11:40:48,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:48,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-09-07 11:40:48,706 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:40:48,706 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 25 [2019-09-07 11:40:48,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:48,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-09-07 11:40:48,729 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:40:48,730 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-09-07 11:40:48,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:40:48,750 INFO L567 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-09-07 11:40:48,751 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-09-07 11:40:48,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-09-07 11:41:04,224 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-09-07 11:41:10,395 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-07 11:41:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 47 refuted. 12 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:41:10,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:10,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-09-07 11:41:10,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:41:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:41:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=668, Unknown=4, NotChecked=0, Total=756 [2019-09-07 11:41:10,468 INFO L87 Difference]: Start difference. First operand 422 states and 506 transitions. Second operand 28 states. [2019-09-07 11:41:18,276 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-09-07 11:41:21,478 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-09-07 11:41:29,490 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-07 11:41:30,244 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-07 11:41:30,795 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-09-07 11:41:31,137 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-07 11:41:31,761 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-09-07 11:41:33,827 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-09-07 11:41:39,355 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-07 11:41:43,671 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 11:41:49,358 WARN L188 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-07 11:41:57,771 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 11:41:58,150 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-07 11:42:10,789 WARN L188 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2019-09-07 11:42:14,329 WARN L188 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-07 11:42:15,084 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-07 11:42:17,652 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-07 11:42:18,237 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-07 11:42:18,944 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-09-07 11:42:27,221 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-09-07 11:42:27,833 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-09-07 11:42:28,597 WARN L188 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-07 11:42:32,879 WARN L188 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2019-09-07 11:42:37,328 WARN L188 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-07 11:42:47,528 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-07 11:42:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:47,769 INFO L93 Difference]: Finished difference Result 686 states and 805 transitions. [2019-09-07 11:42:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-07 11:42:47,769 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-09-07 11:42:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:47,773 INFO L225 Difference]: With dead ends: 686 [2019-09-07 11:42:47,774 INFO L226 Difference]: Without dead ends: 614 [2019-09-07 11:42:47,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=1154, Invalid=10386, Unknown=16, NotChecked=0, Total=11556 [2019-09-07 11:42:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-07 11:42:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 452. [2019-09-07 11:42:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-07 11:42:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 538 transitions. [2019-09-07 11:42:47,906 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 538 transitions. Word has length 75 [2019-09-07 11:42:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:47,906 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 538 transitions. [2019-09-07 11:42:47,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:42:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 538 transitions. [2019-09-07 11:42:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 11:42:47,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:47,908 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:47,909 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1484590890, now seen corresponding path program 4 times [2019-09-07 11:42:47,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:47,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:47,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:47,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:42:47,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:42:48,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:48,143 INFO L223 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-09-07 11:42:48,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:42:48,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:42:48,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:42:48,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:42:48,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:48,263 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 16 treesize of output 12 [2019-09-07 11:42:48,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:48,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:42:48,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:48,300 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 29 treesize of output 28 [2019-09-07 11:42:48,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:48,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:42:48,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:48,316 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 29 treesize of output 28 [2019-09-07 11:42:48,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:48,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:42:48,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:48,330 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 29 treesize of output 28 [2019-09-07 11:42:48,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:48,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:42:48,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:48,346 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 23 treesize of output 22 [2019-09-07 11:42:48,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:48,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:48,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:42:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:42:48,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:42:48,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-09-07 11:42:48,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:42:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:42:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:42:48,882 INFO L87 Difference]: Start difference. First operand 452 states and 538 transitions. Second operand 29 states. [2019-09-07 11:42:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:53,320 INFO L93 Difference]: Finished difference Result 998 states and 1204 transitions. [2019-09-07 11:42:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 11:42:53,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2019-09-07 11:42:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:53,324 INFO L225 Difference]: With dead ends: 998 [2019-09-07 11:42:53,324 INFO L226 Difference]: Without dead ends: 996 [2019-09-07 11:42:53,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=938, Invalid=7072, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 11:42:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-09-07 11:42:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 716. [2019-09-07 11:42:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-07 11:42:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 888 transitions. [2019-09-07 11:42:53,483 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 888 transitions. Word has length 75 [2019-09-07 11:42:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:53,484 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 888 transitions. [2019-09-07 11:42:53,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:42:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 888 transitions. [2019-09-07 11:42:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:42:53,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:53,487 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:53,487 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1356787031, now seen corresponding path program 7 times [2019-09-07 11:42:53,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:53,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:42:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:42:53,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:53,728 INFO L223 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-09-07 11:42:53,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:42:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:53,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:42:53,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:53,862 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 16 treesize of output 12 [2019-09-07 11:42:53,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:53,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:42:53,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:53,904 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 29 treesize of output 28 [2019-09-07 11:42:53,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:53,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:42:53,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:53,922 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 29 treesize of output 28 [2019-09-07 11:42:53,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:53,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:42:53,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:42:53,938 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 23 treesize of output 22 [2019-09-07 11:42:53,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:53,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:53,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:42:54,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:42:54,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:42:54,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-09-07 11:42:54,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:42:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:42:54,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:42:54,568 INFO L87 Difference]: Start difference. First operand 716 states and 888 transitions. Second operand 30 states. [2019-09-07 11:42:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:57,768 INFO L93 Difference]: Finished difference Result 893 states and 1086 transitions. [2019-09-07 11:42:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 11:42:57,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2019-09-07 11:42:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:57,773 INFO L225 Difference]: With dead ends: 893 [2019-09-07 11:42:57,773 INFO L226 Difference]: Without dead ends: 863 [2019-09-07 11:42:57,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=523, Invalid=3767, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 11:42:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-07 11:42:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 734. [2019-09-07 11:42:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-09-07 11:42:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 909 transitions. [2019-09-07 11:42:58,005 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 909 transitions. Word has length 84 [2019-09-07 11:42:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:58,005 INFO L475 AbstractCegarLoop]: Abstraction has 734 states and 909 transitions. [2019-09-07 11:42:58,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:42:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 909 transitions. [2019-09-07 11:42:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:42:58,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:58,008 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:58,009 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1331257577, now seen corresponding path program 5 times [2019-09-07 11:42:58,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:58,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:42:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 44 proven. 69 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 11:42:58,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:58,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:42:58,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:42:58,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 11:42:58,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:42:58,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:42:58,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:58,359 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 16 treesize of output 12 [2019-09-07 11:42:58,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:58,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:42:58,379 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:42:58,398 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:42:58,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2019-09-07 11:42:58,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,420 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-09-07 11:42:58,420 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:58,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2019-09-07 11:42:58,441 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:42:58,456 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:42:58,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2019-09-07 11:42:58,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,474 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-09-07 11:42:58,474 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:58,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2019-09-07 11:42:58,496 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:42:58,508 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:42:58,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2019-09-07 11:42:58,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,526 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-09-07 11:42:58,526 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:58,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2019-09-07 11:42:58,549 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:42:58,561 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:42:58,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2019-09-07 11:42:58,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,579 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-09-07 11:42:58,579 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:58,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:58,589 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-09-07 11:42:58,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:34 [2019-09-07 11:43:06,755 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-07 11:43:08,800 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 11:43:14,913 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-07 11:43:21,045 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-07 11:43:27,178 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 11:43:47,282 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 11:43:53,364 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-07 11:43:57,428 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 11:43:57,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:43:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 78 proven. 69 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-07 11:43:57,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:43:57,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 26 [2019-09-07 11:43:57,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:43:57,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:43:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=543, Unknown=13, NotChecked=0, Total=650 [2019-09-07 11:43:57,488 INFO L87 Difference]: Start difference. First operand 734 states and 909 transitions. Second operand 26 states. [2019-09-07 11:45:13,553 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 11:45:17,619 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-07 11:45:21,713 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-07 11:45:25,814 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-07 11:45:37,942 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-07 11:45:42,032 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-07 11:46:02,277 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-07 11:46:06,334 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 65 [2019-09-07 11:46:16,495 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 11:46:40,795 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-07 11:46:44,958 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-07 11:46:49,012 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 11:46:57,359 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-07 11:47:07,483 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 11:47:13,683 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 11:47:19,778 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-07 11:47:27,982 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-07 11:47:42,214 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-07 11:47:57,410 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2019-09-07 11:48:03,493 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-07 11:48:19,851 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-07 11:48:24,190 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-07 11:49:02,453 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-07 11:49:04,542 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-07 11:49:16,677 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-07 11:49:22,830 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-07 11:49:26,914 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-07 11:49:33,033 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 11:49:37,102 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-07 11:50:19,280 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-07 11:50:29,516 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-07 11:50:35,642 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-07 11:50:39,769 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 11:50:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:50:45,883 INFO L93 Difference]: Finished difference Result 1097 states and 1347 transitions. [2019-09-07 11:50:45,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 11:50:45,884 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2019-09-07 11:50:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:50:45,889 INFO L225 Difference]: With dead ends: 1097 [2019-09-07 11:50:45,889 INFO L226 Difference]: Without dead ends: 882 [2019-09-07 11:50:45,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2263 ImplicationChecksByTransitivity, 332.4s TimeCoverageRelationStatistics Valid=875, Invalid=5679, Unknown=88, NotChecked=0, Total=6642 [2019-09-07 11:50:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-09-07 11:50:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 541. [2019-09-07 11:50:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-07 11:50:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 658 transitions. [2019-09-07 11:50:46,030 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 658 transitions. Word has length 84 [2019-09-07 11:50:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:50:46,030 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 658 transitions. [2019-09-07 11:50:46,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:50:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 658 transitions. [2019-09-07 11:50:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:50:46,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:50:46,032 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:50:46,032 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:50:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:50:46,032 INFO L82 PathProgramCache]: Analyzing trace with hash 320140327, now seen corresponding path program 6 times [2019-09-07 11:50:46,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:50:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:50:46,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:50:46,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:50:46,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:50:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:50:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:50:46,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:50:46,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:50:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:50:46,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 11:50:46,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:50:46,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:50:46,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:50:46,450 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 16 treesize of output 12 [2019-09-07 11:50:46,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-09-07 11:50:46,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,497 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 29 treesize of output 28 [2019-09-07 11:50:46,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-09-07 11:50:46,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,560 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 41 treesize of output 43 [2019-09-07 11:50:46,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-07 11:50:46,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,631 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 53 treesize of output 58 [2019-09-07 11:50:46,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-09-07 11:50:46,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,722 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 6 case distinctions, treesize of input 65 treesize of output 73 [2019-09-07 11:50:46,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-09-07 11:50:46,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,870 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 10 case distinctions, treesize of input 60 treesize of output 71 [2019-09-07 11:50:46,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:46,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-09-07 11:50:46,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:46,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:46,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 83 [2019-09-07 11:50:46,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2019-09-07 11:50:47,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 95 [2019-09-07 11:50:47,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2019-09-07 11:50:47,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 87 treesize of output 107 [2019-09-07 11:50:47,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:97 [2019-09-07 11:50:47,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:47,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 122 [2019-09-07 11:50:47,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:47,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:47,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:109 [2019-09-07 11:50:47,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:50:47,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:50:47,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:50:47,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:50:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:50:48,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:50:48,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:48,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:48,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 113 treesize of output 50 [2019-09-07 11:50:48,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:48,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:48,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:48,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:120, output treesize:6 [2019-09-07 11:50:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 11:50:48,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:50:48,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2019-09-07 11:50:48,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 11:50:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 11:50:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:50:48,563 INFO L87 Difference]: Start difference. First operand 541 states and 658 transitions. Second operand 34 states. [2019-09-07 11:50:50,332 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-07 11:50:50,591 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-07 11:50:54,218 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-09-07 11:50:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:50:56,572 INFO L93 Difference]: Finished difference Result 846 states and 1034 transitions. [2019-09-07 11:50:56,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 11:50:56,572 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2019-09-07 11:50:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:50:56,575 INFO L225 Difference]: With dead ends: 846 [2019-09-07 11:50:56,575 INFO L226 Difference]: Without dead ends: 769 [2019-09-07 11:50:56,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2658 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1014, Invalid=8886, Unknown=0, NotChecked=0, Total=9900 [2019-09-07 11:50:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-09-07 11:50:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 580. [2019-09-07 11:50:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-07 11:50:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 702 transitions. [2019-09-07 11:50:56,711 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 702 transitions. Word has length 84 [2019-09-07 11:50:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:50:56,712 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 702 transitions. [2019-09-07 11:50:56,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 11:50:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 702 transitions. [2019-09-07 11:50:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:50:56,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:50:56,714 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:50:56,715 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:50:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:50:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1014379099, now seen corresponding path program 2 times [2019-09-07 11:50:56,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:50:56,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:50:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:50:56,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:50:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:50:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:50:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:50:56,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:50:56,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:50:56,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:50:56,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:50:56,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:50:56,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:50:56,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:50:57,050 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 16 treesize of output 12 [2019-09-07 11:50:57,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:57,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:50:57,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:57,085 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 29 treesize of output 28 [2019-09-07 11:50:57,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:57,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:50:57,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:57,102 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 29 treesize of output 28 [2019-09-07 11:50:57,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:57,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:50:57,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:57,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:57,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:50:57,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:57,151 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 32 treesize of output 34 [2019-09-07 11:50:57,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:50:57,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:50:57,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:50:57,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:50:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:50:57,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:50:57,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2019-09-07 11:50:57,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:50:57,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:50:57,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:50:57,839 INFO L87 Difference]: Start difference. First operand 580 states and 702 transitions. Second operand 30 states. [2019-09-07 11:51:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:51:02,310 INFO L93 Difference]: Finished difference Result 925 states and 1106 transitions. [2019-09-07 11:51:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 11:51:02,311 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2019-09-07 11:51:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:51:02,314 INFO L225 Difference]: With dead ends: 925 [2019-09-07 11:51:02,315 INFO L226 Difference]: Without dead ends: 873 [2019-09-07 11:51:02,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=903, Invalid=6579, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 11:51:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-09-07 11:51:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 620. [2019-09-07 11:51:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-07 11:51:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 749 transitions. [2019-09-07 11:51:02,482 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 749 transitions. Word has length 84 [2019-09-07 11:51:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:51:02,483 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 749 transitions. [2019-09-07 11:51:02,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:51:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 749 transitions. [2019-09-07 11:51:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:51:02,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:51:02,487 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:51:02,487 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:51:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:51:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1343309979, now seen corresponding path program 3 times [2019-09-07 11:51:02,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:51:02,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:51:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:02,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:51:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 11:51:02,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:51:02,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:51:02,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:51:02,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:51:02,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:51:02,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:51:02,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:02,842 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 16 treesize of output 12 [2019-09-07 11:51:02,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:02,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:02,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:02,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-09-07 11:51:02,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:02,892 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 29 treesize of output 28 [2019-09-07 11:51:02,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:02,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:02,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:02,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-09-07 11:51:02,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:02,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:02,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:02,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:02,945 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 41 treesize of output 43 [2019-09-07 11:51:02,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:02,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:02,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:02,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-07 11:51:03,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,008 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 53 treesize of output 58 [2019-09-07 11:51:03,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-09-07 11:51:03,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,089 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 6 case distinctions, treesize of input 65 treesize of output 73 [2019-09-07 11:51:03,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-09-07 11:51:03,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,228 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 10 case distinctions, treesize of input 60 treesize of output 71 [2019-09-07 11:51:03,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-09-07 11:51:03,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 86 [2019-09-07 11:51:03,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:82 [2019-09-07 11:51:03,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 98 [2019-09-07 11:51:03,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:95, output treesize:91 [2019-09-07 11:51:03,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 93 treesize of output 113 [2019-09-07 11:51:03,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:103 [2019-09-07 11:51:03,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:03,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 128 [2019-09-07 11:51:03,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:03,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:03,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-09-07 11:51:04,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:51:04,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:04,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 11:51:04,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:51:04,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 28 [2019-09-07 11:51:04,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:51:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:51:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:51:04,534 INFO L87 Difference]: Start difference. First operand 620 states and 749 transitions. Second operand 28 states. [2019-09-07 11:51:06,787 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-07 11:51:06,994 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-07 11:51:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:51:07,486 INFO L93 Difference]: Finished difference Result 856 states and 1053 transitions. [2019-09-07 11:51:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:51:07,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2019-09-07 11:51:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:51:07,490 INFO L225 Difference]: With dead ends: 856 [2019-09-07 11:51:07,490 INFO L226 Difference]: Without dead ends: 686 [2019-09-07 11:51:07,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 11:51:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-07 11:51:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 611. [2019-09-07 11:51:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-07 11:51:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 722 transitions. [2019-09-07 11:51:07,738 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 722 transitions. Word has length 84 [2019-09-07 11:51:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:51:07,738 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 722 transitions. [2019-09-07 11:51:07,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:51:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 722 transitions. [2019-09-07 11:51:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:51:07,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:51:07,741 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:51:07,741 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:51:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:51:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1263690459, now seen corresponding path program 4 times [2019-09-07 11:51:07,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:51:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:51:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:07,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:51:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 102 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:51:07,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:51:07,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:51:07,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:51:08,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:51:08,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:51:08,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:51:08,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:08,159 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 16 treesize of output 12 [2019-09-07 11:51:08,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:08,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:51:08,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:08,222 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 29 treesize of output 28 [2019-09-07 11:51:08,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:08,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:51:08,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:08,238 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 29 treesize of output 28 [2019-09-07 11:51:08,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:08,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:51:08,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:08,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:08,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:08,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:08,315 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 32 treesize of output 34 [2019-09-07 11:51:08,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:08,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:08,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 11:51:09,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:51:09,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:51:09,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2019-09-07 11:51:09,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:51:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:51:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:51:09,365 INFO L87 Difference]: Start difference. First operand 611 states and 722 transitions. Second operand 32 states. [2019-09-07 11:51:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:51:14,557 INFO L93 Difference]: Finished difference Result 860 states and 1006 transitions. [2019-09-07 11:51:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-07 11:51:14,558 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 84 [2019-09-07 11:51:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:51:14,561 INFO L225 Difference]: With dead ends: 860 [2019-09-07 11:51:14,561 INFO L226 Difference]: Without dead ends: 858 [2019-09-07 11:51:14,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3874 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1309, Invalid=9821, Unknown=0, NotChecked=0, Total=11130 [2019-09-07 11:51:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-07 11:51:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 670. [2019-09-07 11:51:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-07 11:51:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 796 transitions. [2019-09-07 11:51:14,712 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 796 transitions. Word has length 84 [2019-09-07 11:51:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:51:14,712 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 796 transitions. [2019-09-07 11:51:14,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:51:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 796 transitions. [2019-09-07 11:51:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:51:14,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:51:14,714 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:51:14,714 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:51:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:51:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -912745354, now seen corresponding path program 8 times [2019-09-07 11:51:14,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:51:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:51:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:14,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:51:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:51:15,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:51:15,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:51:15,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:51:15,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:51:15,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:51:15,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:51:15,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:15,229 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 16 treesize of output 12 [2019-09-07 11:51:15,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:15,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:15,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:15,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:51:15,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:15,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 29 treesize of output 28 [2019-09-07 11:51:15,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:15,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:15,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:15,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:51:15,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:15,299 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 23 treesize of output 22 [2019-09-07 11:51:15,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:15,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:15,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:15,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:51:16,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:51:16,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:51:16,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-09-07 11:51:16,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:51:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:51:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:51:16,116 INFO L87 Difference]: Start difference. First operand 670 states and 796 transitions. Second operand 32 states. [2019-09-07 11:51:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:51:19,379 INFO L93 Difference]: Finished difference Result 839 states and 988 transitions. [2019-09-07 11:51:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 11:51:19,379 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-07 11:51:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:51:19,383 INFO L225 Difference]: With dead ends: 839 [2019-09-07 11:51:19,383 INFO L226 Difference]: Without dead ends: 809 [2019-09-07 11:51:19,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=599, Invalid=4657, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 11:51:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-09-07 11:51:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 688. [2019-09-07 11:51:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-07 11:51:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 817 transitions. [2019-09-07 11:51:19,586 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 817 transitions. Word has length 93 [2019-09-07 11:51:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:51:19,587 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 817 transitions. [2019-09-07 11:51:19,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:51:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 817 transitions. [2019-09-07 11:51:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:51:19,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:51:19,588 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:51:19,589 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:51:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:51:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 678658422, now seen corresponding path program 7 times [2019-09-07 11:51:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:51:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:51:19,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:19,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:51:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:51:19,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:51:19,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:51:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:51:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:19,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:51:19,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:20,073 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 16 treesize of output 12 [2019-09-07 11:51:20,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:20,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:20,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:20,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:51:20,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:20,117 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 29 treesize of output 28 [2019-09-07 11:51:20,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:20,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:20,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:20,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:51:20,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:20,135 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 23 treesize of output 22 [2019-09-07 11:51:20,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:20,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:20,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:20,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:51:20,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:51:20,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:51:20,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-09-07 11:51:20,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:51:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:51:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:51:20,992 INFO L87 Difference]: Start difference. First operand 688 states and 817 transitions. Second operand 32 states. [2019-09-07 11:51:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:51:27,492 INFO L93 Difference]: Finished difference Result 1029 states and 1216 transitions. [2019-09-07 11:51:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 11:51:27,492 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-07 11:51:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:51:27,496 INFO L225 Difference]: With dead ends: 1029 [2019-09-07 11:51:27,496 INFO L226 Difference]: Without dead ends: 997 [2019-09-07 11:51:27,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2285 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=890, Invalid=7852, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 11:51:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-09-07 11:51:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 687. [2019-09-07 11:51:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-09-07 11:51:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 814 transitions. [2019-09-07 11:51:27,674 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 814 transitions. Word has length 93 [2019-09-07 11:51:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:51:27,675 INFO L475 AbstractCegarLoop]: Abstraction has 687 states and 814 transitions. [2019-09-07 11:51:27,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:51:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 814 transitions. [2019-09-07 11:51:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:51:27,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:51:27,677 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:51:27,677 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:51:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:51:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 739908986, now seen corresponding path program 5 times [2019-09-07 11:51:27,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:51:27,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:51:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:51:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 52 proven. 96 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 11:51:28,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:51:28,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:51:28,035 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:51:28,185 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 11:51:28,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:51:28,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:51:28,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:28,313 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 16 treesize of output 12 [2019-09-07 11:51:28,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:28,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:51:28,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:28,364 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 29 treesize of output 28 [2019-09-07 11:51:28,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:28,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:51:28,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:28,382 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 29 treesize of output 28 [2019-09-07 11:51:28,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:28,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-09-07 11:51:28,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:28,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:28,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:51:28,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:28,440 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 32 treesize of output 34 [2019-09-07 11:51:28,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:28,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:28,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-09-07 11:51:29,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 74 proven. 96 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 11:51:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:51:29,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-09-07 11:51:29,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:51:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:51:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:51:29,325 INFO L87 Difference]: Start difference. First operand 687 states and 814 transitions. Second operand 31 states. [2019-09-07 11:51:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:51:33,837 INFO L93 Difference]: Finished difference Result 802 states and 941 transitions. [2019-09-07 11:51:33,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 11:51:33,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2019-09-07 11:51:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:51:33,841 INFO L225 Difference]: With dead ends: 802 [2019-09-07 11:51:33,841 INFO L226 Difference]: Without dead ends: 760 [2019-09-07 11:51:33,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 68 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2460 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1021, Invalid=6289, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 11:51:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-07 11:51:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 685. [2019-09-07 11:51:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-09-07 11:51:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 807 transitions. [2019-09-07 11:51:34,009 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 807 transitions. Word has length 93 [2019-09-07 11:51:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:51:34,010 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 807 transitions. [2019-09-07 11:51:34,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:51:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 807 transitions. [2019-09-07 11:51:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:51:34,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:51:34,011 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:51:34,011 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:51:34,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:51:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash -271208264, now seen corresponding path program 6 times [2019-09-07 11:51:34,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:51:34,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:51:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:34,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:51:34,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:51:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:51:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:51:34,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:51:34,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:51:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:51:34,444 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-07 11:51:34,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:51:34,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:51:34,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:34,476 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 16 treesize of output 12 [2019-09-07 11:51:34,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:34,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:34,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:34,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-09-07 11:51:34,502 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-09-07 11:51:34,521 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:51:34,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2019-09-07 11:51:34,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:34,550 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-09-07 11:51:34,550 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:34,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:34,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:34,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2019-09-07 11:51:34,631 INFO L341 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-09-07 11:51:34,631 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 41 treesize of output 43 [2019-09-07 11:51:34,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:51:34,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:34,645 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-09-07 11:51:34,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2019-09-07 11:51:49,366 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-07 11:52:57,665 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-07 11:53:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:53:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 53 proven. 128 refuted. 24 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 11:53:03,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:53:03,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 36 [2019-09-07 11:53:03,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:53:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:53:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1067, Unknown=31, NotChecked=0, Total=1260 [2019-09-07 11:53:03,787 INFO L87 Difference]: Start difference. First operand 685 states and 807 transitions. Second operand 36 states. [2019-09-07 11:53:13,379 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 41 DAG size of output: 30