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/pnr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:26:52,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:26:52,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:26:52,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:26:52,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:26:52,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:26:52,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:26:52,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:26:52,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:26:52,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:26:52,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:26:52,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:26:52,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:26:52,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:26:52,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:26:52,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:26:52,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:26:52,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:26:52,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:26:52,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:26:52,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:26:52,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:26:52,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:26:52,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:26:52,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:26:52,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:26:52,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:26:52,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:26:52,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:26:52,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:26:52,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:26:52,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:26:52,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:26:52,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:26:52,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:26:52,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:26:52,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:26:52,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:26:52,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:26:52,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:26:52,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:26:52,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:26:52,327 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:26:52,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:26:52,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:26:52,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:26:52,329 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:26:52,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:26:52,329 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:26:52,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:26:52,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:26:52,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:26:52,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:26:52,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:26:52,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:26:52,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:26:52,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:26:52,331 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:26:52,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:26:52,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:26:52,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:26:52,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:26:52,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:26:52,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:26:52,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:26:52,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:26:52,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:26:52,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:26:52,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:26:52,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:26:52,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:26:52,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:26:52,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:26:52,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:26:52,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:26:52,382 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:26:52,382 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr5.c [2019-10-02 00:26:52,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73648d7d/489085e20e8f4e0c9009a53a46a5678f/FLAG2483e22c6 [2019-10-02 00:26:52,893 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:26:52,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr5.c [2019-10-02 00:26:52,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73648d7d/489085e20e8f4e0c9009a53a46a5678f/FLAG2483e22c6 [2019-10-02 00:26:53,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73648d7d/489085e20e8f4e0c9009a53a46a5678f [2019-10-02 00:26:53,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:26:53,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:26:53,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:26:53,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:26:53,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:26:53,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c494c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53, skipping insertion in model container [2019-10-02 00:26:53,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,286 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:26:53,303 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:26:53,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:26:53,480 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:26:53,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:26:53,609 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:26:53,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53 WrapperNode [2019-10-02 00:26:53,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:26:53,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:26:53,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:26:53,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:26:53,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... [2019-10-02 00:26:53,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:26:53,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:26:53,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:26:53,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:26:53,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:26:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:26:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:26:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:26:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-10-02 00:26:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-10-02 00:26:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:26:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 00:26:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:26:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:26:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:26:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:26:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:26:54,056 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:26:54,056 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 00:26:54,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:26:54 BoogieIcfgContainer [2019-10-02 00:26:54,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:26:54,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:26:54,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:26:54,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:26:54,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:26:53" (1/3) ... [2019-10-02 00:26:54,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f618d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:26:54, skipping insertion in model container [2019-10-02 00:26:54,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:26:53" (2/3) ... [2019-10-02 00:26:54,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f618d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:26:54, skipping insertion in model container [2019-10-02 00:26:54,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:26:54" (3/3) ... [2019-10-02 00:26:54,065 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr5.c [2019-10-02 00:26:54,074 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:26:54,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:26:54,101 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:26:54,138 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:26:54,139 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:26:54,139 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:26:54,139 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:26:54,139 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:26:54,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:26:54,139 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:26:54,139 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:26:54,140 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:26:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-02 00:26:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 00:26:54,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:54,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:54,162 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash -973608197, now seen corresponding path program 1 times [2019-10-02 00:26:54,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:54,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:54,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:26:54,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:26:54,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 00:26:54,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 00:26:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 00:26:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:26:54,323 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-10-02 00:26:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:54,348 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-10-02 00:26:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 00:26:54,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-02 00:26:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:54,358 INFO L225 Difference]: With dead ends: 60 [2019-10-02 00:26:54,359 INFO L226 Difference]: Without dead ends: 39 [2019-10-02 00:26:54,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:26:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-02 00:26:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-02 00:26:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 00:26:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-10-02 00:26:54,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 15 [2019-10-02 00:26:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:54,407 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-10-02 00:26:54,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 00:26:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-10-02 00:26:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 00:26:54,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:54,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:54,409 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2038399118, now seen corresponding path program 1 times [2019-10-02 00:26:54,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:54,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:26:54,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:26:54,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:26:54,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:26:54,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:26:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:26:54,642 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2019-10-02 00:26:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:54,821 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-10-02 00:26:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:26:54,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-02 00:26:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:54,825 INFO L225 Difference]: With dead ends: 67 [2019-10-02 00:26:54,825 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 00:26:54,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:26:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 00:26:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-10-02 00:26:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 00:26:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-10-02 00:26:54,854 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 15 [2019-10-02 00:26:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:54,855 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-10-02 00:26:54,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:26:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-10-02 00:26:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 00:26:54,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:54,857 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:26:54,857 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1405014836, now seen corresponding path program 1 times [2019-10-02 00:26:54,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:55,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:55,285 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:55,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:55,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 00:26:55,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:55,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:26:55,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:55,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:26:55,515 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:55,516 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 30 treesize of output 29 [2019-10-02 00:26:55,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:55,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:26:55,545 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:55,546 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 30 treesize of output 29 [2019-10-02 00:26:55,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:55,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:26:55,579 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:55,580 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 30 treesize of output 29 [2019-10-02 00:26:55,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:55,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:26:55,607 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 00:26:55,608 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 22 treesize of output 21 [2019-10-02 00:26:55,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:55,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-10-02 00:26:55,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:26:55,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:55,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:55,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-02 00:26:55,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-02 00:26:55,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 00:26:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 00:26:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:26:55,705 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 16 states. [2019-10-02 00:26:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:56,124 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2019-10-02 00:26:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 00:26:56,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-10-02 00:26:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:56,128 INFO L225 Difference]: With dead ends: 105 [2019-10-02 00:26:56,128 INFO L226 Difference]: Without dead ends: 103 [2019-10-02 00:26:56,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:26:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-02 00:26:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2019-10-02 00:26:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 00:26:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2019-10-02 00:26:56,146 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 47 [2019-10-02 00:26:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:56,147 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2019-10-02 00:26:56,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 00:26:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2019-10-02 00:26:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 00:26:56,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:56,150 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:26:56,150 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1332628278, now seen corresponding path program 1 times [2019-10-02 00:26:56,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:56,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:56,527 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:56,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 00:26:56,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:56,678 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-10-02 00:26:56,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:56,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:26:56,767 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:56,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:26:56,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:56,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:26:56,839 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:56,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:26:56,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:56,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:26:56,910 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:56,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:26:56,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:56,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:26:56,969 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 00:26:56,970 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 21 treesize of output 20 [2019-10-02 00:26:56,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:56,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:56,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-10-02 00:26:57,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:26:57,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:57,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:57,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:57,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-10-02 00:26:57,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 00:26:57,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:57,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-10-02 00:26:57,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 00:26:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 00:26:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-02 00:26:57,105 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand 19 states. [2019-10-02 00:26:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:58,518 INFO L93 Difference]: Finished difference Result 211 states and 292 transitions. [2019-10-02 00:26:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:26:58,519 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-10-02 00:26:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:58,523 INFO L225 Difference]: With dead ends: 211 [2019-10-02 00:26:58,523 INFO L226 Difference]: Without dead ends: 209 [2019-10-02 00:26:58,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 00:26:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-02 00:26:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 46. [2019-10-02 00:26:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 00:26:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-10-02 00:26:58,541 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 47 [2019-10-02 00:26:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:58,542 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-10-02 00:26:58,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 00:26:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-10-02 00:26:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 00:26:58,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:58,544 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:58,544 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2120960149, now seen corresponding path program 1 times [2019-10-02 00:26:58,545 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:58,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:58,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:58,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:58,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:58,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:58,660 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:26:58,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:58,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 00:26:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:58,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:26:58,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:58,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:26:58,758 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:58,758 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 30 treesize of output 29 [2019-10-02 00:26:58,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:58,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:26:58,780 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:58,781 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 30 treesize of output 29 [2019-10-02 00:26:58,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:58,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:26:58,811 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:26:58,811 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 24 treesize of output 23 [2019-10-02 00:26:58,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:58,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-02 00:26:58,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-10-02 00:26:58,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:58,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:58,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-10-02 00:26:58,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:26:58,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-02 00:26:58,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 00:26:58,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 00:26:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 00:26:58,866 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 12 states. [2019-10-02 00:26:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:59,165 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2019-10-02 00:26:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 00:26:59,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-02 00:26:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:59,169 INFO L225 Difference]: With dead ends: 108 [2019-10-02 00:26:59,169 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 00:26:59,170 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:26:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 00:26:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-10-02 00:26:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 00:26:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-10-02 00:26:59,186 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 55 [2019-10-02 00:26:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:59,187 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-10-02 00:26:59,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 00:26:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-10-02 00:26:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 00:26:59,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:59,190 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:59,190 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1276954647, now seen corresponding path program 1 times [2019-10-02 00:26:59,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:59,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:59,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:59,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:59,368 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:59,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:59,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 00:26:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:59,495 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-10-02 00:26:59,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:59,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:26:59,577 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:59,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:26:59,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:59,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:26:59,637 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:26:59,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:26:59,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:59,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:26:59,704 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:26:59,705 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 23 treesize of output 22 [2019-10-02 00:26:59,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:59,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:26:59,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:26:59,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:59,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:59,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:26:59,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:26:59,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:59,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-02 00:26:59,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:26:59,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:26:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:26:59,849 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 20 states. [2019-10-02 00:27:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:27:18,343 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2019-10-02 00:27:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:27:18,346 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-10-02 00:27:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:27:18,347 INFO L225 Difference]: With dead ends: 214 [2019-10-02 00:27:18,348 INFO L226 Difference]: Without dead ends: 212 [2019-10-02 00:27:18,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=206, Invalid=982, Unknown=2, NotChecked=0, Total=1190 [2019-10-02 00:27:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-02 00:27:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 128. [2019-10-02 00:27:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-02 00:27:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2019-10-02 00:27:18,375 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 55 [2019-10-02 00:27:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:27:18,376 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2019-10-02 00:27:18,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:27:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2019-10-02 00:27:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 00:27:18,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:27:18,378 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:27:18,378 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:27:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:27:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1312764682, now seen corresponding path program 2 times [2019-10-02 00:27:18,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:27:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:27:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:27:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:27:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 00:27:18,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:27:18,505 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:27:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:27:18,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:27:18,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:27:18,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 00:27:18,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:27:18,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:27:18,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:18,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-10-02 00:27:18,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:27:18,717 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 30 treesize of output 29 [2019-10-02 00:27:18,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:18,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-10-02 00:27:18,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:27:18,775 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 24 treesize of output 23 [2019-10-02 00:27:18,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:18,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-10-02 00:27:18,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:27:18,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:18,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:18,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:27:18,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:27:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 00:27:19,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:27:19,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-10-02 00:27:19,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 00:27:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 00:27:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:27:19,030 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand 21 states. [2019-10-02 00:28:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:00,210 INFO L93 Difference]: Finished difference Result 339 states and 484 transitions. [2019-10-02 00:28:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 00:28:00,211 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2019-10-02 00:28:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:00,216 INFO L225 Difference]: With dead ends: 339 [2019-10-02 00:28:00,216 INFO L226 Difference]: Without dead ends: 337 [2019-10-02 00:28:00,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-10-02 00:28:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-02 00:28:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 290. [2019-10-02 00:28:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-02 00:28:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 413 transitions. [2019-10-02 00:28:00,281 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 413 transitions. Word has length 63 [2019-10-02 00:28:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:00,282 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 413 transitions. [2019-10-02 00:28:00,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 00:28:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 413 transitions. [2019-10-02 00:28:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 00:28:00,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:00,285 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:00,285 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -653233160, now seen corresponding path program 1 times [2019-10-02 00:28:00,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:00,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:00,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:28:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 00:28:00,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:00,456 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:28:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:00,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:28:00,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:00,574 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-10-02 00:28:00,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:00,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:28:00,657 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:28:00,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:28:00,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:00,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:28:00,711 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:28:00,712 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 23 treesize of output 22 [2019-10-02 00:28:00,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:00,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:28:00,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:28:00,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:00,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:00,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:28:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:28:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 00:28:00,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:00,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-10-02 00:28:00,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:28:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:28:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:28:00,943 INFO L87 Difference]: Start difference. First operand 290 states and 413 transitions. Second operand 22 states. [2019-10-02 00:28:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:29,114 INFO L93 Difference]: Finished difference Result 704 states and 999 transitions. [2019-10-02 00:28:29,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 00:28:29,114 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2019-10-02 00:28:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:29,120 INFO L225 Difference]: With dead ends: 704 [2019-10-02 00:28:29,120 INFO L226 Difference]: Without dead ends: 702 [2019-10-02 00:28:29,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1808, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 00:28:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-02 00:28:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 468. [2019-10-02 00:28:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-02 00:28:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 714 transitions. [2019-10-02 00:28:29,188 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 714 transitions. Word has length 63 [2019-10-02 00:28:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:29,189 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 714 transitions. [2019-10-02 00:28:29,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:28:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 714 transitions. [2019-10-02 00:28:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 00:28:29,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:29,191 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:29,192 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash 926965847, now seen corresponding path program 3 times [2019-10-02 00:28:29,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:29,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:28:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 00:28:29,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:29,319 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:29,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:28:29,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 00:28:29,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:28:29,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 00:28:29,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:29,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:28:29,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:29,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:28:29,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:28:29,443 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 24 treesize of output 23 [2019-10-02 00:28:29,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:29,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:28:29,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:28:29,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:29,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-02 00:28:29,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:28:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 00:28:29,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-10-02 00:28:29,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 00:28:29,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 00:28:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:28:29,595 INFO L87 Difference]: Start difference. First operand 468 states and 714 transitions. Second operand 21 states. [2019-10-02 00:28:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:31,433 INFO L93 Difference]: Finished difference Result 1132 states and 1768 transitions. [2019-10-02 00:28:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:28:31,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-10-02 00:28:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:31,443 INFO L225 Difference]: With dead ends: 1132 [2019-10-02 00:28:31,443 INFO L226 Difference]: Without dead ends: 1130 [2019-10-02 00:28:31,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:28:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-10-02 00:28:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1053. [2019-10-02 00:28:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-02 00:28:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1656 transitions. [2019-10-02 00:28:31,601 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1656 transitions. Word has length 71 [2019-10-02 00:28:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:31,603 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1656 transitions. [2019-10-02 00:28:31,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 00:28:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1656 transitions. [2019-10-02 00:28:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 00:28:31,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:31,608 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:31,608 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:31,608 INFO L82 PathProgramCache]: Analyzing trace with hash -918401319, now seen corresponding path program 1 times [2019-10-02 00:28:31,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:31,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:28:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 00:28:31,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:31,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:31,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:28:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:31,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 00:28:31,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:31,944 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-10-02 00:28:31,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:31,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:31,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:31,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:28:32,027 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:28:32,028 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 23 treesize of output 22 [2019-10-02 00:28:32,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:32,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:28:32,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:28:32,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:32,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:28:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:28:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:28:32,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:32,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-10-02 00:28:32,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 00:28:32,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 00:28:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:28:32,311 INFO L87 Difference]: Start difference. First operand 1053 states and 1656 transitions. Second operand 24 states. [2019-10-02 00:29:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:10,835 INFO L93 Difference]: Finished difference Result 2059 states and 3190 transitions. [2019-10-02 00:29:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 00:29:10,835 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2019-10-02 00:29:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:10,858 INFO L225 Difference]: With dead ends: 2059 [2019-10-02 00:29:10,859 INFO L226 Difference]: Without dead ends: 2057 [2019-10-02 00:29:10,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=606, Invalid=3176, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 00:29:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-10-02 00:29:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1088. [2019-10-02 00:29:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-10-02 00:29:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1712 transitions. [2019-10-02 00:29:11,068 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1712 transitions. Word has length 71 [2019-10-02 00:29:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:11,068 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1712 transitions. [2019-10-02 00:29:11,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 00:29:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1712 transitions. [2019-10-02 00:29:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 00:29:11,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:11,073 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:11,073 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1198195384, now seen corresponding path program 4 times [2019-10-02 00:29:11,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:11,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:29:11,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:11,251 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:11,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:29:11,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:29:11,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:11,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 00:29:11,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:11,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 00:29:11,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:11,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:11,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:11,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:29:11,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:29:11,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:11,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:11,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:11,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:29:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:29:11,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:11,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-10-02 00:29:11,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 00:29:11,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 00:29:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:29:11,742 INFO L87 Difference]: Start difference. First operand 1088 states and 1712 transitions. Second operand 25 states. [2019-10-02 00:30:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:30:27,588 INFO L93 Difference]: Finished difference Result 1254 states and 1929 transitions. [2019-10-02 00:30:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 00:30:27,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2019-10-02 00:30:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:30:27,596 INFO L225 Difference]: With dead ends: 1254 [2019-10-02 00:30:27,596 INFO L226 Difference]: Without dead ends: 1252 [2019-10-02 00:30:27,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=2050, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 00:30:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-10-02 00:30:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1183. [2019-10-02 00:30:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-02 00:30:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1824 transitions. [2019-10-02 00:30:27,734 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1824 transitions. Word has length 79 [2019-10-02 00:30:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:30:27,735 INFO L475 AbstractCegarLoop]: Abstraction has 1183 states and 1824 transitions. [2019-10-02 00:30:27,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 00:30:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1824 transitions. [2019-10-02 00:30:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 00:30:27,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:30:27,738 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:30:27,738 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:30:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:30:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1621842106, now seen corresponding path program 1 times [2019-10-02 00:30:27,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:30:27,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:30:27,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:30:27,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:30:27,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:30:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:30:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:30:27,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:30:27,913 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:30:27,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:30:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:30:27,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:30:27,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:30:28,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 00:30:28,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:30:28,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:30:28,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:30:28,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:30:28,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:30:28,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:30:28,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:30:28,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:30:28,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:30:28,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:30:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:30:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:30:28,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-10-02 00:30:28,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:30:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:30:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:30:28,405 INFO L87 Difference]: Start difference. First operand 1183 states and 1824 transitions. Second operand 26 states. [2019-10-02 00:31:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:31:40,688 INFO L93 Difference]: Finished difference Result 4343 states and 6872 transitions. [2019-10-02 00:31:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 00:31:40,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2019-10-02 00:31:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:31:40,733 INFO L225 Difference]: With dead ends: 4343 [2019-10-02 00:31:40,733 INFO L226 Difference]: Without dead ends: 4341 [2019-10-02 00:31:40,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=776, Invalid=4480, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 00:31:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-10-02 00:31:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 2683. [2019-10-02 00:31:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-10-02 00:31:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4265 transitions. [2019-10-02 00:31:41,083 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4265 transitions. Word has length 79 [2019-10-02 00:31:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:31:41,083 INFO L475 AbstractCegarLoop]: Abstraction has 2683 states and 4265 transitions. [2019-10-02 00:31:41,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:31:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4265 transitions. [2019-10-02 00:31:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 00:31:41,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:31:41,088 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:31:41,089 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:31:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:31:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash 956169405, now seen corresponding path program 1 times [2019-10-02 00:31:41,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:31:41,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:31:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:31:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:31:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-02 00:31:41,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:31:41,309 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:31:41,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:31:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:31:41,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 00:31:41,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:31:41,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:31:41,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:31:41,420 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:31:41,420 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 30 treesize of output 29 [2019-10-02 00:31:41,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,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-10-02 00:31:41,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:31:41,447 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:31:41,448 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 30 treesize of output 29 [2019-10-02 00:31:41,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:31:41,472 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:31:41,473 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 30 treesize of output 29 [2019-10-02 00:31:41,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:31:41,503 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:31:41,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-10-02 00:31:41,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-10-02 00:31:41,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 58 [2019-10-02 00:31:41,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:31:41,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,551 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-10-02 00:31:41,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-10-02 00:31:41,563 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:31:41,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-10-02 00:31:41,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-10-02 00:31:41,583 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:31:41,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-10-02 00:31:41,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-10-02 00:31:41,604 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:31:41,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-10-02 00:31:41,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:10 [2019-10-02 00:31:41,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-10-02 00:31:41,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:41,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:41,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-10-02 00:31:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:31:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-02 00:31:41,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:31:41,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2019-10-02 00:31:41,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 00:31:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 00:31:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:31:41,659 INFO L87 Difference]: Start difference. First operand 2683 states and 4265 transitions. Second operand 15 states. [2019-10-02 00:31:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:31:42,336 INFO L93 Difference]: Finished difference Result 3110 states and 4950 transitions. [2019-10-02 00:31:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 00:31:42,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-10-02 00:31:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:31:42,356 INFO L225 Difference]: With dead ends: 3110 [2019-10-02 00:31:42,356 INFO L226 Difference]: Without dead ends: 3108 [2019-10-02 00:31:42,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 00:31:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-10-02 00:31:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2593. [2019-10-02 00:31:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-10-02 00:31:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 4117 transitions. [2019-10-02 00:31:42,680 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 4117 transitions. Word has length 87 [2019-10-02 00:31:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:31:42,681 INFO L475 AbstractCegarLoop]: Abstraction has 2593 states and 4117 transitions. [2019-10-02 00:31:42,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 00:31:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4117 transitions. [2019-10-02 00:31:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 00:31:42,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:31:42,686 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:31:42,686 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:31:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:31:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash 163689497, now seen corresponding path program 5 times [2019-10-02 00:31:42,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:31:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:31:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:42,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:31:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:31:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 43 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 00:31:43,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:31:43,163 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:31:43,210 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:31:43,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 00:31:43,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:31:43,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 00:31:43,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:31:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:31:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:31:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:31:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 00:31:43,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:31:43,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-10-02 00:31:43,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 00:31:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 00:31:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:31:43,568 INFO L87 Difference]: Start difference. First operand 2593 states and 4117 transitions. Second operand 23 states. [2019-10-02 00:31:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:31:44,286 INFO L93 Difference]: Finished difference Result 2697 states and 4245 transitions. [2019-10-02 00:31:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 00:31:44,287 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2019-10-02 00:31:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:31:44,299 INFO L225 Difference]: With dead ends: 2697 [2019-10-02 00:31:44,300 INFO L226 Difference]: Without dead ends: 2588 [2019-10-02 00:31:44,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2019-10-02 00:31:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2019-10-02 00:31:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2546. [2019-10-02 00:31:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2019-10-02 00:31:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 4052 transitions. [2019-10-02 00:31:44,652 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 4052 transitions. Word has length 87 [2019-10-02 00:31:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:31:44,653 INFO L475 AbstractCegarLoop]: Abstraction has 2546 states and 4052 transitions. [2019-10-02 00:31:44,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 00:31:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 4052 transitions. [2019-10-02 00:31:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 00:31:44,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:31:44,662 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 00:31:44,662 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:31:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:31:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash 191334629, now seen corresponding path program 2 times [2019-10-02 00:31:44,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:31:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:31:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:44,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:31:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:31:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-02 00:31:45,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:31:45,138 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:31:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:31:45,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:31:45,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:31:45,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 00:31:45,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:31:45,277 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-10-02 00:31:45,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:31:45,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,405 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-10-02 00:31:45,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-10-02 00:31:45,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,456 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-10-02 00:31:45,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-10-02 00:31:45,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,519 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-10-02 00:31:45,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-10-02 00:31:45,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:31:45,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:31:45,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:31:45,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:31:45,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:31:45,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:31:45,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:31:45,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:31:45,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:31:45,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:45,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:45,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:31:45,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:45,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-02 00:31:45,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:31:46,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,050 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 32 treesize of output 25 [2019-10-02 00:31:46,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2019-10-02 00:31:46,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,169 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 47 treesize of output 40 [2019-10-02 00:31:46,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2019-10-02 00:31:46,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,248 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 47 treesize of output 40 [2019-10-02 00:31:46,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2019-10-02 00:31:46,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,349 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 47 treesize of output 40 [2019-10-02 00:31:46,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:31:46,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:40 [2019-10-02 00:31:46,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:46,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2019-10-02 00:31:46,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:46,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:46,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2019-10-02 00:31:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:31:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 175 proven. 51 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 00:31:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:31:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-10-02 00:31:46,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:31:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:31:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:31:46,702 INFO L87 Difference]: Start difference. First operand 2546 states and 4052 transitions. Second operand 28 states. [2019-10-02 00:31:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:31:49,208 INFO L93 Difference]: Finished difference Result 3181 states and 4918 transitions. [2019-10-02 00:31:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 00:31:49,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 119 [2019-10-02 00:31:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:31:49,220 INFO L225 Difference]: With dead ends: 3181 [2019-10-02 00:31:49,220 INFO L226 Difference]: Without dead ends: 3179 [2019-10-02 00:31:49,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 87 SyntacticMatches, 42 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=421, Invalid=2441, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 00:31:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-10-02 00:31:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1037. [2019-10-02 00:31:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-10-02 00:31:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1588 transitions. [2019-10-02 00:31:49,392 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1588 transitions. Word has length 119 [2019-10-02 00:31:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:31:49,392 INFO L475 AbstractCegarLoop]: Abstraction has 1037 states and 1588 transitions. [2019-10-02 00:31:49,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:31:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1588 transitions. [2019-10-02 00:31:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 00:31:49,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:31:49,398 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:31:49,398 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:31:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:31:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1632186177, now seen corresponding path program 6 times [2019-10-02 00:31:49,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:31:49,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:31:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:49,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:31:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:31:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:31:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-10-02 00:31:49,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:31:49,660 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:31:49,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:31:49,776 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 00:31:49,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:31:49,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 00:31:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:31:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:31:49,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:49,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:49,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:49,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-10-02 00:31:49,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:49,925 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 30 treesize of output 29 [2019-10-02 00:31:49,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:49,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:49,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:49,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-10-02 00:31:49,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:49,978 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 30 treesize of output 29 [2019-10-02 00:31:49,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:49,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:49,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:49,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-10-02 00:31:50,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:50,029 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 30 treesize of output 29 [2019-10-02 00:31:50,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:50,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:50,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:50,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-10-02 00:31:50,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:31:50,087 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 24 treesize of output 23 [2019-10-02 00:31:50,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:50,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:50,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:50,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-10-02 00:31:50,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:31:50,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:31:50,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:31:50,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:31:50,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:31:50,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:31:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 72 proven. 79 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 00:31:50,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:31:50,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-10-02 00:31:50,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 00:31:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 00:31:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-10-02 00:31:50,598 INFO L87 Difference]: Start difference. First operand 1037 states and 1588 transitions. Second operand 29 states. [2019-10-02 00:38:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:30,929 INFO L93 Difference]: Finished difference Result 4633 states and 7342 transitions. [2019-10-02 00:38:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-02 00:38:30,930 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2019-10-02 00:38:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:30,953 INFO L225 Difference]: With dead ends: 4633 [2019-10-02 00:38:30,953 INFO L226 Difference]: Without dead ends: 4631 [2019-10-02 00:38:30,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 93 SyntacticMatches, 22 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1286, Invalid=10270, Unknown=0, NotChecked=0, Total=11556 [2019-10-02 00:38:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2019-10-02 00:38:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 1892. [2019-10-02 00:38:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-10-02 00:38:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2949 transitions. [2019-10-02 00:38:31,220 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2949 transitions. Word has length 119 [2019-10-02 00:38:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:31,220 INFO L475 AbstractCegarLoop]: Abstraction has 1892 states and 2949 transitions. [2019-10-02 00:38:31,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 00:38:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2949 transitions. [2019-10-02 00:38:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 00:38:31,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:31,226 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:31,226 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 751738561, now seen corresponding path program 1 times [2019-10-02 00:38:31,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:31,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:31,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:31,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:38:31,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-10-02 00:38:31,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:31,527 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:31,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:31,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 00:38:31,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:31,709 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-10-02 00:38:31,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:38:31,786 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:38:31,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:31,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:31,851 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:38:31,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:31,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:31,913 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:38:31,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:31,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:31,977 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:38:31,978 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 23 treesize of output 22 [2019-10-02 00:38:31,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:38:32,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:38:32,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:32,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:32,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:32,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:38:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 72 proven. 79 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 00:38:32,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:32,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-10-02 00:38:32,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:38:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:38:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:38:32,463 INFO L87 Difference]: Start difference. First operand 1892 states and 2949 transitions. Second operand 30 states. [2019-10-02 00:40:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:05,054 INFO L93 Difference]: Finished difference Result 4581 states and 7151 transitions. [2019-10-02 00:40:05,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-02 00:40:05,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2019-10-02 00:40:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:05,067 INFO L225 Difference]: With dead ends: 4581 [2019-10-02 00:40:05,068 INFO L226 Difference]: Without dead ends: 4579 [2019-10-02 00:40:05,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 93 SyntacticMatches, 22 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2629 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1095, Invalid=7095, Unknown=0, NotChecked=0, Total=8190 [2019-10-02 00:40:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-10-02 00:40:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 3257. [2019-10-02 00:40:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2019-10-02 00:40:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 5048 transitions. [2019-10-02 00:40:05,556 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 5048 transitions. Word has length 119 [2019-10-02 00:40:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:05,557 INFO L475 AbstractCegarLoop]: Abstraction has 3257 states and 5048 transitions. [2019-10-02 00:40:05,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:40:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 5048 transitions. [2019-10-02 00:40:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:40:05,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:05,565 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:05,565 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 87984928, now seen corresponding path program 7 times [2019-10-02 00:40:05,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:05,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:05,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:05,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:05,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 00:40:05,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:05,819 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:05,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:05,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 00:40:05,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:05,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:40:05,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:05,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:05,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:05,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:40:05,954 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:05,955 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 30 treesize of output 29 [2019-10-02 00:40:05,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:05,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:05,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:05,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-10-02 00:40:05,976 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:05,977 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 30 treesize of output 29 [2019-10-02 00:40:05,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:05,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:05,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:05,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-10-02 00:40:05,999 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:05,999 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 30 treesize of output 29 [2019-10-02 00:40:06,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:06,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:06,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:40:06,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2019-10-02 00:40:06,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:06,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-10-02 00:40:06,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:06,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:40:06,196 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 00:40:06,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:06,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-10-02 00:40:06,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 00:40:06,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:06,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2019-10-02 00:40:06,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 00:40:06,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 00:40:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:40:06,303 INFO L87 Difference]: Start difference. First operand 3257 states and 5048 transitions. Second operand 23 states. [2019-10-02 00:40:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:26,251 INFO L93 Difference]: Finished difference Result 14993 states and 24050 transitions. [2019-10-02 00:40:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-10-02 00:40:26,252 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2019-10-02 00:40:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:26,291 INFO L225 Difference]: With dead ends: 14993 [2019-10-02 00:40:26,291 INFO L226 Difference]: Without dead ends: 14991 [2019-10-02 00:40:26,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10697 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2086, Invalid=24646, Unknown=0, NotChecked=0, Total=26732 [2019-10-02 00:40:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14991 states. [2019-10-02 00:40:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14991 to 6785. [2019-10-02 00:40:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6785 states. [2019-10-02 00:40:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6785 states to 6785 states and 10707 transitions. [2019-10-02 00:40:27,575 INFO L78 Accepts]: Start accepts. Automaton has 6785 states and 10707 transitions. Word has length 127 [2019-10-02 00:40:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:27,575 INFO L475 AbstractCegarLoop]: Abstraction has 6785 states and 10707 transitions. [2019-10-02 00:40:27,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 00:40:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6785 states and 10707 transitions. [2019-10-02 00:40:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:40:27,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:27,588 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:27,589 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:27,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1822089378, now seen corresponding path program 3 times [2019-10-02 00:40:27,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:27,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:27,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 00:40:27,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:27,867 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:27,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:40:28,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 00:40:28,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:28,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 00:40:28,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:28,105 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-10-02 00:40:28,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:28,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:40:28,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:28,231 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-10-02 00:40:28,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:28,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:40:28,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:28,294 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-10-02 00:40:28,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:28,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:40:28,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:28,357 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-10-02 00:40:28,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:28,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:28,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-10-02 00:40:29,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:40:29,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:29,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:29,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:29,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 00:40:29,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 63 proven. 103 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 00:40:29,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-10-02 00:40:29,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 00:40:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 00:40:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:40:29,316 INFO L87 Difference]: Start difference. First operand 6785 states and 10707 transitions. Second operand 32 states. [2019-10-02 00:40:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:52,910 INFO L93 Difference]: Finished difference Result 11656 states and 18320 transitions. [2019-10-02 00:40:52,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-02 00:40:52,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-10-02 00:40:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:52,934 INFO L225 Difference]: With dead ends: 11656 [2019-10-02 00:40:52,934 INFO L226 Difference]: Without dead ends: 11654 [2019-10-02 00:40:52,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 99 SyntacticMatches, 21 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1081, Invalid=7475, Unknown=0, NotChecked=0, Total=8556 [2019-10-02 00:40:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-10-02 00:40:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 6900. [2019-10-02 00:40:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2019-10-02 00:40:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10740 transitions. [2019-10-02 00:40:54,559 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10740 transitions. Word has length 127 [2019-10-02 00:40:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:54,560 INFO L475 AbstractCegarLoop]: Abstraction has 6900 states and 10740 transitions. [2019-10-02 00:40:54,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 00:40:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10740 transitions. [2019-10-02 00:40:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 00:40:54,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:54,570 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:54,570 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -614837119, now seen corresponding path program 8 times [2019-10-02 00:40:54,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:54,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:54,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 14 proven. 117 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-10-02 00:40:54,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:54,850 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:40:54,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:40:54,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:54,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 00:40:54,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:55,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:40:55,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:55,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:40:55,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:55,084 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 30 treesize of output 29 [2019-10-02 00:40:55,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:55,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-10-02 00:40:55,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:55,098 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 24 treesize of output 23 [2019-10-02 00:40:55,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:55,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:40:55,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:40:55,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:55,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-02 00:40:55,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 14 proven. 117 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-10-02 00:40:55,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:55,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-10-02 00:40:55,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 00:40:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 00:40:55,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-10-02 00:40:55,453 INFO L87 Difference]: Start difference. First operand 6900 states and 10740 transitions. Second operand 31 states.