java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:36:29,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:36:29,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:36:29,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:36:29,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:36:29,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:36:29,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:36:29,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:36:29,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:36:29,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:36:29,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:36:29,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:36:29,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:36:29,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:36:29,137 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:36:29,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:36:29,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:36:29,142 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:36:29,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:36:29,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:36:29,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:36:29,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:36:29,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:36:29,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:36:29,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:36:29,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:36:29,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:36:29,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:36:29,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:36:29,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:36:29,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:36:29,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:36:29,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:36:29,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:36:29,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:36:29,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:36:29,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-22 15:36:29,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:36:29,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:36:29,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:36:29,188 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-22 15:36:29,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-22 15:36:29,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-22 15:36:29,190 INFO L133 SettingsManager]: * Use SBE=true [2018-10-22 15:36:29,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:36:29,190 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:36:29,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:36:29,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:36:29,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:36:29,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:36:29,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:36:29,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:36:29,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:36:29,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:36:29,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:36:29,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:36:29,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:36:29,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:36:29,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:36:29,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:36:29,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-22 15:36:29,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:36:29,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:36:29,195 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:36:29,195 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:36:29,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:36:29,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:36:29,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:36:29,275 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:36:29,276 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:36:29,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-22 15:36:29,342 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/88d55a2ff/faf79c17a34f4c4e975486833625b493/FLAG8da8bae3f [2018-10-22 15:36:29,836 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:36:29,836 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-22 15:36:29,843 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/88d55a2ff/faf79c17a34f4c4e975486833625b493/FLAG8da8bae3f [2018-10-22 15:36:29,857 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/88d55a2ff/faf79c17a34f4c4e975486833625b493 [2018-10-22 15:36:29,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:36:29,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:36:29,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:36:29,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:36:29,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:36:29,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:36:29" (1/1) ... [2018-10-22 15:36:29,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fe9958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:29, skipping insertion in model container [2018-10-22 15:36:29,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:36:29" (1/1) ... [2018-10-22 15:36:29,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:36:29,906 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:36:30,094 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:36:30,098 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:36:30,120 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:36:30,138 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:36:30,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30 WrapperNode [2018-10-22 15:36:30,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:36:30,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:36:30,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:36:30,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:36:30,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:36:30,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:36:30,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:36:30,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:36:30,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... [2018-10-22 15:36:30,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:36:30,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:36:30,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:36:30,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:36:30,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:36:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-22 15:36:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:36:30,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:36:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-22 15:36:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-22 15:36:30,775 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:36:30,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:36:30 BoogieIcfgContainer [2018-10-22 15:36:30,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:36:30,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:36:30,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:36:30,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:36:30,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:36:29" (1/3) ... [2018-10-22 15:36:30,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30df2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:36:30, skipping insertion in model container [2018-10-22 15:36:30,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:30" (2/3) ... [2018-10-22 15:36:30,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30df2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:36:30, skipping insertion in model container [2018-10-22 15:36:30,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:36:30" (3/3) ... [2018-10-22 15:36:30,784 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-10-22 15:36:30,795 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:36:30,803 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:36:30,821 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:36:30,853 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:36:30,854 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:36:30,854 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:36:30,854 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:36:30,854 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:36:30,854 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:36:30,854 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:36:30,855 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:36:30,855 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:36:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-22 15:36:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-22 15:36:30,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:30,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:30,885 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1716488208, now seen corresponding path program 1 times [2018-10-22 15:36:30,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:30,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:30,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:30,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:31,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:31,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 15:36:31,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 15:36:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 15:36:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:36:31,042 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-10-22 15:36:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:31,064 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-10-22 15:36:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 15:36:31,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-22 15:36:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:31,078 INFO L225 Difference]: With dead ends: 66 [2018-10-22 15:36:31,078 INFO L226 Difference]: Without dead ends: 28 [2018-10-22 15:36:31,082 INFO L605 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 [2018-10-22 15:36:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-22 15:36:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-22 15:36:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-22 15:36:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-22 15:36:31,124 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 11 [2018-10-22 15:36:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:31,124 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-22 15:36:31,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 15:36:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-22 15:36:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-22 15:36:31,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:31,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:31,126 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:31,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash -900053778, now seen corresponding path program 1 times [2018-10-22 15:36:31,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:31,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:31,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:31,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 15:36:31,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 15:36:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 15:36:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:31,545 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-10-22 15:36:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:31,810 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-10-22 15:36:31,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 15:36:31,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-22 15:36:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:31,812 INFO L225 Difference]: With dead ends: 56 [2018-10-22 15:36:31,812 INFO L226 Difference]: Without dead ends: 43 [2018-10-22 15:36:31,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:36:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-22 15:36:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-22 15:36:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-22 15:36:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-10-22 15:36:31,827 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2018-10-22 15:36:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:31,828 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-22 15:36:31,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 15:36:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-10-22 15:36:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-22 15:36:31,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:31,829 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:31,829 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:31,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash 932193404, now seen corresponding path program 1 times [2018-10-22 15:36:31,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:32,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:32,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 15:36:32,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 15:36:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 15:36:32,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:32,068 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-10-22 15:36:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:32,298 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-10-22 15:36:32,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-22 15:36:32,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-22 15:36:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:32,300 INFO L225 Difference]: With dead ends: 82 [2018-10-22 15:36:32,301 INFO L226 Difference]: Without dead ends: 56 [2018-10-22 15:36:32,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-22 15:36:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-22 15:36:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2018-10-22 15:36:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-22 15:36:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-22 15:36:32,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-10-22 15:36:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:32,308 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-22 15:36:32,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 15:36:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-22 15:36:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-22 15:36:32,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:32,310 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:32,310 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:32,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:32,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1844764543, now seen corresponding path program 1 times [2018-10-22 15:36:32,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:32,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:32,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:32,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:32,837 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-10-22 15:36:32,977 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2018-10-22 15:36:33,430 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-22 15:36:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:33,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:33,573 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:33,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:33,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:34,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:34,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:34,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:34,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:34,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:34,178 INFO L267 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. [2018-10-22 15:36:34,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-22 15:36:34,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:36:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:34,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:34,499 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:34,501 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:34,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-22 15:36:34,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:34,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:34,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:34,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-22 15:36:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:34,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-10-22 15:36:34,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-22 15:36:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-22 15:36:34,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-22 15:36:34,598 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 23 states. [2018-10-22 15:36:34,824 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 15 [2018-10-22 15:36:34,987 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-10-22 15:36:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:36,335 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-10-22 15:36:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-22 15:36:36,336 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-10-22 15:36:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:36,338 INFO L225 Difference]: With dead ends: 106 [2018-10-22 15:36:36,338 INFO L226 Difference]: Without dead ends: 104 [2018-10-22 15:36:36,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2018-10-22 15:36:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-22 15:36:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2018-10-22 15:36:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-22 15:36:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-10-22 15:36:36,351 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 24 [2018-10-22 15:36:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:36,352 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-10-22 15:36:36,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-22 15:36:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-10-22 15:36:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-22 15:36:36,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:36,354 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:36,355 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:36,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1668399199, now seen corresponding path program 1 times [2018-10-22 15:36:36,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:36,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:37,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:37,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:37,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:37,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:37,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:37,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:36:37,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:37,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:37,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:37,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:36:38,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:36:38,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,279 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:38,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-22 15:36:38,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:38,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:38,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-22 15:36:38,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:36:38,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:38,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:38,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:38,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-22 15:36:38,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:38,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:38,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:38,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:36:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:38,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:38,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-10-22 15:36:38,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:36:38,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:36:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:36:38,531 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 33 states. [2018-10-22 15:36:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:40,511 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-10-22 15:36:40,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-22 15:36:40,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 31 [2018-10-22 15:36:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:40,514 INFO L225 Difference]: With dead ends: 160 [2018-10-22 15:36:40,514 INFO L226 Difference]: Without dead ends: 110 [2018-10-22 15:36:40,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=331, Invalid=2021, Unknown=0, NotChecked=0, Total=2352 [2018-10-22 15:36:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-22 15:36:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 59. [2018-10-22 15:36:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-22 15:36:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-10-22 15:36:40,525 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 31 [2018-10-22 15:36:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:40,525 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-22 15:36:40,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:36:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-10-22 15:36:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-22 15:36:40,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:40,527 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:40,527 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:40,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1970442993, now seen corresponding path program 1 times [2018-10-22 15:36:40,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:40,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:40,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:40,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:40,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:40,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:40,746 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:40,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:40,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:40,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-22 15:36:40,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-22 15:36:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-22 15:36:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-22 15:36:40,980 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 8 states. [2018-10-22 15:36:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:41,348 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-22 15:36:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-22 15:36:41,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-22 15:36:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:41,349 INFO L225 Difference]: With dead ends: 89 [2018-10-22 15:36:41,349 INFO L226 Difference]: Without dead ends: 68 [2018-10-22 15:36:41,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-22 15:36:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2018-10-22 15:36:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-22 15:36:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-22 15:36:41,360 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-10-22 15:36:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:41,360 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-22 15:36:41,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-22 15:36:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-22 15:36:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-22 15:36:41,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:41,363 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:41,363 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:41,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1689200784, now seen corresponding path program 2 times [2018-10-22 15:36:41,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:42,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:42,055 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:42,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:42,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:42,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:42,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:42,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:42,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:42,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:42,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-22 15:36:42,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:36:42,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:42,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:42,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:42,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:36:42,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,652 INFO L267 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. [2018-10-22 15:36:42,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-22 15:36:42,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:42,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:42,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:42,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:42,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 21 [2018-10-22 15:36:42,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-22 15:36:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-22 15:36:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-22 15:36:42,989 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 21 states. [2018-10-22 15:36:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:44,337 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-10-22 15:36:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-22 15:36:44,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-10-22 15:36:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:44,339 INFO L225 Difference]: With dead ends: 156 [2018-10-22 15:36:44,340 INFO L226 Difference]: Without dead ends: 154 [2018-10-22 15:36:44,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2018-10-22 15:36:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-22 15:36:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 75. [2018-10-22 15:36:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-22 15:36:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-10-22 15:36:44,352 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 36 [2018-10-22 15:36:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:44,353 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-10-22 15:36:44,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-22 15:36:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-10-22 15:36:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-22 15:36:44,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:44,354 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-22 15:36:44,355 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:44,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:44,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1168074162, now seen corresponding path program 2 times [2018-10-22 15:36:44,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:44,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:44,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:45,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:45,362 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:45,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:45,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:45,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:45,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:45,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:45,882 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:45,904 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:45,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-22 15:36:45,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:52 [2018-10-22 15:36:46,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:36:46,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:46,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:36:46,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-22 15:36:46,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:36:46,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:36:46,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,599 INFO L267 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. [2018-10-22 15:36:46,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-10-22 15:36:46,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:36:46,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:46,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:36:46,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:46,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:36:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:46,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:46,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 31 [2018-10-22 15:36:46,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-22 15:36:46,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-22 15:36:46,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-10-22 15:36:46,732 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 31 states. [2018-10-22 15:36:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:48,808 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2018-10-22 15:36:48,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-22 15:36:48,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-10-22 15:36:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:48,810 INFO L225 Difference]: With dead ends: 204 [2018-10-22 15:36:48,810 INFO L226 Difference]: Without dead ends: 175 [2018-10-22 15:36:48,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=394, Invalid=2576, Unknown=0, NotChecked=0, Total=2970 [2018-10-22 15:36:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-22 15:36:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 94. [2018-10-22 15:36:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-22 15:36:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-10-22 15:36:48,824 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 43 [2018-10-22 15:36:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:48,825 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-10-22 15:36:48,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-22 15:36:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-10-22 15:36:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-22 15:36:48,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:48,827 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-22 15:36:48,827 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:48,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1672228496, now seen corresponding path program 3 times [2018-10-22 15:36:48,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:48,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:48,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:48,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:48,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:48,953 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:48,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:36:48,985 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-22 15:36:48,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:48,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-22 15:36:49,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-22 15:36:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-22 15:36:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:36:49,014 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 7 states. [2018-10-22 15:36:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:49,442 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-10-22 15:36:49,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 15:36:49,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-22 15:36:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:49,450 INFO L225 Difference]: With dead ends: 176 [2018-10-22 15:36:49,450 INFO L226 Difference]: Without dead ends: 146 [2018-10-22 15:36:49,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:36:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-22 15:36:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 80. [2018-10-22 15:36:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-22 15:36:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-10-22 15:36:49,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 43 [2018-10-22 15:36:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:49,463 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-10-22 15:36:49,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-22 15:36:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-10-22 15:36:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-22 15:36:49,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:49,466 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-22 15:36:49,466 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:49,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2089151200, now seen corresponding path program 2 times [2018-10-22 15:36:49,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:49,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:49,988 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 5 [2018-10-22 15:36:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:50,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:50,458 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:50,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:50,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:50,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:50,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:36:50,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:50,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:36:50,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-22 15:36:50,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:50,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:50,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:50,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:50,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-22 15:36:50,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-22 15:36:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-22 15:36:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:36:50,940 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 29 states. [2018-10-22 15:36:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:52,343 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-10-22 15:36:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-22 15:36:52,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-22 15:36:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:52,346 INFO L225 Difference]: With dead ends: 161 [2018-10-22 15:36:52,346 INFO L226 Difference]: Without dead ends: 159 [2018-10-22 15:36:52,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-10-22 15:36:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-22 15:36:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2018-10-22 15:36:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-22 15:36:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-10-22 15:36:52,360 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2018-10-22 15:36:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:52,360 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-10-22 15:36:52,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-22 15:36:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-10-22 15:36:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-22 15:36:52,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:52,362 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:52,362 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:52,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1333715085, now seen corresponding path program 1 times [2018-10-22 15:36:52,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:52,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:52,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:52,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:53,120 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-22 15:36:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:53,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:53,397 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:53,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:53,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:53,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:53,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:53,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:53,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,724 INFO L267 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. [2018-10-22 15:36:53,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-22 15:36:53,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:36:53,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:53,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:53,828 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:53,829 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:53,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-22 15:36:53,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-22 15:36:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:53,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:53,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-10-22 15:36:53,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-22 15:36:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-22 15:36:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-10-22 15:36:53,889 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 28 states. [2018-10-22 15:36:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:55,994 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2018-10-22 15:36:55,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-22 15:36:55,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2018-10-22 15:36:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:55,997 INFO L225 Difference]: With dead ends: 223 [2018-10-22 15:36:55,997 INFO L226 Difference]: Without dead ends: 221 [2018-10-22 15:36:55,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=647, Invalid=2545, Unknown=0, NotChecked=0, Total=3192 [2018-10-22 15:36:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-22 15:36:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 121. [2018-10-22 15:36:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-22 15:36:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-10-22 15:36:56,016 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-10-22 15:36:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:56,017 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-10-22 15:36:56,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-22 15:36:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-10-22 15:36:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-22 15:36:56,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:56,018 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:56,018 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:56,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:56,019 INFO L82 PathProgramCache]: Analyzing trace with hash 288089389, now seen corresponding path program 4 times [2018-10-22 15:36:56,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:56,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:56,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:56,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:56,778 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:36:56,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:36:56,804 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:36:56,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:56,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:57,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:57,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:36:57,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-22 15:36:57,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:36:57,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,631 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:57,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-22 15:36:57,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:57,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2018-10-22 15:36:57,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:36:57,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:57,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,883 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,883 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:57,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:57,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-22 15:36:57,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:57,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:36:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-22 15:36:57,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:57,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-10-22 15:36:57,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:36:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:36:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:36:58,000 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 33 states. [2018-10-22 15:37:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:02,282 INFO L93 Difference]: Finished difference Result 312 states and 341 transitions. [2018-10-22 15:37:02,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-22 15:37:02,282 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2018-10-22 15:37:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:02,285 INFO L225 Difference]: With dead ends: 312 [2018-10-22 15:37:02,286 INFO L226 Difference]: Without dead ends: 253 [2018-10-22 15:37:02,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4236 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1147, Invalid=10843, Unknown=0, NotChecked=0, Total=11990 [2018-10-22 15:37:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-22 15:37:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 121. [2018-10-22 15:37:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-22 15:37:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-10-22 15:37:02,306 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 52 [2018-10-22 15:37:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:02,307 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-10-22 15:37:02,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:37:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-10-22 15:37:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-22 15:37:02,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:02,308 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:02,308 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:02,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1256754768, now seen corresponding path program 3 times [2018-10-22 15:37:02,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:02,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:02,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:03,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:03,328 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:03,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:37:03,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-22 15:37:03,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:03,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:03,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:03,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-10-22 15:37:03,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 15:37:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 15:37:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:37:03,536 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 11 states. [2018-10-22 15:37:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:04,074 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2018-10-22 15:37:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:37:04,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-22 15:37:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:04,075 INFO L225 Difference]: With dead ends: 201 [2018-10-22 15:37:04,075 INFO L226 Difference]: Without dead ends: 172 [2018-10-22 15:37:04,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-22 15:37:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-22 15:37:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2018-10-22 15:37:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-22 15:37:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-10-22 15:37:04,094 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 52 [2018-10-22 15:37:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:04,094 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-10-22 15:37:04,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 15:37:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-10-22 15:37:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-22 15:37:04,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:04,095 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:04,095 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:04,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1448838909, now seen corresponding path program 1 times [2018-10-22 15:37:04,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:04,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:04,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:04,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:04,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:04,609 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-22 15:37:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:05,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:05,074 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:05,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:05,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:05,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:05,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:37:05,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:37:05,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,765 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,766 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:05,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-22 15:37:05,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:05,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-22 15:37:05,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-22 15:37:05,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:05,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:05,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:05,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-22 15:37:05,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:05,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-22 15:37:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:05,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:05,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-22 15:37:05,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:37:05,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:37:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:37:05,966 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 33 states. [2018-10-22 15:37:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:07,290 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-10-22 15:37:07,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-22 15:37:07,290 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-10-22 15:37:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:07,292 INFO L225 Difference]: With dead ends: 171 [2018-10-22 15:37:07,292 INFO L226 Difference]: Without dead ends: 154 [2018-10-22 15:37:07,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-10-22 15:37:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-22 15:37:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-10-22 15:37:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-22 15:37:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-22 15:37:07,307 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 53 [2018-10-22 15:37:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:07,308 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-22 15:37:07,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:37:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-10-22 15:37:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-22 15:37:07,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:07,309 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:07,309 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:07,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1298017201, now seen corresponding path program 4 times [2018-10-22 15:37:07,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:07,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:07,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:07,822 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 5 [2018-10-22 15:37:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:08,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:08,424 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:08,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:37:08,457 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:37:08,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:08,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:08,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:37:08,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:37:08,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:37:08,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:08,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:08,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:08,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-22 15:37:08,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:37:08,861 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:08,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:08,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:08,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:37:08,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:08,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-22 15:37:09,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:09,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:09,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:09,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:09,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:09,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:09,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:09,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-10-22 15:37:09,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-22 15:37:09,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-22 15:37:09,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-10-22 15:37:09,138 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 36 states. [2018-10-22 15:37:09,884 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2018-10-22 15:37:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:10,549 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-10-22 15:37:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-22 15:37:10,550 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-22 15:37:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:10,552 INFO L225 Difference]: With dead ends: 191 [2018-10-22 15:37:10,552 INFO L226 Difference]: Without dead ends: 189 [2018-10-22 15:37:10,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2018-10-22 15:37:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-22 15:37:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2018-10-22 15:37:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-22 15:37:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2018-10-22 15:37:10,574 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 56 [2018-10-22 15:37:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:10,574 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2018-10-22 15:37:10,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-22 15:37:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2018-10-22 15:37:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-22 15:37:10,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:10,575 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:10,575 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:10,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:10,576 INFO L82 PathProgramCache]: Analyzing trace with hash -927524220, now seen corresponding path program 2 times [2018-10-22 15:37:10,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:10,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:10,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:10,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:11,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:11,466 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:11,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:37:11,499 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:37:11,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:11,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:11,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-22 15:37:11,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:11,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-10-22 15:37:11,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-22 15:37:11,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:37:11,895 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:11,896 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:11,897 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:11,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:37:11,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-22 15:37:11,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:11,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:11,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:11,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:12,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:12,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-10-22 15:37:12,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-22 15:37:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-22 15:37:12,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:37:12,029 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand 29 states. [2018-10-22 15:37:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:13,971 INFO L93 Difference]: Finished difference Result 246 states and 263 transitions. [2018-10-22 15:37:13,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-22 15:37:13,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-10-22 15:37:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:13,973 INFO L225 Difference]: With dead ends: 246 [2018-10-22 15:37:13,973 INFO L226 Difference]: Without dead ends: 244 [2018-10-22 15:37:13,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2018-10-22 15:37:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-22 15:37:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 166. [2018-10-22 15:37:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-22 15:37:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2018-10-22 15:37:13,995 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 57 [2018-10-22 15:37:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:13,995 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2018-10-22 15:37:13,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-22 15:37:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2018-10-22 15:37:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-22 15:37:13,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:13,997 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:13,997 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:13,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash 589290242, now seen corresponding path program 3 times [2018-10-22 15:37:13,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:13,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:15,005 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2018-10-22 15:37:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:15,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:15,869 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:15,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:37:15,909 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 15:37:15,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:15,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:16,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:16,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:16,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,158 INFO L267 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. [2018-10-22 15:37:16,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-10-22 15:37:16,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-22 15:37:16,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 43 [2018-10-22 15:37:16,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-22 15:37:16,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-22 15:37:16,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-10-22 15:37:16,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-10-22 15:37:16,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-22 15:37:16,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-10-22 15:37:16,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2018-10-22 15:37:16,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:16,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:16,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 35 [2018-10-22 15:37:16,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-22 15:37:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-22 15:37:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2018-10-22 15:37:16,712 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand 35 states. [2018-10-22 15:37:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:19,126 INFO L93 Difference]: Finished difference Result 404 states and 436 transitions. [2018-10-22 15:37:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-22 15:37:19,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-10-22 15:37:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:19,128 INFO L225 Difference]: With dead ends: 404 [2018-10-22 15:37:19,128 INFO L226 Difference]: Without dead ends: 402 [2018-10-22 15:37:19,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=684, Invalid=4866, Unknown=0, NotChecked=0, Total=5550 [2018-10-22 15:37:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-22 15:37:19,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 194. [2018-10-22 15:37:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-22 15:37:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 211 transitions. [2018-10-22 15:37:19,159 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 211 transitions. Word has length 57 [2018-10-22 15:37:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:19,159 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 211 transitions. [2018-10-22 15:37:19,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-22 15:37:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 211 transitions. [2018-10-22 15:37:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-22 15:37:19,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:19,160 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2018-10-22 15:37:19,161 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:19,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 594732221, now seen corresponding path program 1 times [2018-10-22 15:37:19,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:19,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:19,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:19,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:19,683 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-22 15:37:20,201 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 14 [2018-10-22 15:37:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:21,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:21,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:21,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:21,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:22,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:22,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:22,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:22,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:22,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:22,366 INFO L267 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. [2018-10-22 15:37:22,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-22 15:37:22,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-22 15:37:22,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:22,596 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:22,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:22,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:22,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 97 [2018-10-22 15:37:22,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:22,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:22,655 INFO L267 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. [2018-10-22 15:37:22,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:51 [2018-10-22 15:37:23,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-10-22 15:37:23,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:23,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,083 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:23,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 115 [2018-10-22 15:37:23,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:23,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:23,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:23,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:44 [2018-10-22 15:37:23,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-10-22 15:37:23,423 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-10-22 15:37:23,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:37:23,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:37:23,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-22 15:37:23,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-10-22 15:37:23,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:37:23,921 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:23,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:23,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-22 15:37:23,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:23,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:23,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:23,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-10-22 15:37:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:24,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-10-22 15:37:24,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-22 15:37:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-22 15:37:24,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2665, Unknown=0, NotChecked=0, Total=2970 [2018-10-22 15:37:24,011 INFO L87 Difference]: Start difference. First operand 194 states and 211 transitions. Second operand 55 states. [2018-10-22 15:37:24,999 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-10-22 15:37:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:28,358 INFO L93 Difference]: Finished difference Result 260 states and 279 transitions. [2018-10-22 15:37:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-22 15:37:28,358 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 60 [2018-10-22 15:37:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:28,359 INFO L225 Difference]: With dead ends: 260 [2018-10-22 15:37:28,360 INFO L226 Difference]: Without dead ends: 243 [2018-10-22 15:37:28,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=807, Invalid=6503, Unknown=0, NotChecked=0, Total=7310 [2018-10-22 15:37:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-22 15:37:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 214. [2018-10-22 15:37:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-22 15:37:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 232 transitions. [2018-10-22 15:37:28,392 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 232 transitions. Word has length 60 [2018-10-22 15:37:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:28,392 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 232 transitions. [2018-10-22 15:37:28,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-22 15:37:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2018-10-22 15:37:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-22 15:37:28,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:28,393 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:28,393 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:28,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:28,394 INFO L82 PathProgramCache]: Analyzing trace with hash -211122400, now seen corresponding path program 5 times [2018-10-22 15:37:28,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:28,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:28,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:28,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:29,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:29,565 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:29,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:37:29,601 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-22 15:37:29,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:29,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:29,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:29,852 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:29,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:29,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:29,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:29,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:29,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:37:30,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:37:30,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,065 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-22 15:37:30,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-10-22 15:37:30,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:37:30,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 77 [2018-10-22 15:37:30,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-10-22 15:37:30,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:37:30,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:37:30,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-22 15:37:30,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:37:30,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:37:30,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-10-22 15:37:30,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:37:30,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:30,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:37:30,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:30,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:37:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:30,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:30,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 37 [2018-10-22 15:37:30,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-22 15:37:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-22 15:37:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2018-10-22 15:37:30,461 INFO L87 Difference]: Start difference. First operand 214 states and 232 transitions. Second operand 37 states. [2018-10-22 15:37:32,467 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-10-22 15:37:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:34,360 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-10-22 15:37:34,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-22 15:37:34,361 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-22 15:37:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:34,362 INFO L225 Difference]: With dead ends: 333 [2018-10-22 15:37:34,362 INFO L226 Difference]: Without dead ends: 331 [2018-10-22 15:37:34,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 46 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=772, Invalid=5390, Unknown=0, NotChecked=0, Total=6162 [2018-10-22 15:37:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-22 15:37:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 198. [2018-10-22 15:37:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-22 15:37:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-10-22 15:37:34,390 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 64 [2018-10-22 15:37:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:34,390 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-10-22 15:37:34,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-22 15:37:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-10-22 15:37:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-22 15:37:34,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:34,392 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:34,392 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:34,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1718281922, now seen corresponding path program 6 times [2018-10-22 15:37:34,392 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:34,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:34,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:35,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:35,353 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:37:35,392 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:37:35,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:35,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:35,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:35,634 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:35,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:35,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:35,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:35,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:35,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:37:36,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:37:36,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,082 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:36,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-22 15:37:36,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:36,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:32 [2018-10-22 15:37:36,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-22 15:37:36,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-22 15:37:36,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:36,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-10-22 15:37:36,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:37:36,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:36,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:36,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:36,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-22 15:37:36,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:36,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:37:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 15:37:36,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:36,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2018-10-22 15:37:36,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-22 15:37:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-22 15:37:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1442, Unknown=0, NotChecked=0, Total=1640 [2018-10-22 15:37:36,499 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 41 states. [2018-10-22 15:37:39,150 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-22 15:37:42,702 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-22 15:37:44,796 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-22 15:37:45,677 WARN L179 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-10-22 15:37:46,227 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-22 15:37:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:46,654 INFO L93 Difference]: Finished difference Result 419 states and 451 transitions. [2018-10-22 15:37:46,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-22 15:37:46,654 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 64 [2018-10-22 15:37:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:46,655 INFO L225 Difference]: With dead ends: 419 [2018-10-22 15:37:46,655 INFO L226 Difference]: Without dead ends: 369 [2018-10-22 15:37:46,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6979 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1969, Invalid=18053, Unknown=0, NotChecked=0, Total=20022 [2018-10-22 15:37:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-22 15:37:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 227. [2018-10-22 15:37:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-22 15:37:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2018-10-22 15:37:46,689 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 64 [2018-10-22 15:37:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:46,689 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2018-10-22 15:37:46,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-22 15:37:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2018-10-22 15:37:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-22 15:37:46,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:46,690 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:46,691 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:46,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 927491905, now seen corresponding path program 5 times [2018-10-22 15:37:46,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:46,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:46,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:46,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:46,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:47,237 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-22 15:37:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:47,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:47,622 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:37:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:37:47,668 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-22 15:37:47,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:47,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:47,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:37:47,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:37:47,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-10-22 15:37:48,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:48,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:48,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,053 INFO L267 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. [2018-10-22 15:37:48,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-22 15:37:48,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-22 15:37:48,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:48,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:48,396 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:48,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-10-22 15:37:48,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-22 15:37:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-22 15:37:48,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-22 15:37:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-22 15:37:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-22 15:37:48,474 INFO L87 Difference]: Start difference. First operand 227 states and 247 transitions. Second operand 37 states. [2018-10-22 15:37:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:50,654 INFO L93 Difference]: Finished difference Result 407 states and 439 transitions. [2018-10-22 15:37:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-22 15:37:50,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-22 15:37:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:50,656 INFO L225 Difference]: With dead ends: 407 [2018-10-22 15:37:50,656 INFO L226 Difference]: Without dead ends: 405 [2018-10-22 15:37:50,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=408, Invalid=3498, Unknown=0, NotChecked=0, Total=3906 [2018-10-22 15:37:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-22 15:37:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 287. [2018-10-22 15:37:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-22 15:37:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2018-10-22 15:37:50,702 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 64 [2018-10-22 15:37:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:50,702 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2018-10-22 15:37:50,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-22 15:37:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2018-10-22 15:37:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-22 15:37:50,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:50,703 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:50,704 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:50,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1371876588, now seen corresponding path program 2 times [2018-10-22 15:37:50,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:50,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:50,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:51,232 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-22 15:37:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:52,012 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:52,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:37:52,065 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:37:52,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:52,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:52,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:52,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:37:52,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:37:52,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:52,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:37:52,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-22 15:37:52,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-22 15:37:52,782 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,784 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-10-22 15:37:52,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-22 15:37:53,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:37:53,061 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:53,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:37:53,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:53,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:53,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:53,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:37:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:53,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:53,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2018-10-22 15:37:53,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-22 15:37:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-22 15:37:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2018-10-22 15:37:53,197 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 45 states. [2018-10-22 15:37:53,589 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-22 15:37:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:54,799 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2018-10-22 15:37:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-22 15:37:54,801 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2018-10-22 15:37:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:54,803 INFO L225 Difference]: With dead ends: 360 [2018-10-22 15:37:54,803 INFO L226 Difference]: Without dead ends: 358 [2018-10-22 15:37:54,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=463, Invalid=3443, Unknown=0, NotChecked=0, Total=3906 [2018-10-22 15:37:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-22 15:37:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2018-10-22 15:37:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-22 15:37:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2018-10-22 15:37:54,856 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 65 [2018-10-22 15:37:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:54,856 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2018-10-22 15:37:54,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-22 15:37:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2018-10-22 15:37:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-22 15:37:54,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:54,858 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:54,858 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:54,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1838298514, now seen corresponding path program 3 times [2018-10-22 15:37:54,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:54,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:54,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:54,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:55,136 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-22 15:37:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:55,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:55,871 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:55,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:37:55,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 15:37:55,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:55,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:56,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:37:56,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:56,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:37:56,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:56,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:56,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:56,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-22 15:37:56,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:56,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:56,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:56,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:56,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:56,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:56,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:56,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-10-22 15:37:56,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-22 15:37:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-22 15:37:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-10-22 15:37:56,323 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 30 states. [2018-10-22 15:37:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:57,987 INFO L93 Difference]: Finished difference Result 486 states and 522 transitions. [2018-10-22 15:37:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-22 15:37:57,988 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-10-22 15:37:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:57,989 INFO L225 Difference]: With dead ends: 486 [2018-10-22 15:37:57,989 INFO L226 Difference]: Without dead ends: 484 [2018-10-22 15:37:57,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=525, Invalid=3635, Unknown=0, NotChecked=0, Total=4160 [2018-10-22 15:37:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-22 15:37:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 313. [2018-10-22 15:37:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-22 15:37:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 344 transitions. [2018-10-22 15:37:58,047 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 344 transitions. Word has length 65 [2018-10-22 15:37:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:58,047 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 344 transitions. [2018-10-22 15:37:58,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-22 15:37:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 344 transitions. [2018-10-22 15:37:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-22 15:37:58,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:58,048 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:58,049 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:58,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash 158141761, now seen corresponding path program 4 times [2018-10-22 15:37:58,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:58,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:58,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:58,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:58,667 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:58,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:37:58,705 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:37:58,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:58,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:58,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:58,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:58,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:58,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:58,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:58,857 INFO L267 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. [2018-10-22 15:37:58,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-10-22 15:37:58,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:58,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:58,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:58,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:58,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:58,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:58,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:58,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 21 [2018-10-22 15:37:58,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-22 15:37:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-22 15:37:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-10-22 15:37:58,975 INFO L87 Difference]: Start difference. First operand 313 states and 344 transitions. Second operand 21 states. [2018-10-22 15:38:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:01,685 INFO L93 Difference]: Finished difference Result 636 states and 687 transitions. [2018-10-22 15:38:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-22 15:38:01,685 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-22 15:38:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:01,687 INFO L225 Difference]: With dead ends: 636 [2018-10-22 15:38:01,687 INFO L226 Difference]: Without dead ends: 578 [2018-10-22 15:38:01,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=667, Invalid=5653, Unknown=0, NotChecked=0, Total=6320 [2018-10-22 15:38:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-22 15:38:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 332. [2018-10-22 15:38:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-22 15:38:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 366 transitions. [2018-10-22 15:38:01,749 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 366 transitions. Word has length 66 [2018-10-22 15:38:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:01,749 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 366 transitions. [2018-10-22 15:38:01,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-22 15:38:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 366 transitions. [2018-10-22 15:38:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-22 15:38:01,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:01,750 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:01,751 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:01,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1160141791, now seen corresponding path program 2 times [2018-10-22 15:38:01,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:01,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:02,125 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-22 15:38:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:04,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:04,124 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:04,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:38:04,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:38:04,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:04,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:04,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:38:04,522 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:04,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-22 15:38:04,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-22 15:38:04,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:38:04,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:04,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:38:04,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-22 15:38:04,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-22 15:38:04,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:04,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:04,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 106 [2018-10-22 15:38:04,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:04,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:05,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:05,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-22 15:38:05,324 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-10-22 15:38:05,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:05,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:05,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 186 [2018-10-22 15:38:05,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:38:05,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:05,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-22 15:38:05,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-10-22 15:38:05,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-10-22 15:38:05,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,723 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,726 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,728 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,729 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,731 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:05,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 161 [2018-10-22 15:38:05,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:38:05,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:38:05,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-22 15:38:05,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-10-22 15:38:06,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:38:06,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:06,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:38:06,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:06,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:06,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:06,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:38:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:06,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:06,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 55 [2018-10-22 15:38:06,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-22 15:38:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-22 15:38:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2667, Unknown=0, NotChecked=0, Total=2970 [2018-10-22 15:38:06,176 INFO L87 Difference]: Start difference. First operand 332 states and 366 transitions. Second operand 55 states. [2018-10-22 15:38:09,428 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-10-22 15:38:10,590 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-22 15:38:11,036 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-22 15:38:11,228 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-10-22 15:38:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:11,325 INFO L93 Difference]: Finished difference Result 434 states and 472 transitions. [2018-10-22 15:38:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-22 15:38:11,325 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2018-10-22 15:38:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:11,327 INFO L225 Difference]: With dead ends: 434 [2018-10-22 15:38:11,327 INFO L226 Difference]: Without dead ends: 417 [2018-10-22 15:38:11,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=960, Invalid=8160, Unknown=0, NotChecked=0, Total=9120 [2018-10-22 15:38:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-22 15:38:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 285. [2018-10-22 15:38:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-22 15:38:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 316 transitions. [2018-10-22 15:38:11,369 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 316 transitions. Word has length 67 [2018-10-22 15:38:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:11,370 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 316 transitions. [2018-10-22 15:38:11,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-22 15:38:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 316 transitions. [2018-10-22 15:38:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-22 15:38:11,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:11,371 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:11,371 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:11,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash -235702322, now seen corresponding path program 3 times [2018-10-22 15:38:11,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:11,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:11,875 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-22 15:38:12,060 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 14 [2018-10-22 15:38:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:14,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:14,057 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:14,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:38:14,098 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-22 15:38:14,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:14,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:14,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:38:14,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:38:14,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:14,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:14,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:14,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-22 15:38:14,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-10-22 15:38:14,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:14,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 80 [2018-10-22 15:38:14,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:14,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:14,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:14,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:46 [2018-10-22 15:38:14,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-10-22 15:38:14,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:14,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 136 [2018-10-22 15:38:14,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-22 15:38:14,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-22 15:38:14,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-22 15:38:14,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:192 [2018-10-22 15:38:15,083 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-10-22 15:38:15,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-10-22 15:38:15,491 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:15,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:15,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:15,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:15,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2018-10-22 15:38:15,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:15,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:15,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:15,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-10-22 15:38:15,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-22 15:38:15,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:15,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:15,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:15,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 70 [2018-10-22 15:38:15,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:15,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:15,779 INFO L267 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. [2018-10-22 15:38:15,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:29 [2018-10-22 15:38:16,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:38:16,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:38:16,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:16,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:16,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:16,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:38:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:16,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:16,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 50 [2018-10-22 15:38:16,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-22 15:38:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-22 15:38:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2250, Unknown=0, NotChecked=0, Total=2450 [2018-10-22 15:38:16,108 INFO L87 Difference]: Start difference. First operand 285 states and 316 transitions. Second operand 50 states. [2018-10-22 15:38:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:20,495 INFO L93 Difference]: Finished difference Result 453 states and 493 transitions. [2018-10-22 15:38:20,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-22 15:38:20,495 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-10-22 15:38:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:20,497 INFO L225 Difference]: With dead ends: 453 [2018-10-22 15:38:20,497 INFO L226 Difference]: Without dead ends: 451 [2018-10-22 15:38:20,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 47 SyntacticMatches, 19 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=674, Invalid=7158, Unknown=0, NotChecked=0, Total=7832 [2018-10-22 15:38:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-22 15:38:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 341. [2018-10-22 15:38:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-22 15:38:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 378 transitions. [2018-10-22 15:38:20,559 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 378 transitions. Word has length 72 [2018-10-22 15:38:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:20,559 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 378 transitions. [2018-10-22 15:38:20,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-22 15:38:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 378 transitions. [2018-10-22 15:38:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-22 15:38:20,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:20,560 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:20,560 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:20,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1018817839, now seen corresponding path program 6 times [2018-10-22 15:38:20,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:20,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:21,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:21,121 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:38:21,168 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-22 15:38:21,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:21,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:21,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:21,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-22 15:38:21,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 15:38:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 15:38:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:38:21,270 INFO L87 Difference]: Start difference. First operand 341 states and 378 transitions. Second operand 14 states. [2018-10-22 15:38:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:21,876 INFO L93 Difference]: Finished difference Result 510 states and 558 transitions. [2018-10-22 15:38:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 15:38:21,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-22 15:38:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:21,878 INFO L225 Difference]: With dead ends: 510 [2018-10-22 15:38:21,878 INFO L226 Difference]: Without dead ends: 473 [2018-10-22 15:38:21,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-10-22 15:38:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-22 15:38:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 361. [2018-10-22 15:38:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-22 15:38:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 396 transitions. [2018-10-22 15:38:21,947 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 396 transitions. Word has length 72 [2018-10-22 15:38:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:21,947 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 396 transitions. [2018-10-22 15:38:21,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 15:38:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 396 transitions. [2018-10-22 15:38:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-22 15:38:21,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:21,949 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:21,949 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:21,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1685520350, now seen corresponding path program 4 times [2018-10-22 15:38:21,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:21,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:21,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:21,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:21,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:22,582 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-22 15:38:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:22,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:22,952 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:22,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:38:23,006 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:38:23,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:23,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:23,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:38:23,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:38:23,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-22 15:38:23,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-10-22 15:38:23,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-10-22 15:38:23,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:17 [2018-10-22 15:38:23,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-22 15:38:23,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:23,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,458 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:23,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:23,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-22 15:38:23,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:23,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-22 15:38:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:23,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:23,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2018-10-22 15:38:23,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-22 15:38:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-22 15:38:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-10-22 15:38:23,526 INFO L87 Difference]: Start difference. First operand 361 states and 396 transitions. Second operand 34 states. [2018-10-22 15:38:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:24,941 INFO L93 Difference]: Finished difference Result 427 states and 462 transitions. [2018-10-22 15:38:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-22 15:38:24,942 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-10-22 15:38:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:24,944 INFO L225 Difference]: With dead ends: 427 [2018-10-22 15:38:24,944 INFO L226 Difference]: Without dead ends: 402 [2018-10-22 15:38:24,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2018-10-22 15:38:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-22 15:38:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 348. [2018-10-22 15:38:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-22 15:38:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 381 transitions. [2018-10-22 15:38:24,999 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 381 transitions. Word has length 73 [2018-10-22 15:38:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:25,000 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 381 transitions. [2018-10-22 15:38:25,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-22 15:38:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 381 transitions. [2018-10-22 15:38:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-22 15:38:25,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:25,001 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:25,001 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:25,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1855670063, now seen corresponding path program 5 times [2018-10-22 15:38:25,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:25,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:25,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:25,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:25,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:25,338 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-22 15:38:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:25,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:25,894 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:25,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:38:25,943 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-22 15:38:25,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:25,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:26,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:38:26,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:38:26,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:38:26,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-22 15:38:26,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-22 15:38:26,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,447 INFO L267 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. [2018-10-22 15:38:26,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2018-10-22 15:38:26,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-22 15:38:26,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,726 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,726 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:26,727 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:26,728 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:26,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-22 15:38:26,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:26,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-10-22 15:38:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 19 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:26,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:26,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-10-22 15:38:26,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-22 15:38:26,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-22 15:38:26,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-10-22 15:38:26,806 INFO L87 Difference]: Start difference. First operand 348 states and 381 transitions. Second operand 39 states. [2018-10-22 15:38:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:31,607 INFO L93 Difference]: Finished difference Result 447 states and 480 transitions. [2018-10-22 15:38:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-22 15:38:31,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-10-22 15:38:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:31,609 INFO L225 Difference]: With dead ends: 447 [2018-10-22 15:38:31,609 INFO L226 Difference]: Without dead ends: 445 [2018-10-22 15:38:31,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3243 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=979, Invalid=9941, Unknown=0, NotChecked=0, Total=10920 [2018-10-22 15:38:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-22 15:38:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 357. [2018-10-22 15:38:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-22 15:38:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 390 transitions. [2018-10-22 15:38:31,667 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 390 transitions. Word has length 74 [2018-10-22 15:38:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:31,667 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 390 transitions. [2018-10-22 15:38:31,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-22 15:38:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 390 transitions. [2018-10-22 15:38:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-22 15:38:31,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:31,669 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:31,669 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:31,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1860733778, now seen corresponding path program 7 times [2018-10-22 15:38:31,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:31,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:31,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:32,109 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-22 15:38:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:32,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:32,585 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:38:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:32,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:32,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:38:32,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:38:32,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:38:32,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-22 15:38:32,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:32,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-10-22 15:38:32,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-22 15:38:32,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:38:32,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:32,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:32,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-10-22 15:38:32,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-22 15:38:32,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-22 15:38:32,957 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:32,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:32,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:32,959 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:32,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2018-10-22 15:38:32,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:32,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-22 15:38:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:33,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:33,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2018-10-22 15:38:33,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-22 15:38:33,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-22 15:38:33,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-22 15:38:33,032 INFO L87 Difference]: Start difference. First operand 357 states and 390 transitions. Second operand 27 states. [2018-10-22 15:38:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:34,687 INFO L93 Difference]: Finished difference Result 488 states and 526 transitions. [2018-10-22 15:38:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-22 15:38:34,687 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-10-22 15:38:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:34,689 INFO L225 Difference]: With dead ends: 488 [2018-10-22 15:38:34,689 INFO L226 Difference]: Without dead ends: 486 [2018-10-22 15:38:34,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-10-22 15:38:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-22 15:38:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 408. [2018-10-22 15:38:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-22 15:38:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 446 transitions. [2018-10-22 15:38:34,765 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 446 transitions. Word has length 76 [2018-10-22 15:38:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:34,766 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 446 transitions. [2018-10-22 15:38:34,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-22 15:38:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 446 transitions. [2018-10-22 15:38:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-22 15:38:34,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:34,767 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:34,767 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:34,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1758305189, now seen corresponding path program 6 times [2018-10-22 15:38:34,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:34,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:38:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:35,373 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-22 15:38:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:36,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:36,295 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:36,302 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:38:36,344 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:38:36,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:36,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:36,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:38:36,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:38:36,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:38:36,791 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:38:36,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,797 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-22 15:38:36,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-22 15:38:36,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-22 15:38:36,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:36,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 73 [2018-10-22 15:38:36,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:36,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2018-10-22 15:38:37,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:38:37,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:37,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:37,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:37,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:37,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:38:37,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:37,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:37,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:37,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-22 15:38:37,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:38:37,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:37,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:38:37,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:37,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:37,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:37,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:38:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:37,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:37,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 48 [2018-10-22 15:38:37,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-22 15:38:37,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-22 15:38:37,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2018-10-22 15:38:37,413 INFO L87 Difference]: Start difference. First operand 408 states and 446 transitions. Second operand 48 states. [2018-10-22 15:38:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:39,552 INFO L93 Difference]: Finished difference Result 567 states and 614 transitions. [2018-10-22 15:38:39,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-22 15:38:39,552 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 77 [2018-10-22 15:38:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:39,555 INFO L225 Difference]: With dead ends: 567 [2018-10-22 15:38:39,555 INFO L226 Difference]: Without dead ends: 565 [2018-10-22 15:38:39,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=603, Invalid=4947, Unknown=0, NotChecked=0, Total=5550 [2018-10-22 15:38:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-22 15:38:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 430. [2018-10-22 15:38:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-22 15:38:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 471 transitions. [2018-10-22 15:38:39,639 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 471 transitions. Word has length 77 [2018-10-22 15:38:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:39,639 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 471 transitions. [2018-10-22 15:38:39,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-22 15:38:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 471 transitions. [2018-10-22 15:38:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-22 15:38:39,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:39,641 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:39,641 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:39,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1788817699, now seen corresponding path program 7 times [2018-10-22 15:38:39,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:39,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:39,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:39,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:39,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:40,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:40,579 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:40,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:38:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:40,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:40,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-22 15:38:40,776 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:40,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-10-22 15:38:40,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:40,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:40,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:40,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-22 15:38:40,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:38:40,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:40,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:40,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:40,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-10-22 15:38:40,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:40,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:40,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:40,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-22 15:38:41,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-22 15:38:41,011 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:41,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:41,012 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:41,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-22 15:38:41,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:41,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:41,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:41,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-22 15:38:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:41,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:41,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-22 15:38:41,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-22 15:38:41,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-22 15:38:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-10-22 15:38:41,083 INFO L87 Difference]: Start difference. First operand 430 states and 471 transitions. Second operand 30 states. [2018-10-22 15:38:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:42,791 INFO L93 Difference]: Finished difference Result 613 states and 664 transitions. [2018-10-22 15:38:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-22 15:38:42,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-10-22 15:38:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:42,794 INFO L225 Difference]: With dead ends: 613 [2018-10-22 15:38:42,794 INFO L226 Difference]: Without dead ends: 611 [2018-10-22 15:38:42,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=379, Invalid=2273, Unknown=0, NotChecked=0, Total=2652 [2018-10-22 15:38:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-22 15:38:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 451. [2018-10-22 15:38:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-22 15:38:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 495 transitions. [2018-10-22 15:38:42,876 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 495 transitions. Word has length 77 [2018-10-22 15:38:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:42,876 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 495 transitions. [2018-10-22 15:38:42,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-22 15:38:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 495 transitions. [2018-10-22 15:38:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-22 15:38:42,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:42,877 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:42,877 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:42,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 704025505, now seen corresponding path program 8 times [2018-10-22 15:38:42,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:42,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:42,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:38:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:43,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:43,741 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:43,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:38:43,774 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:38:43,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:43,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:43,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:38:43,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:43,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:38:43,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-22 15:38:44,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-22 15:38:44,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-10-22 15:38:44,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-10-22 15:38:44,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:38:44,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:38:44,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-10-22 15:38:44,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-22 15:38:44,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:44,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-10-22 15:38:44,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-10-22 15:38:44,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:38:44,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:38:44,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:44,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:38:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:44,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-10-22 15:38:44,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-22 15:38:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-22 15:38:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=0, NotChecked=0, Total=1640 [2018-10-22 15:38:44,572 INFO L87 Difference]: Start difference. First operand 451 states and 495 transitions. Second operand 41 states. [2018-10-22 15:38:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:46,403 INFO L93 Difference]: Finished difference Result 609 states and 662 transitions. [2018-10-22 15:38:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-22 15:38:46,403 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2018-10-22 15:38:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:46,405 INFO L225 Difference]: With dead ends: 609 [2018-10-22 15:38:46,405 INFO L226 Difference]: Without dead ends: 607 [2018-10-22 15:38:46,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=414, Invalid=3618, Unknown=0, NotChecked=0, Total=4032 [2018-10-22 15:38:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-22 15:38:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 472. [2018-10-22 15:38:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-22 15:38:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2018-10-22 15:38:46,499 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 77 [2018-10-22 15:38:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:46,499 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2018-10-22 15:38:46,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-22 15:38:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2018-10-22 15:38:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-22 15:38:46,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:46,501 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:46,501 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:46,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1402389330, now seen corresponding path program 5 times [2018-10-22 15:38:46,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:46,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:47,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:47,657 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:47,665 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:38:47,752 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-22 15:38:47,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:47,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:48,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-22 15:38:48,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:48,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-10-22 15:38:48,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-22 15:38:48,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:38:48,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:48,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:48,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:48,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:38:48,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-22 15:38:48,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:38:48,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:38:48,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:48,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:38:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:48,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:48,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 36 [2018-10-22 15:38:48,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-22 15:38:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-22 15:38:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2018-10-22 15:38:48,413 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand 36 states. [2018-10-22 15:38:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:50,536 INFO L93 Difference]: Finished difference Result 626 states and 680 transitions. [2018-10-22 15:38:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-22 15:38:50,537 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 78 [2018-10-22 15:38:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:50,539 INFO L225 Difference]: With dead ends: 626 [2018-10-22 15:38:50,539 INFO L226 Difference]: Without dead ends: 624 [2018-10-22 15:38:50,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 64 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=420, Invalid=3002, Unknown=0, NotChecked=0, Total=3422 [2018-10-22 15:38:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-22 15:38:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 479. [2018-10-22 15:38:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-22 15:38:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 528 transitions. [2018-10-22 15:38:50,625 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 528 transitions. Word has length 78 [2018-10-22 15:38:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:50,625 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 528 transitions. [2018-10-22 15:38:50,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-22 15:38:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 528 transitions. [2018-10-22 15:38:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-22 15:38:50,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:50,626 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:50,626 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:50,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash -644583150, now seen corresponding path program 6 times [2018-10-22 15:38:50,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:50,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:50,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:50,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:51,023 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-22 15:38:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 20 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:51,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:51,836 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:38:51,898 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:38:51,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:51,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:51,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:38:51,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:51,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:38:51,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:51,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:51,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:51,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-22 15:38:52,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:38:52,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:38:52,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-10-22 15:38:52,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:38:52,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:38:52,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-10-22 15:38:52,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-22 15:38:52,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-10-22 15:38:52,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-22 15:38:52,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-22 15:38:52,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-10-22 15:38:52,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-22 15:38:52,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-22 15:38:52,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:52,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-10-22 15:38:52,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:38:52,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2018-10-22 15:38:52,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:38:52,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:38:52,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:52,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:38:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:52,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:52,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 32 [2018-10-22 15:38:52,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-22 15:38:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-22 15:38:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-10-22 15:38:52,699 INFO L87 Difference]: Start difference. First operand 479 states and 528 transitions. Second operand 32 states. [2018-10-22 15:38:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:56,588 INFO L93 Difference]: Finished difference Result 994 states and 1086 transitions. [2018-10-22 15:38:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-22 15:38:56,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 78 [2018-10-22 15:38:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:56,591 INFO L225 Difference]: With dead ends: 994 [2018-10-22 15:38:56,592 INFO L226 Difference]: Without dead ends: 936 [2018-10-22 15:38:56,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 62 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1043, Invalid=5763, Unknown=0, NotChecked=0, Total=6806 [2018-10-22 15:38:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-10-22 15:38:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 592. [2018-10-22 15:38:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-22 15:38:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 655 transitions. [2018-10-22 15:38:56,710 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 655 transitions. Word has length 78 [2018-10-22 15:38:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:56,710 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 655 transitions. [2018-10-22 15:38:56,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-22 15:38:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 655 transitions. [2018-10-22 15:38:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-22 15:38:56,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:56,712 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:56,712 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:56,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1265415184, now seen corresponding path program 4 times [2018-10-22 15:38:56,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:56,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:56,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:56,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:57,122 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-22 15:38:57,614 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-22 15:38:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:59,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:59,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:38:59,839 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:38:59,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:59,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:00,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:39:00,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:39:00,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-22 15:39:00,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:39:00,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:00,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:39:00,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:29 [2018-10-22 15:39:00,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-10-22 15:39:00,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,866 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:00,868 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,872 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:00,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 137 [2018-10-22 15:39:00,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:00,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:56 [2018-10-22 15:39:01,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2018-10-22 15:39:01,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 140 [2018-10-22 15:39:01,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:39:01,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:01,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:01,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:50 [2018-10-22 15:39:01,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-10-22 15:39:01,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,575 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,687 INFO L303 Elim1Store]: Index analysis took 180 ms [2018-10-22 15:39:01,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 164 [2018-10-22 15:39:01,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:39:01,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:39:01,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:39:01,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:83 [2018-10-22 15:39:01,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-22 15:39:01,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:01,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-22 15:39:01,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:02,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:02,017 INFO L267 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. [2018-10-22 15:39:02,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2018-10-22 15:39:02,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-10-22 15:39:02,533 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:02,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:02,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:02,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:02,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:02,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 53 [2018-10-22 15:39:02,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:02,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:02,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:02,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2018-10-22 15:39:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 13 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:02,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:02,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 70 [2018-10-22 15:39:02,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-22 15:39:02,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-22 15:39:02,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4550, Unknown=0, NotChecked=0, Total=4830 [2018-10-22 15:39:02,708 INFO L87 Difference]: Start difference. First operand 592 states and 655 transitions. Second operand 70 states. [2018-10-22 15:39:06,556 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-22 15:39:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:10,499 INFO L93 Difference]: Finished difference Result 712 states and 780 transitions. [2018-10-22 15:39:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-22 15:39:10,499 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 79 [2018-10-22 15:39:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:10,502 INFO L225 Difference]: With dead ends: 712 [2018-10-22 15:39:10,502 INFO L226 Difference]: Without dead ends: 695 [2018-10-22 15:39:10,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5953 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1113, Invalid=16443, Unknown=0, NotChecked=0, Total=17556 [2018-10-22 15:39:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-22 15:39:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 591. [2018-10-22 15:39:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-22 15:39:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 653 transitions. [2018-10-22 15:39:10,608 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 653 transitions. Word has length 79 [2018-10-22 15:39:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:10,608 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 653 transitions. [2018-10-22 15:39:10,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-22 15:39:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 653 transitions. [2018-10-22 15:39:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-22 15:39:10,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:10,610 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:10,610 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:10,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash 82829615, now seen corresponding path program 5 times [2018-10-22 15:39:10,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:10,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:10,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:10,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:10,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:12,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:12,257 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:12,264 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:39:12,309 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-22 15:39:12,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:12,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:12,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:39:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:39:12,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-22 15:39:12,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:39:12,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2018-10-22 15:39:12,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-10-22 15:39:12,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-22 15:39:12,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-10-22 15:39:12,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-10-22 15:39:12,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-10-22 15:39:12,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,805 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,807 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:12,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 84 [2018-10-22 15:39:12,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:12,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:39:13,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-10-22 15:39:13,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,091 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 153 [2018-10-22 15:39:13,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-22 15:39:13,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:39:13,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:39:13,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:105 [2018-10-22 15:39:13,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-10-22 15:39:13,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:13,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-10-22 15:39:13,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:13,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:13,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:13,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:19 [2018-10-22 15:39:13,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:39:13,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:39:13,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:13,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:13,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:13,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:39:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:14,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 50 [2018-10-22 15:39:14,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-22 15:39:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-22 15:39:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2018-10-22 15:39:14,001 INFO L87 Difference]: Start difference. First operand 591 states and 653 transitions. Second operand 50 states. [2018-10-22 15:39:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:19,991 INFO L93 Difference]: Finished difference Result 1007 states and 1095 transitions. [2018-10-22 15:39:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-22 15:39:19,991 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 81 [2018-10-22 15:39:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:19,996 INFO L225 Difference]: With dead ends: 1007 [2018-10-22 15:39:19,996 INFO L226 Difference]: Without dead ends: 893 [2018-10-22 15:39:19,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 54 SyntacticMatches, 21 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=850, Invalid=12260, Unknown=0, NotChecked=0, Total=13110 [2018-10-22 15:39:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-22 15:39:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 652. [2018-10-22 15:39:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-22 15:39:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 722 transitions. [2018-10-22 15:39:20,109 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 722 transitions. Word has length 81 [2018-10-22 15:39:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:20,109 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 722 transitions. [2018-10-22 15:39:20,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-22 15:39:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 722 transitions. [2018-10-22 15:39:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-22 15:39:20,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:20,111 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:20,111 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:20,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1325388897, now seen corresponding path program 9 times [2018-10-22 15:39:20,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:20,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:20,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:21,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:39:21,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 15:39:21,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:21,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:21,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:39:21,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:21,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:39:21,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:21,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:21,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:21,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-22 15:39:22,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-22 15:39:22,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 84 [2018-10-22 15:39:22,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-22 15:39:22,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-10-22 15:39:22,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 87 [2018-10-22 15:39:22,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:47 [2018-10-22 15:39:22,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-10-22 15:39:22,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,640 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:22,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 79 [2018-10-22 15:39:22,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:22,669 INFO L267 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. [2018-10-22 15:39:22,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:31 [2018-10-22 15:39:23,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-10-22 15:39:23,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:23,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:23,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:23,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-10-22 15:39:23,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:23,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:23,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:23,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:3 [2018-10-22 15:39:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:23,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:23,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 53 [2018-10-22 15:39:23,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-22 15:39:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-22 15:39:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2594, Unknown=0, NotChecked=0, Total=2756 [2018-10-22 15:39:23,258 INFO L87 Difference]: Start difference. First operand 652 states and 722 transitions. Second operand 53 states. [2018-10-22 15:39:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:28,642 INFO L93 Difference]: Finished difference Result 742 states and 817 transitions. [2018-10-22 15:39:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-22 15:39:28,642 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 82 [2018-10-22 15:39:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:28,644 INFO L225 Difference]: With dead ends: 742 [2018-10-22 15:39:28,645 INFO L226 Difference]: Without dead ends: 717 [2018-10-22 15:39:28,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=650, Invalid=8856, Unknown=0, NotChecked=0, Total=9506 [2018-10-22 15:39:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-22 15:39:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 674. [2018-10-22 15:39:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-10-22 15:39:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 746 transitions. [2018-10-22 15:39:28,758 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 746 transitions. Word has length 82 [2018-10-22 15:39:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:28,759 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 746 transitions. [2018-10-22 15:39:28,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-22 15:39:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 746 transitions. [2018-10-22 15:39:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-22 15:39:28,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:28,760 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:28,760 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:28,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:28,761 INFO L82 PathProgramCache]: Analyzing trace with hash -754084382, now seen corresponding path program 8 times [2018-10-22 15:39:28,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:28,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:28,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:29,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:29,462 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:29,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:39:29,499 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:39:29,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:29,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:29,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:39:29,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:39:29,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:29,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:29,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:29,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:39:29,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:39:29,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:29,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:39:29,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:29,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:29,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:29,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-22 15:39:30,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:39:30,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:39:30,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:30,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:30,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:30,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:39:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:30,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:30,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-10-22 15:39:30,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-22 15:39:30,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-22 15:39:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-10-22 15:39:30,217 INFO L87 Difference]: Start difference. First operand 674 states and 746 transitions. Second operand 38 states. [2018-10-22 15:39:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:32,674 INFO L93 Difference]: Finished difference Result 1134 states and 1246 transitions. [2018-10-22 15:39:32,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-22 15:39:32,674 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-10-22 15:39:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:32,678 INFO L225 Difference]: With dead ends: 1134 [2018-10-22 15:39:32,678 INFO L226 Difference]: Without dead ends: 1132 [2018-10-22 15:39:32,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=429, Invalid=3861, Unknown=0, NotChecked=0, Total=4290 [2018-10-22 15:39:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-22 15:39:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 845. [2018-10-22 15:39:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-10-22 15:39:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 940 transitions. [2018-10-22 15:39:32,848 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 940 transitions. Word has length 84 [2018-10-22 15:39:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:32,849 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 940 transitions. [2018-10-22 15:39:32,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-22 15:39:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 940 transitions. [2018-10-22 15:39:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-22 15:39:32,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:32,851 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:32,851 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:32,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1734794316, now seen corresponding path program 7 times [2018-10-22 15:39:32,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:32,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:32,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:33,331 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-22 15:39:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:34,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:34,543 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:34,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:34,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:35,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:39:35,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:35,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:39:35,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:35,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:35,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:35,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:39:35,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:35,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:39:35,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:35,930 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:35,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:35,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-10-22 15:39:35,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:35,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:35,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:39:35,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-10-22 15:39:36,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-22 15:39:36,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,102 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 93 [2018-10-22 15:39:36,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,130 INFO L267 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. [2018-10-22 15:39:36,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-10-22 15:39:36,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-22 15:39:36,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 93 [2018-10-22 15:39:36,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,266 INFO L267 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. [2018-10-22 15:39:36,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-10-22 15:39:36,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-22 15:39:36,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,394 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-22 15:39:36,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,434 INFO L267 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. [2018-10-22 15:39:36,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-22 15:39:36,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-22 15:39:36,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-22 15:39:36,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,582 INFO L267 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. [2018-10-22 15:39:36,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-22 15:39:36,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:39:36,662 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 87 [2018-10-22 15:39:36,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,693 INFO L267 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. [2018-10-22 15:39:36,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-10-22 15:39:36,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:39:36,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,855 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:36,855 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:36,857 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:36,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-22 15:39:36,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:36,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:39:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:36,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 49 [2018-10-22 15:39:36,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-22 15:39:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-22 15:39:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2140, Unknown=0, NotChecked=0, Total=2352 [2018-10-22 15:39:36,957 INFO L87 Difference]: Start difference. First operand 845 states and 940 transitions. Second operand 49 states. [2018-10-22 15:39:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:41,360 INFO L93 Difference]: Finished difference Result 1120 states and 1236 transitions. [2018-10-22 15:39:41,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-22 15:39:41,360 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 85 [2018-10-22 15:39:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:41,364 INFO L225 Difference]: With dead ends: 1120 [2018-10-22 15:39:41,364 INFO L226 Difference]: Without dead ends: 1062 [2018-10-22 15:39:41,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=667, Invalid=7523, Unknown=0, NotChecked=0, Total=8190 [2018-10-22 15:39:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-10-22 15:39:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 879. [2018-10-22 15:39:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-10-22 15:39:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 978 transitions. [2018-10-22 15:39:41,542 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 978 transitions. Word has length 85 [2018-10-22 15:39:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:41,542 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 978 transitions. [2018-10-22 15:39:41,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-22 15:39:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 978 transitions. [2018-10-22 15:39:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-22 15:39:41,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:41,544 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:41,544 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:41,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash -533865805, now seen corresponding path program 10 times [2018-10-22 15:39:41,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:41,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:41,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:42,292 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-10-22 15:39:42,634 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-10-22 15:39:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:43,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:43,241 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:43,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:39:43,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:39:43,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:43,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:43,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:39:43,756 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:43,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:39:43,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:43,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:43,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:43,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:39:43,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:43,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:39:43,897 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:43,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:43,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-22 15:39:43,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:43,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:43,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:43,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-22 15:39:44,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-22 15:39:44,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:44,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:44,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:44,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:44,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-10-22 15:39:44,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:44,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:44,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:44,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-22 15:39:44,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:39:44,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:44,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:39:44,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:44,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:44,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:44,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:39:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:44,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:44,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-10-22 15:39:44,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-22 15:39:44,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-22 15:39:44,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2018-10-22 15:39:44,352 INFO L87 Difference]: Start difference. First operand 879 states and 978 transitions. Second operand 45 states. [2018-10-22 15:39:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:46,240 INFO L93 Difference]: Finished difference Result 1004 states and 1109 transitions. [2018-10-22 15:39:46,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-22 15:39:46,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2018-10-22 15:39:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:46,245 INFO L225 Difference]: With dead ends: 1004 [2018-10-22 15:39:46,245 INFO L226 Difference]: Without dead ends: 1002 [2018-10-22 15:39:46,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=406, Invalid=3884, Unknown=0, NotChecked=0, Total=4290 [2018-10-22 15:39:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-10-22 15:39:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 870. [2018-10-22 15:39:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-10-22 15:39:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 969 transitions. [2018-10-22 15:39:46,399 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 969 transitions. Word has length 85 [2018-10-22 15:39:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:46,400 INFO L481 AbstractCegarLoop]: Abstraction has 870 states and 969 transitions. [2018-10-22 15:39:46,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-22 15:39:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 969 transitions. [2018-10-22 15:39:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-22 15:39:46,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:46,401 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:46,401 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:46,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2068717775, now seen corresponding path program 11 times [2018-10-22 15:39:46,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:46,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:46,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:47,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:47,069 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:47,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:39:47,154 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-22 15:39:47,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:47,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:47,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:39:47,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:39:47,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:39:47,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:39:47,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:39:47,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:39:47,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-22 15:39:47,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-22 15:39:47,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-10-22 15:39:47,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:39:47,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:47,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:39:47,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-22 15:39:47,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:39:47,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:39:47,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:39:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:47,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:47,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-22 15:39:47,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-22 15:39:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-22 15:39:47,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-10-22 15:39:47,858 INFO L87 Difference]: Start difference. First operand 870 states and 969 transitions. Second operand 37 states. [2018-10-22 15:39:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:50,916 INFO L93 Difference]: Finished difference Result 1311 states and 1438 transitions. [2018-10-22 15:39:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-22 15:39:50,916 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 85 [2018-10-22 15:39:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:50,920 INFO L225 Difference]: With dead ends: 1311 [2018-10-22 15:39:50,921 INFO L226 Difference]: Without dead ends: 1309 [2018-10-22 15:39:50,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=787, Invalid=7045, Unknown=0, NotChecked=0, Total=7832 [2018-10-22 15:39:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2018-10-22 15:39:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 949. [2018-10-22 15:39:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2018-10-22 15:39:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1060 transitions. [2018-10-22 15:39:51,127 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1060 transitions. Word has length 85 [2018-10-22 15:39:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:51,128 INFO L481 AbstractCegarLoop]: Abstraction has 949 states and 1060 transitions. [2018-10-22 15:39:51,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-22 15:39:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1060 transitions. [2018-10-22 15:39:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-22 15:39:51,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:51,129 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:51,129 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 570674658, now seen corresponding path program 12 times [2018-10-22 15:39:51,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:51,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:52,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:52,087 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:39:52,164 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:39:52,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:52,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:52,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:39:52,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:39:52,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:39:52,747 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-22 15:39:52,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-22 15:39:52,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-10-22 15:39:52,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:39:52,893 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,895 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,896 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,897 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:52,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:39:52,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:52,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-22 15:39:53,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:39:53,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:53,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:39:53,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:53,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:53,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:53,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:39:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:53,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:53,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-10-22 15:39:53,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-22 15:39:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-22 15:39:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2018-10-22 15:39:53,249 INFO L87 Difference]: Start difference. First operand 949 states and 1060 transitions. Second operand 44 states. [2018-10-22 15:39:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:56,187 INFO L93 Difference]: Finished difference Result 1163 states and 1283 transitions. [2018-10-22 15:39:56,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-22 15:39:56,187 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-10-22 15:39:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:56,191 INFO L225 Difference]: With dead ends: 1163 [2018-10-22 15:39:56,191 INFO L226 Difference]: Without dead ends: 1161 [2018-10-22 15:39:56,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=634, Invalid=4916, Unknown=0, NotChecked=0, Total=5550 [2018-10-22 15:39:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2018-10-22 15:39:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 945. [2018-10-22 15:39:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-10-22 15:39:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1054 transitions. [2018-10-22 15:39:56,371 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1054 transitions. Word has length 86 [2018-10-22 15:39:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:56,371 INFO L481 AbstractCegarLoop]: Abstraction has 945 states and 1054 transitions. [2018-10-22 15:39:56,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-22 15:39:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1054 transitions. [2018-10-22 15:39:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-22 15:39:56,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:56,373 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:56,373 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:56,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash -849888350, now seen corresponding path program 13 times [2018-10-22 15:39:56,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:56,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:56,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:56,879 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:56,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:56,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:57,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:39:57,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:57,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:39:57,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-22 15:39:57,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-22 15:39:57,502 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:57,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:57,504 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:39:57,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-22 15:39:57,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-22 15:39:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:57,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:57,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-10-22 15:39:57,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-22 15:39:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-22 15:39:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-22 15:39:57,567 INFO L87 Difference]: Start difference. First operand 945 states and 1054 transitions. Second operand 24 states. [2018-10-22 15:40:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:01,131 INFO L93 Difference]: Finished difference Result 1403 states and 1537 transitions. [2018-10-22 15:40:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-22 15:40:01,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-10-22 15:40:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:01,138 INFO L225 Difference]: With dead ends: 1403 [2018-10-22 15:40:01,138 INFO L226 Difference]: Without dead ends: 1401 [2018-10-22 15:40:01,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 15 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=704, Invalid=7668, Unknown=0, NotChecked=0, Total=8372 [2018-10-22 15:40:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-22 15:40:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 978. [2018-10-22 15:40:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-10-22 15:40:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1092 transitions. [2018-10-22 15:40:01,344 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1092 transitions. Word has length 86 [2018-10-22 15:40:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:01,344 INFO L481 AbstractCegarLoop]: Abstraction has 978 states and 1092 transitions. [2018-10-22 15:40:01,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-22 15:40:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1092 transitions. [2018-10-22 15:40:01,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-22 15:40:01,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:01,346 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:01,346 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:01,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:01,346 INFO L82 PathProgramCache]: Analyzing trace with hash -107471819, now seen corresponding path program 7 times [2018-10-22 15:40:01,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:01,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:40:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:01,806 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-22 15:40:02,087 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-22 15:40:02,350 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-10-22 15:40:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 5 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:03,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:03,278 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:40:03,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:40:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:03,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:03,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:40:03,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:40:03,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,646 INFO L267 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. [2018-10-22 15:40:03,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-22 15:40:03,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:40:03,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,805 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-10-22 15:40:03,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,830 INFO L267 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. [2018-10-22 15:40:03,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-10-22 15:40:03,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-22 15:40:03,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-10-22 15:40:03,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,985 INFO L267 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. [2018-10-22 15:40:03,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2018-10-22 15:40:04,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-22 15:40:04,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-10-22 15:40:04,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,071 INFO L267 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. [2018-10-22 15:40:04,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2018-10-22 15:40:04,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:40:04,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2018-10-22 15:40:04,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,165 INFO L267 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. [2018-10-22 15:40:04,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-10-22 15:40:04,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:40:04,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:40:04,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:04,320 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:40:04,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-10-22 15:40:04,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-22 15:40:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 6 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:04,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:04,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2018-10-22 15:40:04,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-22 15:40:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-22 15:40:04,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 15:40:04,410 INFO L87 Difference]: Start difference. First operand 978 states and 1092 transitions. Second operand 43 states. [2018-10-22 15:40:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:08,084 INFO L93 Difference]: Finished difference Result 1189 states and 1317 transitions. [2018-10-22 15:40:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-22 15:40:08,085 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2018-10-22 15:40:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:08,090 INFO L225 Difference]: With dead ends: 1189 [2018-10-22 15:40:08,090 INFO L226 Difference]: Without dead ends: 1187 [2018-10-22 15:40:08,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=566, Invalid=5134, Unknown=0, NotChecked=0, Total=5700 [2018-10-22 15:40:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-10-22 15:40:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 993. [2018-10-22 15:40:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-10-22 15:40:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1109 transitions. [2018-10-22 15:40:08,293 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1109 transitions. Word has length 87 [2018-10-22 15:40:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:08,294 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1109 transitions. [2018-10-22 15:40:08,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-22 15:40:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1109 transitions. [2018-10-22 15:40:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-22 15:40:08,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:08,296 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:08,296 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:08,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:08,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1571272399, now seen corresponding path program 8 times [2018-10-22 15:40:08,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:08,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:40:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:08,657 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-22 15:40:08,881 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-22 15:40:09,114 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-22 15:40:09,397 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-22 15:40:09,674 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-22 15:40:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:10,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:10,194 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:40:10,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:40:10,255 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:40:10,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:40:10,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:10,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:40:10,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:10,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:40:10,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:10,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:10,533 INFO L267 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. [2018-10-22 15:40:10,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-10-22 15:40:10,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:40:10,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:40:10,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:10,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:10,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:10,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:40:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 45 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:10,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-22 15:40:10,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-22 15:40:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-22 15:40:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-10-22 15:40:10,747 INFO L87 Difference]: Start difference. First operand 993 states and 1109 transitions. Second operand 30 states. [2018-10-22 15:40:16,620 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-22 15:40:16,970 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-10-22 15:40:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:17,098 INFO L93 Difference]: Finished difference Result 1628 states and 1787 transitions. [2018-10-22 15:40:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-22 15:40:17,098 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-10-22 15:40:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:17,103 INFO L225 Difference]: With dead ends: 1628 [2018-10-22 15:40:17,103 INFO L226 Difference]: Without dead ends: 1556 [2018-10-22 15:40:17,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4679 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1472, Invalid=13290, Unknown=0, NotChecked=0, Total=14762 [2018-10-22 15:40:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-10-22 15:40:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1009. [2018-10-22 15:40:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-10-22 15:40:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1128 transitions. [2018-10-22 15:40:17,299 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1128 transitions. Word has length 87 [2018-10-22 15:40:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:17,299 INFO L481 AbstractCegarLoop]: Abstraction has 1009 states and 1128 transitions. [2018-10-22 15:40:17,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-22 15:40:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1128 transitions. [2018-10-22 15:40:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-22 15:40:17,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:17,300 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:17,301 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:17,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 144675661, now seen corresponding path program 6 times [2018-10-22 15:40:17,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:17,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:40:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:19,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:19,683 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:40:19,692 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:40:19,730 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:40:19,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:40:19,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:19,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:40:19,872 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:40:19,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-22 15:40:19,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-22 15:40:20,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:40:20,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,031 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-22 15:40:20,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-10-22 15:40:20,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-22 15:40:20,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 81 [2018-10-22 15:40:20,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2018-10-22 15:40:20,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:40:20,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 84 [2018-10-22 15:40:20,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2018-10-22 15:40:20,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-22 15:40:20,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,355 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 95 [2018-10-22 15:40:20,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-22 15:40:20,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-10-22 15:40:20,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,683 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:40:20,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 155 [2018-10-22 15:40:20,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:40:20,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2018-10-22 15:40:20,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-10-22 15:40:20,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,962 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 116 [2018-10-22 15:40:20,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,991 INFO L267 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. [2018-10-22 15:40:20,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:37 [2018-10-22 15:40:21,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:40:21,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:21,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:40:21,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:21,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:21,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:21,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:40:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:21,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:21,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31] total 50 [2018-10-22 15:40:21,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-22 15:40:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-22 15:40:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2018-10-22 15:40:21,308 INFO L87 Difference]: Start difference. First operand 1009 states and 1128 transitions. Second operand 50 states. [2018-10-22 15:40:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:25,924 INFO L93 Difference]: Finished difference Result 1360 states and 1513 transitions. [2018-10-22 15:40:25,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-22 15:40:25,925 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 88 [2018-10-22 15:40:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:25,930 INFO L225 Difference]: With dead ends: 1360 [2018-10-22 15:40:25,930 INFO L226 Difference]: Without dead ends: 1105 [2018-10-22 15:40:25,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 62 SyntacticMatches, 24 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=514, Invalid=6458, Unknown=0, NotChecked=0, Total=6972 [2018-10-22 15:40:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-10-22 15:40:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1000. [2018-10-22 15:40:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-10-22 15:40:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1118 transitions. [2018-10-22 15:40:26,170 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1118 transitions. Word has length 88 [2018-10-22 15:40:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:26,170 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1118 transitions. [2018-10-22 15:40:26,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-22 15:40:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1118 transitions. [2018-10-22 15:40:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-22 15:40:26,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:26,171 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:26,171 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:26,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash 704888511, now seen corresponding path program 7 times [2018-10-22 15:40:26,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:26,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:26,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:40:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-22 15:40:26,717 WARN L187 SmtUtils]: Removed 4 from assertion stack [2018-10-22 15:40:26,717 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-22 15:40:26,721 WARN L205 ceAbstractionStarter]: Timeout [2018-10-22 15:40:26,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:40:26 BoogieIcfgContainer [2018-10-22 15:40:26,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:40:26,723 INFO L168 Benchmark]: Toolchain (without parser) took 236855.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -119.8 MB). Peak memory consumption was 658.2 MB. Max. memory is 7.1 GB. [2018-10-22 15:40:26,723 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:40:26,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-22 15:40:26,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:40:26,724 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:40:26,724 INFO L168 Benchmark]: RCFGBuilder took 560.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-10-22 15:40:26,725 INFO L168 Benchmark]: TraceAbstraction took 235944.71 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 53.0 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 637.3 MB). Peak memory consumption was 690.2 MB. Max. memory is 7.1 GB. [2018-10-22 15:40:26,726 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 269.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 560.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235944.71 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 53.0 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 637.3 MB). Peak memory consumption was 690.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. TIMEOUT Result, 235.8s OverallTime, 48 OverallIterations, 7 TraceHistogramMax, 132.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2447 SDtfs, 16752 SDslu, 30804 SDs, 0 SdLazy, 54234 SolverSat, 4715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5565 GetRequests, 2207 SyntacticMatches, 353 SemanticMatches, 3005 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80758 ImplicationChecksByTransitivity, 150.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1009occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 47 MinimizatonAttempts, 6290 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 94.5s InterpolantComputationTime, 5863 NumberOfCodeBlocks, 5851 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 5772 ConstructedInterpolants, 347 QuantifiedInterpolants, 7812644 SizeOfPredicates, 800 NumberOfNonLiveVariables, 5316 ConjunctsInSsa, 1565 ConjunctsInUnsatCore, 91 InterpolantComputations, 3 PerfectInterpolantSequences, 364/7374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown