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-d380424 [2018-10-24 11:45:30,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 11:45:30,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 11:45:30,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 11:45:30,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 11:45:30,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 11:45:30,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 11:45:30,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 11:45:30,957 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 11:45:30,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 11:45:30,959 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 11:45:30,959 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 11:45:30,960 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 11:45:30,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 11:45:30,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 11:45:30,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 11:45:30,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 11:45:30,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 11:45:30,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 11:45:30,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 11:45:30,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 11:45:30,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 11:45:30,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 11:45:30,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 11:45:30,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 11:45:30,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 11:45:30,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 11:45:30,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 11:45:30,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 11:45:30,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 11:45:30,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 11:45:30,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 11:45:30,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 11:45:30,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 11:45:30,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 11:45:30,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 11:45:30,982 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-24 11:45:31,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 11:45:31,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 11:45:31,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 11:45:31,006 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 11:45:31,007 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 11:45:31,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 11:45:31,007 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 11:45:31,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 11:45:31,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 11:45:31,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 11:45:31,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 11:45:31,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 11:45:31,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 11:45:31,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 11:45:31,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 11:45:31,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 11:45:31,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 11:45:31,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 11:45:31,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 11:45:31,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 11:45:31,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 11:45:31,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 11:45:31,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 11:45:31,012 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 11:45:31,013 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 11:45:31,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 11:45:31,013 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 11:45:31,014 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 11:45:31,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 11:45:31,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 11:45:31,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 11:45:31,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 11:45:31,081 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 11:45:31,082 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-24 11:45:31,145 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ab8996963/c82b22a864c046d79eb74827285cf145/FLAG1f9c8a02f [2018-10-24 11:45:31,627 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 11:45:31,628 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-24 11:45:31,637 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ab8996963/c82b22a864c046d79eb74827285cf145/FLAG1f9c8a02f [2018-10-24 11:45:31,653 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ab8996963/c82b22a864c046d79eb74827285cf145 [2018-10-24 11:45:31,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 11:45:31,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 11:45:31,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 11:45:31,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 11:45:31,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 11:45:31,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:31,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405e6276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31, skipping insertion in model container [2018-10-24 11:45:31,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:31,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 11:45:31,713 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 11:45:31,916 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:45:31,920 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 11:45:31,954 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:45:31,980 INFO L193 MainTranslator]: Completed translation [2018-10-24 11:45:31,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31 WrapperNode [2018-10-24 11:45:31,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 11:45:31,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 11:45:31,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 11:45:31,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 11:45:31,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 11:45:32,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 11:45:32,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 11:45:32,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 11:45:32,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (1/1) ... [2018-10-24 11:45:32,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 11:45:32,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 11:45:32,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 11:45:32,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 11:45:32,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (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-24 11:45:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-24 11:45:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 11:45:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 11:45:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-24 11:45:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-24 11:45:32,751 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 11:45:32,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:32 BoogieIcfgContainer [2018-10-24 11:45:32,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 11:45:32,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 11:45:32,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 11:45:32,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 11:45:32,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:31" (1/3) ... [2018-10-24 11:45:32,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:32, skipping insertion in model container [2018-10-24 11:45:32,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:31" (2/3) ... [2018-10-24 11:45:32,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:32, skipping insertion in model container [2018-10-24 11:45:32,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:32" (3/3) ... [2018-10-24 11:45:32,761 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-10-24 11:45:32,770 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 11:45:32,779 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 11:45:32,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 11:45:32,831 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 11:45:32,832 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 11:45:32,832 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 11:45:32,833 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 11:45:32,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 11:45:32,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 11:45:32,833 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 11:45:32,833 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 11:45:32,833 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 11:45:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-24 11:45:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-24 11:45:32,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:32,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:32,861 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:32,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1716488208, now seen corresponding path program 1 times [2018-10-24 11:45:32,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:32,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:32,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:32,997 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-24 11:45:33,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:33,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 11:45:33,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 11:45:33,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 11:45:33,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 11:45:33,022 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-10-24 11:45:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:33,042 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-10-24 11:45:33,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 11:45:33,044 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-24 11:45:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:33,055 INFO L225 Difference]: With dead ends: 66 [2018-10-24 11:45:33,055 INFO L226 Difference]: Without dead ends: 28 [2018-10-24 11:45:33,060 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-24 11:45:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-24 11:45:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-24 11:45:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-24 11:45:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-24 11:45:33,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 11 [2018-10-24 11:45:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:33,104 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-24 11:45:33,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 11:45:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-24 11:45:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-24 11:45:33,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:33,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:33,107 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:33,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -900053778, now seen corresponding path program 1 times [2018-10-24 11:45:33,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:33,315 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-24 11:45:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:33,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:45:33,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:45:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:45:33,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:45:33,320 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-10-24 11:45:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:33,544 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-10-24 11:45:33,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 11:45:33,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-24 11:45:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:33,546 INFO L225 Difference]: With dead ends: 56 [2018-10-24 11:45:33,546 INFO L226 Difference]: Without dead ends: 43 [2018-10-24 11:45:33,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-24 11:45:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-24 11:45:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-24 11:45:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-10-24 11:45:33,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2018-10-24 11:45:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:33,554 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-24 11:45:33,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:45:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-10-24 11:45:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 11:45:33,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:33,555 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-24 11:45:33,556 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:33,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:33,556 INFO L82 PathProgramCache]: Analyzing trace with hash 932193404, now seen corresponding path program 1 times [2018-10-24 11:45:33,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:33,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:33,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:33,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:33,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:33,689 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-24 11:45:33,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:33,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:45:33,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:45:33,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:45:33,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:45:33,691 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-10-24 11:45:34,027 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 11:45:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:34,197 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-10-24 11:45:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 11:45:34,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-24 11:45:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:34,199 INFO L225 Difference]: With dead ends: 82 [2018-10-24 11:45:34,199 INFO L226 Difference]: Without dead ends: 56 [2018-10-24 11:45:34,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 11:45:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-24 11:45:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2018-10-24 11:45:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 11:45:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-24 11:45:34,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-10-24 11:45:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:34,215 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-24 11:45:34,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:45:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-24 11:45:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 11:45:34,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:34,216 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-24 11:45:34,216 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:34,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1844764543, now seen corresponding path program 1 times [2018-10-24 11:45:34,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:35,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-24 11:45:35,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:35,560 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-24 11:45:35,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:35,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:36,089 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-24 11:45:36,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:36,102 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-24 11:45:36,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:36,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:36,142 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-24 11:45:36,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 11:45:36,444 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-24 11:45:36,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:36,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:36,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:36,482 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:36,491 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-24 11:45:36,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:36,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:36,518 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-24 11:45:36,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 11:45:36,539 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-24 11:45:36,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:36,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-10-24 11:45:36,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 11:45:36,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 11:45:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-24 11:45:36,572 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 23 states. [2018-10-24 11:45:36,798 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 15 [2018-10-24 11:45:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:38,365 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-10-24 11:45:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 11:45:38,366 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-10-24 11:45:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:38,368 INFO L225 Difference]: With dead ends: 106 [2018-10-24 11:45:38,368 INFO L226 Difference]: Without dead ends: 104 [2018-10-24 11:45:38,369 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-24 11:45:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-24 11:45:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2018-10-24 11:45:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 11:45:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-10-24 11:45:38,382 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 24 [2018-10-24 11:45:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:38,382 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-10-24 11:45:38,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 11:45:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-10-24 11:45:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 11:45:38,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:38,384 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-24 11:45:38,385 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:38,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1668399199, now seen corresponding path program 1 times [2018-10-24 11:45:38,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:38,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:38,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:38,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:39,224 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-24 11:45:39,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:39,224 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-24 11:45:39,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:39,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:39,571 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-24 11:45:39,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:39,582 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-24 11:45:39,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:39,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:39,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-24 11:45:39,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:45:40,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,138 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-24 11:45:40,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,145 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:40,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,153 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-24 11:45:40,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,220 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-24 11:45:40,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-24 11:45:40,364 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-24 11:45:40,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,370 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:40,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,373 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:40,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:40,381 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-24 11:45:40,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,404 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-24 11:45:40,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:45:40,432 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-24 11:45:40,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-10-24 11:45:40,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:45:40,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:45:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:45:40,456 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 33 states. [2018-10-24 11:45:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:42,450 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-10-24 11:45:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 11:45:42,451 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 31 [2018-10-24 11:45:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:42,452 INFO L225 Difference]: With dead ends: 160 [2018-10-24 11:45:42,453 INFO L226 Difference]: Without dead ends: 110 [2018-10-24 11:45:42,457 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-24 11:45:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-24 11:45:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 59. [2018-10-24 11:45:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 11:45:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-10-24 11:45:42,480 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 31 [2018-10-24 11:45:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:42,483 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-24 11:45:42,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:45:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-10-24 11:45:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-24 11:45:42,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:42,485 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-24 11:45:42,485 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:42,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1970442993, now seen corresponding path program 1 times [2018-10-24 11:45:42,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:42,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:42,764 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-24 11:45:42,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:42,765 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-24 11:45:42,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:42,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:42,927 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-24 11:45:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-24 11:45:42,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 11:45:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 11:45:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-24 11:45:42,949 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 8 states. [2018-10-24 11:45:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:43,085 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-24 11:45:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 11:45:43,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-24 11:45:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:43,086 INFO L225 Difference]: With dead ends: 89 [2018-10-24 11:45:43,086 INFO L226 Difference]: Without dead ends: 68 [2018-10-24 11:45:43,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-24 11:45:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-24 11:45:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2018-10-24 11:45:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-24 11:45:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-24 11:45:43,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-10-24 11:45:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:43,097 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-24 11:45:43,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 11:45:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-24 11:45:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 11:45:43,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:43,099 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-24 11:45:43,099 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:43,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1689200784, now seen corresponding path program 2 times [2018-10-24 11:45:43,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:43,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:43,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:43,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:43,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:43,603 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-24 11:45:44,112 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-24 11:45:44,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:44,113 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-24 11:45:44,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:44,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:44,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:44,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:44,457 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-24 11:45:44,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,467 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-24 11:45:44,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,487 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-24 11:45:44,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-24 11:45:44,596 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-24 11:45:44,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,607 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-24 11:45:44,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,633 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-24 11:45:44,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-24 11:45:44,908 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-24 11:45:44,914 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-24 11:45:44,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,919 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-24 11:45:44,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:44,937 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-24 11:45:44,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:44,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 21 [2018-10-24 11:45:44,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 11:45:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 11:45:44,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-24 11:45:44,960 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 21 states. [2018-10-24 11:45:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:46,474 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-10-24 11:45:46,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 11:45:46,474 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-10-24 11:45:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:46,476 INFO L225 Difference]: With dead ends: 156 [2018-10-24 11:45:46,476 INFO L226 Difference]: Without dead ends: 154 [2018-10-24 11:45:46,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 11:45:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-24 11:45:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 75. [2018-10-24 11:45:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-24 11:45:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-10-24 11:45:46,488 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 36 [2018-10-24 11:45:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:46,488 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-10-24 11:45:46,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 11:45:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-10-24 11:45:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 11:45:46,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:46,490 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-24 11:45:46,490 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:46,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1168074162, now seen corresponding path program 2 times [2018-10-24 11:45:46,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:46,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:46,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:47,497 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-24 11:45:47,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:47,498 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-24 11:45:47,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:47,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:47,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:47,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:48,028 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-24 11:45:48,058 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:48,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,131 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-24 11:45:48,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,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-24 11:45:48,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:52 [2018-10-24 11:45:48,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,572 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-24 11:45:48,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,581 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:48,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,586 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-24 11:45:48,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,611 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-24 11:45:48,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-24 11:45:48,735 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-24 11:45:48,738 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,744 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-24 11:45:48,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,775 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-24 11:45:48,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-10-24 11:45:48,858 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-24 11:45:48,860 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:48,861 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-24 11:45:48,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:48,865 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-24 11:45:48,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:45:48,893 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-24 11:45:48,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:48,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 31 [2018-10-24 11:45:48,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 11:45:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 11:45:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-10-24 11:45:48,916 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 31 states. [2018-10-24 11:45:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:50,921 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2018-10-24 11:45:50,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 11:45:50,923 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-10-24 11:45:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:50,925 INFO L225 Difference]: With dead ends: 204 [2018-10-24 11:45:50,925 INFO L226 Difference]: Without dead ends: 175 [2018-10-24 11:45:50,927 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-24 11:45:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-24 11:45:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 94. [2018-10-24 11:45:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-24 11:45:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-10-24 11:45:50,939 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 43 [2018-10-24 11:45:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:50,940 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-10-24 11:45:50,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 11:45:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-10-24 11:45:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 11:45:50,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:50,941 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-24 11:45:50,942 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:50,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1672228496, now seen corresponding path program 3 times [2018-10-24 11:45:50,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:50,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:50,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:51,068 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-24 11:45:51,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:51,068 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-24 11:45:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:45:51,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 11:45:51,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:51,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:51,103 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-24 11:45:51,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:51,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-24 11:45:51,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 11:45:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 11:45:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:51,125 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 7 states. [2018-10-24 11:45:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:51,601 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-10-24 11:45:51,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 11:45:51,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-24 11:45:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:51,603 INFO L225 Difference]: With dead ends: 176 [2018-10-24 11:45:51,603 INFO L226 Difference]: Without dead ends: 146 [2018-10-24 11:45:51,604 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-24 11:45:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-24 11:45:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 80. [2018-10-24 11:45:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-24 11:45:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-10-24 11:45:51,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 43 [2018-10-24 11:45:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:51,616 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-10-24 11:45:51,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 11:45:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-10-24 11:45:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-24 11:45:51,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:51,617 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-24 11:45:51,617 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:51,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2089151200, now seen corresponding path program 2 times [2018-10-24 11:45:51,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:51,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:51,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:52,397 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-24 11:45:52,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:52,398 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-24 11:45:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:52,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:52,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:52,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:52,595 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-24 11:45:52,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:52,600 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-24 11:45:52,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,615 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-24 11:45:52,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-24 11:45:52,775 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-24 11:45:52,778 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-24 11:45:52,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,784 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-24 11:45:52,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:52,808 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-24 11:45:52,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:52,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-24 11:45:52,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 11:45:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 11:45:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-10-24 11:45:52,830 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 29 states. [2018-10-24 11:45:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:54,233 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-10-24 11:45:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 11:45:54,233 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-24 11:45:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:54,235 INFO L225 Difference]: With dead ends: 161 [2018-10-24 11:45:54,235 INFO L226 Difference]: Without dead ends: 159 [2018-10-24 11:45:54,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-10-24 11:45:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-24 11:45:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2018-10-24 11:45:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-24 11:45:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-10-24 11:45:54,250 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2018-10-24 11:45:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:54,250 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-10-24 11:45:54,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 11:45:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-10-24 11:45:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 11:45:54,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:54,252 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-24 11:45:54,252 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1333715085, now seen corresponding path program 1 times [2018-10-24 11:45:54,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:54,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:54,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:54,720 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-24 11:45:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:54,721 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-24 11:45:54,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:54,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:54,941 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-24 11:45:54,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:54,945 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-24 11:45:54,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,006 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-24 11:45:55,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 11:45:55,109 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-24 11:45:55,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:55,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:55,121 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-24 11:45:55,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,134 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-24 11:45:55,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 11:45:55,152 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-24 11:45:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-10-24 11:45:55,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-24 11:45:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-24 11:45:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-10-24 11:45:55,174 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 28 states. [2018-10-24 11:45:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:57,299 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2018-10-24 11:45:57,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-24 11:45:57,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2018-10-24 11:45:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:57,307 INFO L225 Difference]: With dead ends: 223 [2018-10-24 11:45:57,308 INFO L226 Difference]: Without dead ends: 221 [2018-10-24 11:45:57,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=647, Invalid=2545, Unknown=0, NotChecked=0, Total=3192 [2018-10-24 11:45:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-24 11:45:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 121. [2018-10-24 11:45:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-24 11:45:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-10-24 11:45:57,327 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-10-24 11:45:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:57,327 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-10-24 11:45:57,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-24 11:45:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-10-24 11:45:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 11:45:57,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:57,329 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-24 11:45:57,329 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:57,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash 288089389, now seen corresponding path program 4 times [2018-10-24 11:45:57,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:57,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:57,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:58,181 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-24 11:45:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:58,181 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-24 11:45:58,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:45:58,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:45:58,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:58,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:58,373 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-24 11:45:58,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,378 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-24 11:45:58,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:58,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:58,505 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-24 11:45:58,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-24 11:45:58,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,708 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-24 11:45:58,729 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,730 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:58,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,736 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-24 11:45:58,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:58,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:58,761 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-24 11:45:58,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2018-10-24 11:45:58,918 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-24 11:45:58,920 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:58,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:58,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:58,926 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-24 11:45:58,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:58,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:58,939 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-24 11:45:58,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:45:58,981 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-24 11:45:59,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:59,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-10-24 11:45:59,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:45:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:45:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:45:59,004 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 33 states. [2018-10-24 11:46:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:03,396 INFO L93 Difference]: Finished difference Result 312 states and 341 transitions. [2018-10-24 11:46:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-24 11:46:03,396 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2018-10-24 11:46:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:03,399 INFO L225 Difference]: With dead ends: 312 [2018-10-24 11:46:03,399 INFO L226 Difference]: Without dead ends: 253 [2018-10-24 11:46:03,403 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-24 11:46:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-24 11:46:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 121. [2018-10-24 11:46:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-24 11:46:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-10-24 11:46:03,420 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 52 [2018-10-24 11:46:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:03,421 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-10-24 11:46:03,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:46:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-10-24 11:46:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 11:46:03,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:03,422 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-24 11:46:03,422 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1256754768, now seen corresponding path program 3 times [2018-10-24 11:46:03,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:03,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:04,185 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-24 11:46:04,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:04,185 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-24 11:46:04,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:46:04,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 11:46:04,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:04,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:04,364 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-24 11:46:04,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:04,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-10-24 11:46:04,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 11:46:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 11:46:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-24 11:46:04,388 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 11 states. [2018-10-24 11:46:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:04,912 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2018-10-24 11:46:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 11:46:04,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-24 11:46:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:04,914 INFO L225 Difference]: With dead ends: 201 [2018-10-24 11:46:04,914 INFO L226 Difference]: Without dead ends: 172 [2018-10-24 11:46:04,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-24 11:46:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-24 11:46:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2018-10-24 11:46:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-24 11:46:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-10-24 11:46:04,931 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 52 [2018-10-24 11:46:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:04,931 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-10-24 11:46:04,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 11:46:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-10-24 11:46:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-24 11:46:04,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:04,932 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-24 11:46:04,932 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:04,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1448838909, now seen corresponding path program 1 times [2018-10-24 11:46:04,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:04,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:04,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:05,488 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-24 11:46:05,974 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-24 11:46:05,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:05,974 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-24 11:46:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:06,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:06,412 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-24 11:46:06,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,418 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-24 11:46:06,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:06,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:06,436 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-24 11:46:06,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:46:06,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,675 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-24 11:46:06,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:06,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,688 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-24 11:46:06,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:06,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:06,726 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-24 11:46:06,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-24 11:46:06,890 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-24 11:46:06,892 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:06,893 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,894 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,894 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:06,895 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:06,896 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-24 11:46:06,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:06,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:06,921 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-24 11:46:06,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-24 11:46:06,952 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-24 11:46:06,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-24 11:46:06,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:46:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:46:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:46:06,974 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 33 states. [2018-10-24 11:46:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:08,274 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-10-24 11:46:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 11:46:08,275 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-10-24 11:46:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:08,277 INFO L225 Difference]: With dead ends: 171 [2018-10-24 11:46:08,277 INFO L226 Difference]: Without dead ends: 154 [2018-10-24 11:46:08,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 11:46:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-24 11:46:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-10-24 11:46:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-24 11:46:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-24 11:46:08,296 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 53 [2018-10-24 11:46:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:08,296 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-24 11:46:08,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:46:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-10-24 11:46:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 11:46:08,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:08,297 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-24 11:46:08,298 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:08,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1298017201, now seen corresponding path program 4 times [2018-10-24 11:46:08,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:08,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:08,625 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 11:46:08,890 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 5 [2018-10-24 11:46:09,364 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-24 11:46:09,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:09,364 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-24 11:46:09,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:46:09,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:46:09,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:09,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:09,526 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-24 11:46:09,528 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-24 11:46:09,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:09,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:09,535 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-24 11:46:09,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:46:09,715 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-24 11:46:09,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:09,719 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-24 11:46:09,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:09,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:09,734 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-24 11:46:09,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:46:09,839 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-24 11:46:09,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:09,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:09,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:09,852 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-24 11:46:09,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:09,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:09,869 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-24 11:46:09,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-24 11:46:10,055 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-24 11:46:10,057 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-24 11:46:10,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,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-24 11:46:10,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:10,095 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-24 11:46:10,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:10,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-10-24 11:46:10,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-24 11:46:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-24 11:46:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 11:46:10,118 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 36 states. [2018-10-24 11:46:10,919 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2018-10-24 11:46:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:11,686 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-10-24 11:46:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 11:46:11,687 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-24 11:46:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:11,688 INFO L225 Difference]: With dead ends: 191 [2018-10-24 11:46:11,688 INFO L226 Difference]: Without dead ends: 189 [2018-10-24 11:46:11,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 11:46:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-24 11:46:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2018-10-24 11:46:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-24 11:46:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2018-10-24 11:46:11,711 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 56 [2018-10-24 11:46:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:11,712 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2018-10-24 11:46:11,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-24 11:46:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2018-10-24 11:46:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-24 11:46:11,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:11,713 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-24 11:46:11,713 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:11,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash -927524220, now seen corresponding path program 2 times [2018-10-24 11:46:11,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:11,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:11,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:11,909 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 11:46:12,494 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-24 11:46:12,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:12,495 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-24 11:46:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:12,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:12,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:12,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:12,846 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-24 11:46:12,850 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:12,852 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-24 11:46:12,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:12,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:12,870 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-24 11:46:12,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-24 11:46:12,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 32 treesize of output 25 [2018-10-24 11:46:12,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:12,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:12,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:12,990 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-24 11:46:12,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,010 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-24 11:46:13,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-24 11:46:13,068 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-24 11:46:13,075 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-24 11:46:13,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,081 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-24 11:46:13,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:13,107 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-24 11:46:13,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:13,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-10-24 11:46:13,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 11:46:13,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 11:46:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-10-24 11:46:13,135 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand 29 states. [2018-10-24 11:46:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:15,037 INFO L93 Difference]: Finished difference Result 246 states and 263 transitions. [2018-10-24 11:46:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-24 11:46:15,038 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-10-24 11:46:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:15,039 INFO L225 Difference]: With dead ends: 246 [2018-10-24 11:46:15,039 INFO L226 Difference]: Without dead ends: 244 [2018-10-24 11:46:15,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2018-10-24 11:46:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-24 11:46:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 166. [2018-10-24 11:46:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-24 11:46:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2018-10-24 11:46:15,061 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 57 [2018-10-24 11:46:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:15,062 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2018-10-24 11:46:15,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 11:46:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2018-10-24 11:46:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-24 11:46:15,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:15,063 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-24 11:46:15,063 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:15,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 589290242, now seen corresponding path program 3 times [2018-10-24 11:46:15,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:15,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:15,280 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 11:46:15,451 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 11:46:15,810 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-10-24 11:46:16,471 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2018-10-24 11:46:17,386 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-24 11:46:17,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:17,386 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-24 11:46:17,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:46:17,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 11:46:17,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:17,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:17,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-24 11:46:17,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,664 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-24 11:46:17,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:17,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:17,723 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-24 11:46:17,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-10-24 11:46:17,814 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-24 11:46:17,816 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,817 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,822 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-24 11:46:17,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:17,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:17,840 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-24 11:46:17,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-24 11:46:17,907 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-24 11:46:17,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:17,916 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-24 11:46:17,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:17,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:17,938 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-24 11:46:17,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-10-24 11:46:18,014 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-24 11:46:18,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,027 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-24 11:46:18,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,048 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-24 11:46:18,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2018-10-24 11:46:18,115 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-24 11:46:18,117 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-24 11:46:18,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,121 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-24 11:46:18,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:18,148 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-24 11:46:18,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:18,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 35 [2018-10-24 11:46:18,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-24 11:46:18,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-24 11:46:18,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 11:46:18,169 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand 35 states. [2018-10-24 11:46:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:20,495 INFO L93 Difference]: Finished difference Result 404 states and 436 transitions. [2018-10-24 11:46:20,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-24 11:46:20,495 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-10-24 11:46:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:20,497 INFO L225 Difference]: With dead ends: 404 [2018-10-24 11:46:20,497 INFO L226 Difference]: Without dead ends: 402 [2018-10-24 11:46:20,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=684, Invalid=4866, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 11:46:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-24 11:46:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 194. [2018-10-24 11:46:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-24 11:46:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 211 transitions. [2018-10-24 11:46:20,523 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 211 transitions. Word has length 57 [2018-10-24 11:46:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:20,523 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 211 transitions. [2018-10-24 11:46:20,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-24 11:46:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 211 transitions. [2018-10-24 11:46:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 11:46:20,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:20,524 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-24 11:46:20,524 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:20,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 594732221, now seen corresponding path program 1 times [2018-10-24 11:46:20,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:20,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:20,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:20,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:20,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:21,054 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-24 11:46:21,595 WARN L179 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 14 [2018-10-24 11:46:23,321 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-24 11:46:23,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:23,321 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-24 11:46:23,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:23,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:23,678 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-24 11:46:23,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:23,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 23 treesize of output 37 [2018-10-24 11:46:23,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,956 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-24 11:46:23,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-24 11:46:24,218 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-24 11:46:24,220 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,221 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:24,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,231 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-24 11:46:24,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:24,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:24,261 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-24 11:46:24,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:51 [2018-10-24 11:46:24,610 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-24 11:46:24,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,616 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,617 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,617 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:24,619 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,620 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:24,633 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-24 11:46:24,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:24,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:24,674 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-24 11:46:24,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:44 [2018-10-24 11:46:24,917 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-24 11:46:24,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:24,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:25,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:25,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:25,027 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-10-24 11:46:25,037 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-24 11:46:25,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:46:25,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:46:25,109 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-24 11:46:25,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-10-24 11:46:25,485 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-24 11:46:25,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:25,491 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:25,495 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-24 11:46:25,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:25,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:25,506 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-24 11:46:25,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-10-24 11:46:25,563 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-24 11:46:25,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:25,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-10-24 11:46:25,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-24 11:46:25,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-24 11:46:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2665, Unknown=0, NotChecked=0, Total=2970 [2018-10-24 11:46:25,585 INFO L87 Difference]: Start difference. First operand 194 states and 211 transitions. Second operand 55 states. [2018-10-24 11:46:26,608 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-10-24 11:46:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:30,020 INFO L93 Difference]: Finished difference Result 260 states and 279 transitions. [2018-10-24 11:46:30,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-24 11:46:30,020 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 60 [2018-10-24 11:46:30,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:30,021 INFO L225 Difference]: With dead ends: 260 [2018-10-24 11:46:30,021 INFO L226 Difference]: Without dead ends: 243 [2018-10-24 11:46:30,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=807, Invalid=6503, Unknown=0, NotChecked=0, Total=7310 [2018-10-24 11:46:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-24 11:46:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 214. [2018-10-24 11:46:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-24 11:46:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 232 transitions. [2018-10-24 11:46:30,052 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 232 transitions. Word has length 60 [2018-10-24 11:46:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:30,052 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 232 transitions. [2018-10-24 11:46:30,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-24 11:46:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2018-10-24 11:46:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 11:46:30,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:30,053 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-24 11:46:30,053 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:30,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -211122400, now seen corresponding path program 5 times [2018-10-24 11:46:30,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:31,356 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-24 11:46:31,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:31,357 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-24 11:46:31,368 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:46:31,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-24 11:46:31,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:31,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:31,647 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-24 11:46:31,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:31,657 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-24 11:46:31,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:31,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:31,680 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-24 11:46:31,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:46:31,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:31,879 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-24 11:46:31,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:31,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:31,888 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-24 11:46:31,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:31,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:31,908 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-24 11:46:31,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-10-24 11:46:32,021 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-24 11:46:32,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,027 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,031 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-24 11:46:32,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,055 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-24 11:46:32,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-10-24 11:46:32,080 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-24 11:46:32,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,091 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-24 11:46:32,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,122 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-24 11:46:32,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-24 11:46:32,197 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-24 11:46:32,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,206 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,208 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,213 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-24 11:46:32,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,245 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-24 11:46:32,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-10-24 11:46:32,369 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-24 11:46:32,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:32,376 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-24 11:46:32,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:32,380 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-24 11:46:32,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:46:32,424 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-24 11:46:32,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:32,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 37 [2018-10-24 11:46:32,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 11:46:32,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 11:46:32,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 11:46:32,446 INFO L87 Difference]: Start difference. First operand 214 states and 232 transitions. Second operand 37 states. [2018-10-24 11:46:34,353 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-10-24 11:46:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:36,154 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-10-24 11:46:36,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-24 11:46:36,154 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-24 11:46:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:36,155 INFO L225 Difference]: With dead ends: 333 [2018-10-24 11:46:36,155 INFO L226 Difference]: Without dead ends: 331 [2018-10-24 11:46:36,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 46 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=772, Invalid=5390, Unknown=0, NotChecked=0, Total=6162 [2018-10-24 11:46:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-24 11:46:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 198. [2018-10-24 11:46:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-24 11:46:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-10-24 11:46:36,188 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 64 [2018-10-24 11:46:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:36,188 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-10-24 11:46:36,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 11:46:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-10-24 11:46:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 11:46:36,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:36,189 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-24 11:46:36,190 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:36,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1718281922, now seen corresponding path program 6 times [2018-10-24 11:46:36,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:36,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:36,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:37,158 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-24 11:46:37,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:37,158 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-24 11:46:37,167 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:46:37,193 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-24 11:46:37,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:37,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:37,621 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-24 11:46:37,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:37,627 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-24 11:46:37,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:37,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:37,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-24 11:46:37,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:46:37,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:37,906 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-24 11:46:37,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:37,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:37,913 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:37,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:37,918 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-24 11:46:37,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:37,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:37,942 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-24 11:46:37,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:32 [2018-10-24 11:46:38,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 39 treesize of output 32 [2018-10-24 11:46:38,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,114 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,119 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-24 11:46:38,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:38,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:38,143 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-24 11:46:38,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-10-24 11:46:38,257 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-24 11:46:38,258 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:38,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,260 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:38,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:38,263 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-24 11:46:38,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:38,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:38,277 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-24 11:46:38,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:46:38,306 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-24 11:46:38,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:38,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2018-10-24 11:46:38,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 11:46:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 11:46:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1442, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 11:46:38,327 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 41 states. [2018-10-24 11:46:44,091 WARN L179 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-24 11:46:46,042 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-24 11:46:46,938 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-24 11:46:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:47,355 INFO L93 Difference]: Finished difference Result 419 states and 451 transitions. [2018-10-24 11:46:47,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-24 11:46:47,355 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 64 [2018-10-24 11:46:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:47,357 INFO L225 Difference]: With dead ends: 419 [2018-10-24 11:46:47,357 INFO L226 Difference]: Without dead ends: 369 [2018-10-24 11:46:47,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6979 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1969, Invalid=18053, Unknown=0, NotChecked=0, Total=20022 [2018-10-24 11:46:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-24 11:46:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 227. [2018-10-24 11:46:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-24 11:46:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2018-10-24 11:46:47,395 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 64 [2018-10-24 11:46:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:47,395 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2018-10-24 11:46:47,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 11:46:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2018-10-24 11:46:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 11:46:47,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:47,396 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-24 11:46:47,397 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:47,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash 927491905, now seen corresponding path program 5 times [2018-10-24 11:46:47,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:47,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:47,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:47,916 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-24 11:46:48,335 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-24 11:46:48,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:48,335 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-24 11:46:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:46:48,380 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-24 11:46:48,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:48,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:48,553 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-24 11:46:48,555 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-24 11:46:48,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:48,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:48,564 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-24 11:46:48,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-10-24 11:46:48,755 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-24 11:46:48,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:48,759 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-24 11:46:48,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:48,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:48,776 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-24 11:46:48,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-24 11:46:49,113 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-24 11:46:49,118 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:49,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:49,119 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:49,129 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-24 11:46:49,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:49,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:49,139 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-24 11:46:49,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-24 11:46:49,179 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-24 11:46:49,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:49,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-24 11:46:49,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 11:46:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 11:46:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 11:46:49,201 INFO L87 Difference]: Start difference. First operand 227 states and 247 transitions. Second operand 37 states. [2018-10-24 11:46:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:51,246 INFO L93 Difference]: Finished difference Result 407 states and 439 transitions. [2018-10-24 11:46:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 11:46:51,246 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-24 11:46:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:51,248 INFO L225 Difference]: With dead ends: 407 [2018-10-24 11:46:51,248 INFO L226 Difference]: Without dead ends: 405 [2018-10-24 11:46:51,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=408, Invalid=3498, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 11:46:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-24 11:46:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 287. [2018-10-24 11:46:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-24 11:46:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2018-10-24 11:46:51,299 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 64 [2018-10-24 11:46:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:51,299 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2018-10-24 11:46:51,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 11:46:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2018-10-24 11:46:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-24 11:46:51,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:51,300 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-24 11:46:51,300 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:51,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1371876588, now seen corresponding path program 2 times [2018-10-24 11:46:51,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:51,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:51,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:51,862 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-24 11:46:52,954 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-24 11:46:52,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:52,955 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-24 11:46:52,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:52,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:52,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:52,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:53,249 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-24 11:46:53,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,253 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-24 11:46:53,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,274 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-24 11:46:53,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:46:53,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,497 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-24 11:46:53,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:53,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,507 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-24 11:46:53,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,550 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-24 11:46:53,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-24 11:46:53,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 31 treesize of output 24 [2018-10-24 11:46:53,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,678 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-24 11:46:53,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,697 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-24 11:46:53,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-24 11:46:53,930 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-24 11:46:53,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:53,968 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-24 11:46:53,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:53,991 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-24 11:46:53,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:46:54,063 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-24 11:46:54,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:54,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2018-10-24 11:46:54,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-24 11:46:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-24 11:46:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2018-10-24 11:46:54,085 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 45 states. [2018-10-24 11:46:54,478 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-24 11:46:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:55,601 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2018-10-24 11:46:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-24 11:46:55,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2018-10-24 11:46:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:55,606 INFO L225 Difference]: With dead ends: 360 [2018-10-24 11:46:55,607 INFO L226 Difference]: Without dead ends: 358 [2018-10-24 11:46:55,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=463, Invalid=3443, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 11:46:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-24 11:46:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2018-10-24 11:46:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-24 11:46:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2018-10-24 11:46:55,662 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 65 [2018-10-24 11:46:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:55,663 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2018-10-24 11:46:55,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-24 11:46:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2018-10-24 11:46:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-24 11:46:55,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:55,664 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-24 11:46:55,664 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:55,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1838298514, now seen corresponding path program 3 times [2018-10-24 11:46:55,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:55,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:55,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:55,962 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 11:46:56,767 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-24 11:46:56,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:56,768 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-24 11:46:56,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:46:56,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 11:46:56,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:56,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:57,004 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-24 11:46:57,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:57,008 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-24 11:46:57,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:57,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:57,024 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-24 11:46:57,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-24 11:46:57,139 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-24 11:46:57,164 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-24 11:46:57,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:57,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:57,167 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-24 11:46:57,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:57,195 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-24 11:46:57,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:57,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-10-24 11:46:57,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-24 11:46:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-24 11:46:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-10-24 11:46:57,216 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 30 states. [2018-10-24 11:46:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:59,057 INFO L93 Difference]: Finished difference Result 486 states and 522 transitions. [2018-10-24 11:46:59,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-24 11:46:59,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-10-24 11:46:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:59,060 INFO L225 Difference]: With dead ends: 486 [2018-10-24 11:46:59,061 INFO L226 Difference]: Without dead ends: 484 [2018-10-24 11:46:59,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=525, Invalid=3635, Unknown=0, NotChecked=0, Total=4160 [2018-10-24 11:46:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-24 11:46:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 313. [2018-10-24 11:46:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-24 11:46:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 344 transitions. [2018-10-24 11:46:59,130 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 344 transitions. Word has length 65 [2018-10-24 11:46:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:59,131 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 344 transitions. [2018-10-24 11:46:59,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-24 11:46:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 344 transitions. [2018-10-24 11:46:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-24 11:46:59,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:59,132 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-24 11:46:59,132 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:59,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash 158141761, now seen corresponding path program 4 times [2018-10-24 11:46:59,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:59,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:59,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:59,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:59,695 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-24 11:46:59,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:59,695 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-24 11:46:59,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:46:59,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:46:59,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:59,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:59,863 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-24 11:46:59,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,868 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-24 11:46:59,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,886 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-24 11:46:59,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-10-24 11:46:59,954 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-24 11:46:59,957 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-24 11:46:59,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,974 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-24 11:46:59,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:59,996 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-24 11:47:00,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:00,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 21 [2018-10-24 11:47:00,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 11:47:00,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 11:47:00,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-10-24 11:47:00,018 INFO L87 Difference]: Start difference. First operand 313 states and 344 transitions. Second operand 21 states. [2018-10-24 11:47:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:02,573 INFO L93 Difference]: Finished difference Result 636 states and 687 transitions. [2018-10-24 11:47:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-24 11:47:02,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-24 11:47:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:02,576 INFO L225 Difference]: With dead ends: 636 [2018-10-24 11:47:02,576 INFO L226 Difference]: Without dead ends: 578 [2018-10-24 11:47:02,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=667, Invalid=5653, Unknown=0, NotChecked=0, Total=6320 [2018-10-24 11:47:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-24 11:47:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 332. [2018-10-24 11:47:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-24 11:47:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 366 transitions. [2018-10-24 11:47:02,640 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 366 transitions. Word has length 66 [2018-10-24 11:47:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:02,640 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 366 transitions. [2018-10-24 11:47:02,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 11:47:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 366 transitions. [2018-10-24 11:47:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 11:47:02,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:02,642 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-24 11:47:02,642 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:02,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1160141791, now seen corresponding path program 2 times [2018-10-24 11:47:02,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:02,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:02,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:03,021 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 11:47:04,929 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-24 11:47:04,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:04,929 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-24 11:47:04,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:47:04,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:47:04,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:04,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:05,163 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-24 11:47:05,165 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:05,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,170 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-24 11:47:05,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:05,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:05,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-24 11:47:05,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-24 11:47:05,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,447 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-24 11:47:05,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:05,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,456 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-24 11:47:05,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:05,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:05,477 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-24 11:47:05,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-24 11:47:05,598 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-24 11:47:05,602 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:05,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,613 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-24 11:47:05,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:05,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:05,642 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-24 11:47:05,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-24 11:47:05,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:05,990 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-24 11:47:06,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,020 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,027 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:06,028 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:06,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,045 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-24 11:47:06,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:47:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:06,123 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-24 11:47:06,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-10-24 11:47:06,354 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-24 11:47:06,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,388 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-24 11:47:06,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:47:06,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:47:06,477 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-24 11:47:06,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-10-24 11:47:06,714 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-24 11:47:06,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:06,718 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-24 11:47:06,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:06,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:06,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-24 11:47:06,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:47:06,784 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-24 11:47:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:06,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 55 [2018-10-24 11:47:06,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-24 11:47:06,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-24 11:47:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2667, Unknown=0, NotChecked=0, Total=2970 [2018-10-24 11:47:06,806 INFO L87 Difference]: Start difference. First operand 332 states and 366 transitions. Second operand 55 states. [2018-10-24 11:47:10,964 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-24 11:47:11,626 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-24 11:47:11,823 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-10-24 11:47:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:11,912 INFO L93 Difference]: Finished difference Result 434 states and 472 transitions. [2018-10-24 11:47:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-24 11:47:11,912 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2018-10-24 11:47:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:11,914 INFO L225 Difference]: With dead ends: 434 [2018-10-24 11:47:11,914 INFO L226 Difference]: Without dead ends: 417 [2018-10-24 11:47:11,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=960, Invalid=8160, Unknown=0, NotChecked=0, Total=9120 [2018-10-24 11:47:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-24 11:47:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 285. [2018-10-24 11:47:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-24 11:47:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 316 transitions. [2018-10-24 11:47:11,971 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 316 transitions. Word has length 67 [2018-10-24 11:47:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:11,971 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 316 transitions. [2018-10-24 11:47:11,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-24 11:47:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 316 transitions. [2018-10-24 11:47:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 11:47:11,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:11,973 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-24 11:47:11,973 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:11,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -235702322, now seen corresponding path program 3 times [2018-10-24 11:47:11,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:11,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:11,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:12,487 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-24 11:47:14,693 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-24 11:47:14,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:14,694 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-24 11:47:14,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:47:14,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-24 11:47:14,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:14,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:14,809 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-24 11:47:14,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:14,814 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-24 11:47:14,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:14,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:14,832 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-24 11:47:14,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-24 11:47:14,950 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-24 11:47:14,952 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:14,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:14,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:14,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:14,964 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-24 11:47:14,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:14,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:14,989 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-24 11:47:14,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:46 [2018-10-24 11:47:15,211 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-24 11:47:15,215 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,276 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-24 11:47:15,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-24 11:47:15,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 11:47:15,408 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-24 11:47:15,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:192 [2018-10-24 11:47:15,580 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-10-24 11:47:15,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 53 treesize of output 42 [2018-10-24 11:47:15,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:15,997 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:15,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:16,013 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-24 11:47:16,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:16,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:16,035 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-24 11:47:16,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-10-24 11:47:16,257 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-24 11:47:16,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:16,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:16,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:16,268 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-24 11:47:16,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:16,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:16,286 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-24 11:47:16,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:29 [2018-10-24 11:47:16,520 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-24 11:47:16,523 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-24 11:47:16,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:16,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:16,526 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-24 11:47:16,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:47:16,593 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-24 11:47:16,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:16,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 50 [2018-10-24 11:47:16,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-24 11:47:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-24 11:47:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2250, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 11:47:16,616 INFO L87 Difference]: Start difference. First operand 285 states and 316 transitions. Second operand 50 states. [2018-10-24 11:47:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:21,071 INFO L93 Difference]: Finished difference Result 453 states and 493 transitions. [2018-10-24 11:47:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-24 11:47:21,071 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-10-24 11:47:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:21,073 INFO L225 Difference]: With dead ends: 453 [2018-10-24 11:47:21,073 INFO L226 Difference]: Without dead ends: 451 [2018-10-24 11:47:21,074 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-24 11:47:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-24 11:47:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 341. [2018-10-24 11:47:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-24 11:47:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 378 transitions. [2018-10-24 11:47:21,129 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 378 transitions. Word has length 72 [2018-10-24 11:47:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:21,129 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 378 transitions. [2018-10-24 11:47:21,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-24 11:47:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 378 transitions. [2018-10-24 11:47:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 11:47:21,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:21,130 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-24 11:47:21,130 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:21,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1018817839, now seen corresponding path program 6 times [2018-10-24 11:47:21,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:21,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:21,946 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-24 11:47:21,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:21,947 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-24 11:47:21,956 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:47:21,995 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-24 11:47:21,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:21,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:22,080 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-24 11:47:22,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:22,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-24 11:47:22,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 11:47:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 11:47:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-24 11:47:22,102 INFO L87 Difference]: Start difference. First operand 341 states and 378 transitions. Second operand 14 states. [2018-10-24 11:47:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:22,684 INFO L93 Difference]: Finished difference Result 510 states and 558 transitions. [2018-10-24 11:47:22,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 11:47:22,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-24 11:47:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:22,686 INFO L225 Difference]: With dead ends: 510 [2018-10-24 11:47:22,686 INFO L226 Difference]: Without dead ends: 473 [2018-10-24 11:47:22,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-10-24 11:47:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-24 11:47:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 361. [2018-10-24 11:47:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-24 11:47:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 396 transitions. [2018-10-24 11:47:22,746 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 396 transitions. Word has length 72 [2018-10-24 11:47:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:22,746 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 396 transitions. [2018-10-24 11:47:22,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 11:47:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 396 transitions. [2018-10-24 11:47:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-24 11:47:22,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:22,747 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-24 11:47:22,747 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:22,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1685520350, now seen corresponding path program 4 times [2018-10-24 11:47:22,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:22,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:22,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:23,485 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 11:47:23,938 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-24 11:47:23,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:23,939 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-24 11:47:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:47:23,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:47:23,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:23,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:24,195 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-24 11:47:24,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,198 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-24 11:47:24,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:24,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:24,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-24 11:47:24,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-24 11:47:24,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,277 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-24 11:47:24,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,282 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-24 11:47:24,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:24,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:24,296 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-24 11:47:24,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:17 [2018-10-24 11:47:24,410 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-24 11:47:24,412 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:24,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,414 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:24,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:24,415 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-24 11:47:24,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:24,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:24,424 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-24 11:47:24,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-24 11:47:24,462 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-24 11:47:24,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:24,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2018-10-24 11:47:24,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-24 11:47:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-24 11:47:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 11:47:24,484 INFO L87 Difference]: Start difference. First operand 361 states and 396 transitions. Second operand 34 states. [2018-10-24 11:47:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:25,753 INFO L93 Difference]: Finished difference Result 427 states and 462 transitions. [2018-10-24 11:47:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-24 11:47:25,754 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-10-24 11:47:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:25,756 INFO L225 Difference]: With dead ends: 427 [2018-10-24 11:47:25,756 INFO L226 Difference]: Without dead ends: 402 [2018-10-24 11:47:25,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2018-10-24 11:47:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-24 11:47:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 348. [2018-10-24 11:47:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-24 11:47:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 381 transitions. [2018-10-24 11:47:25,813 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 381 transitions. Word has length 73 [2018-10-24 11:47:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:25,813 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 381 transitions. [2018-10-24 11:47:25,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-24 11:47:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 381 transitions. [2018-10-24 11:47:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-24 11:47:25,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:25,814 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-24 11:47:25,815 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1855670063, now seen corresponding path program 5 times [2018-10-24 11:47:25,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:25,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:25,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:26,141 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 11:47:26,928 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-24 11:47:26,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:26,928 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-24 11:47:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:47:26,974 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-24 11:47:26,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:26,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:27,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 41 treesize of output 34 [2018-10-24 11:47:27,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,245 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-24 11:47:27,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:27,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:27,265 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-24 11:47:27,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:47:27,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,455 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-24 11:47:27,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-24 11:47:27,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:27,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:27,483 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-24 11:47:27,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2018-10-24 11:47:27,736 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-24 11:47:27,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:27,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:27,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:27,743 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-24 11:47:27,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:27,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:27,774 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-24 11:47:27,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-10-24 11:47:27,821 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-24 11:47:27,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:27,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-10-24 11:47:27,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-24 11:47:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-24 11:47:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-10-24 11:47:27,844 INFO L87 Difference]: Start difference. First operand 348 states and 381 transitions. Second operand 39 states. [2018-10-24 11:47:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:32,630 INFO L93 Difference]: Finished difference Result 447 states and 480 transitions. [2018-10-24 11:47:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-24 11:47:32,630 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-10-24 11:47:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:32,631 INFO L225 Difference]: With dead ends: 447 [2018-10-24 11:47:32,632 INFO L226 Difference]: Without dead ends: 445 [2018-10-24 11:47:32,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3243 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=979, Invalid=9941, Unknown=0, NotChecked=0, Total=10920 [2018-10-24 11:47:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-24 11:47:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 357. [2018-10-24 11:47:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-24 11:47:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 390 transitions. [2018-10-24 11:47:32,692 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 390 transitions. Word has length 74 [2018-10-24 11:47:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:32,692 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 390 transitions. [2018-10-24 11:47:32,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-24 11:47:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 390 transitions. [2018-10-24 11:47:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 11:47:32,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:32,694 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-24 11:47:32,694 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:32,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1860733778, now seen corresponding path program 7 times [2018-10-24 11:47:32,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:32,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:32,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:33,376 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-24 11:47:33,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:33,376 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-24 11:47:33,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:47:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:33,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:33,427 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-24 11:47:33,429 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-24 11:47:33,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,440 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-24 11:47:33,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:47:33,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 27 treesize of output 22 [2018-10-24 11:47:33,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:33,524 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-24 11:47:33,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,540 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-24 11:47:33,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-24 11:47:33,647 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-24 11:47:33,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:33,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:33,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:33,665 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-24 11:47:33,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,692 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-24 11:47:33,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-24 11:47:33,896 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-24 11:47:33,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:33,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:33,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:33,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:33,908 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-24 11:47:33,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:33,916 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-24 11:47:33,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-24 11:47:33,955 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-24 11:47:33,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:33,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2018-10-24 11:47:33,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 11:47:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 11:47:33,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-24 11:47:33,976 INFO L87 Difference]: Start difference. First operand 357 states and 390 transitions. Second operand 27 states. [2018-10-24 11:47:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:35,665 INFO L93 Difference]: Finished difference Result 488 states and 526 transitions. [2018-10-24 11:47:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 11:47:35,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-10-24 11:47:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:35,667 INFO L225 Difference]: With dead ends: 488 [2018-10-24 11:47:35,667 INFO L226 Difference]: Without dead ends: 486 [2018-10-24 11:47:35,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 11:47:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-24 11:47:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 408. [2018-10-24 11:47:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-24 11:47:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 446 transitions. [2018-10-24 11:47:35,742 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 446 transitions. Word has length 76 [2018-10-24 11:47:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:35,743 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 446 transitions. [2018-10-24 11:47:35,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 11:47:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 446 transitions. [2018-10-24 11:47:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-24 11:47:35,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:35,744 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-24 11:47:35,744 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:35,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1758305189, now seen corresponding path program 6 times [2018-10-24 11:47:35,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:35,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:47:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:36,294 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 11:47:36,752 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-10-24 11:47:37,192 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-10-24 11:47:38,042 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-24 11:47:38,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:38,043 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-24 11:47:38,050 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:47:38,093 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-24 11:47:38,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:38,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:38,394 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-24 11:47:38,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,399 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-24 11:47:38,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,423 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-24 11:47:38,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:47:38,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,526 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-24 11:47:38,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,534 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-24 11:47:38,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,552 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-24 11:47:38,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-24 11:47:38,680 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-24 11:47:38,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,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, 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-24 11:47:38,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,721 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-24 11:47:38,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2018-10-24 11:47:38,858 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-24 11:47:38,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,867 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:38,874 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-24 11:47:38,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:38,905 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-24 11:47:38,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-24 11:47:39,237 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-24 11:47:39,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:39,239 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-24 11:47:39,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:39,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:39,242 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-24 11:47:39,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:47:39,322 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-24 11:47:39,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:39,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 48 [2018-10-24 11:47:39,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-24 11:47:39,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-24 11:47:39,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2018-10-24 11:47:39,343 INFO L87 Difference]: Start difference. First operand 408 states and 446 transitions. Second operand 48 states. [2018-10-24 11:47:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:41,428 INFO L93 Difference]: Finished difference Result 567 states and 614 transitions. [2018-10-24 11:47:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 11:47:41,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 77 [2018-10-24 11:47:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:41,431 INFO L225 Difference]: With dead ends: 567 [2018-10-24 11:47:41,431 INFO L226 Difference]: Without dead ends: 565 [2018-10-24 11:47:41,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=603, Invalid=4947, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 11:47:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-24 11:47:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 430. [2018-10-24 11:47:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-24 11:47:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 471 transitions. [2018-10-24 11:47:41,526 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 471 transitions. Word has length 77 [2018-10-24 11:47:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:41,526 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 471 transitions. [2018-10-24 11:47:41,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-24 11:47:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 471 transitions. [2018-10-24 11:47:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-24 11:47:41,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:41,527 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-24 11:47:41,528 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:41,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1788817699, now seen corresponding path program 7 times [2018-10-24 11:47:41,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:41,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:41,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:41,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:41,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:42,448 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-24 11:47:42,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:42,449 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-24 11:47:42,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:47:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:42,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:42,658 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-24 11:47:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:42,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 24 treesize of output 39 [2018-10-24 11:47:42,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:42,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:42,677 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-24 11:47:42,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:47:42,753 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-24 11:47:42,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:42,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:42,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:42,763 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-24 11:47:42,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:42,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:42,780 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-24 11:47:42,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-24 11:47:42,893 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-24 11:47:42,895 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:42,895 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:42,896 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:42,899 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-24 11:47:42,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:42,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:42,906 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-24 11:47:42,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-24 11:47:42,944 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-24 11:47:42,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:42,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-24 11:47:42,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-24 11:47:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-24 11:47:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-10-24 11:47:42,965 INFO L87 Difference]: Start difference. First operand 430 states and 471 transitions. Second operand 30 states. [2018-10-24 11:47:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:44,782 INFO L93 Difference]: Finished difference Result 613 states and 664 transitions. [2018-10-24 11:47:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-24 11:47:44,782 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-10-24 11:47:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:44,784 INFO L225 Difference]: With dead ends: 613 [2018-10-24 11:47:44,784 INFO L226 Difference]: Without dead ends: 611 [2018-10-24 11:47:44,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=379, Invalid=2273, Unknown=0, NotChecked=0, Total=2652 [2018-10-24 11:47:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-24 11:47:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 451. [2018-10-24 11:47:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-24 11:47:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 495 transitions. [2018-10-24 11:47:44,878 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 495 transitions. Word has length 77 [2018-10-24 11:47:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:44,878 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 495 transitions. [2018-10-24 11:47:44,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-24 11:47:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 495 transitions. [2018-10-24 11:47:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-24 11:47:44,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:44,880 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-24 11:47:44,880 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:44,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 704025505, now seen corresponding path program 8 times [2018-10-24 11:47:44,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:44,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:47:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:45,804 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-24 11:47:45,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:45,804 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-24 11:47:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:47:45,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:47:45,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:45,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:46,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 28 treesize of output 23 [2018-10-24 11:47:46,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,053 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-24 11:47:46,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,068 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-24 11:47:46,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:47:46,186 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-24 11:47:46,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,195 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-24 11:47:46,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,211 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-24 11:47:46,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-10-24 11:47:46,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 32 treesize of output 25 [2018-10-24 11:47:46,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,289 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-24 11:47:46,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,306 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-24 11:47:46,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-10-24 11:47:46,346 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-24 11:47:46,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:46,354 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-24 11:47:46,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,370 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-24 11:47:46,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-10-24 11:47:46,553 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-24 11:47:46,557 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-24 11:47:46,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:46,559 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-24 11:47:46,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:47:46,603 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-24 11:47:46,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:46,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-10-24 11:47:46,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 11:47:46,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 11:47:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 11:47:46,624 INFO L87 Difference]: Start difference. First operand 451 states and 495 transitions. Second operand 41 states. [2018-10-24 11:47:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:48,325 INFO L93 Difference]: Finished difference Result 609 states and 662 transitions. [2018-10-24 11:47:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-24 11:47:48,325 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2018-10-24 11:47:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:48,327 INFO L225 Difference]: With dead ends: 609 [2018-10-24 11:47:48,327 INFO L226 Difference]: Without dead ends: 607 [2018-10-24 11:47:48,327 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-24 11:47:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-24 11:47:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 472. [2018-10-24 11:47:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-24 11:47:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2018-10-24 11:47:48,426 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 77 [2018-10-24 11:47:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:48,426 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2018-10-24 11:47:48,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 11:47:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2018-10-24 11:47:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-24 11:47:48,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:48,427 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-24 11:47:48,428 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:48,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1402389330, now seen corresponding path program 5 times [2018-10-24 11:47:48,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:48,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:48,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:48,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:48,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:48,921 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-10-24 11:47:50,000 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-24 11:47:50,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:50,000 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-24 11:47:50,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:47:50,047 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-24 11:47:50,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:50,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:50,357 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-24 11:47:50,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:50,362 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-24 11:47:50,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:50,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:50,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-24 11:47:50,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-24 11:47:50,473 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-24 11:47:50,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:50,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:50,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:50,482 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-24 11:47:50,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:50,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:50,501 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-24 11:47:50,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-24 11:47:50,565 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-24 11:47:50,568 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-24 11:47:50,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:50,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:50,570 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-24 11:47:50,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:47:50,608 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-24 11:47:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 36 [2018-10-24 11:47:50,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-24 11:47:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-24 11:47:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 11:47:50,630 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand 36 states. [2018-10-24 11:47:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:52,627 INFO L93 Difference]: Finished difference Result 626 states and 680 transitions. [2018-10-24 11:47:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-24 11:47:52,627 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 78 [2018-10-24 11:47:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:52,630 INFO L225 Difference]: With dead ends: 626 [2018-10-24 11:47:52,630 INFO L226 Difference]: Without dead ends: 624 [2018-10-24 11:47:52,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 64 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=420, Invalid=3002, Unknown=0, NotChecked=0, Total=3422 [2018-10-24 11:47:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-24 11:47:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 479. [2018-10-24 11:47:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-24 11:47:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 528 transitions. [2018-10-24 11:47:52,713 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 528 transitions. Word has length 78 [2018-10-24 11:47:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:52,713 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 528 transitions. [2018-10-24 11:47:52,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-24 11:47:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 528 transitions. [2018-10-24 11:47:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-24 11:47:52,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:52,714 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-24 11:47:52,714 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:52,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash -644583150, now seen corresponding path program 6 times [2018-10-24 11:47:52,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:52,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:53,196 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-24 11:47:54,032 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-24 11:47:54,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:54,032 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-24 11:47:54,039 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:47:54,093 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-24 11:47:54,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:54,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:54,182 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-24 11:47:54,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,188 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-24 11:47:54,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,211 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-24 11:47:54,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-24 11:47:54,345 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-24 11:47:54,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,352 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,359 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-24 11:47:54,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,384 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-24 11:47:54,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-10-24 11:47:54,486 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-24 11:47:54,489 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,491 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,497 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-24 11:47:54,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,518 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-24 11:47:54,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-10-24 11:47:54,585 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-24 11:47:54,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,595 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-24 11:47:54,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,615 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-24 11:47:54,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-24 11:47:54,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 33 treesize of output 26 [2018-10-24 11:47:54,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,665 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-24 11:47:54,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,685 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-24 11:47:54,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-24 11:47:54,798 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-24 11:47:54,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:54,808 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-24 11:47:54,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,833 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-24 11:47:54,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2018-10-24 11:47:54,925 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-24 11:47:54,928 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-24 11:47:54,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:54,930 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-24 11:47:54,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:47:54,976 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-24 11:47:54,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:54,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 32 [2018-10-24 11:47:54,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 11:47:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 11:47:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-10-24 11:47:54,997 INFO L87 Difference]: Start difference. First operand 479 states and 528 transitions. Second operand 32 states. [2018-10-24 11:47:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:58,787 INFO L93 Difference]: Finished difference Result 994 states and 1086 transitions. [2018-10-24 11:47:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-24 11:47:58,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 78 [2018-10-24 11:47:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:58,790 INFO L225 Difference]: With dead ends: 994 [2018-10-24 11:47:58,790 INFO L226 Difference]: Without dead ends: 936 [2018-10-24 11:47:58,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 62 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1043, Invalid=5763, Unknown=0, NotChecked=0, Total=6806 [2018-10-24 11:47:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-10-24 11:47:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 592. [2018-10-24 11:47:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-24 11:47:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 655 transitions. [2018-10-24 11:47:58,894 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 655 transitions. Word has length 78 [2018-10-24 11:47:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:58,894 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 655 transitions. [2018-10-24 11:47:58,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 11:47:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 655 transitions. [2018-10-24 11:47:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 11:47:58,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:58,895 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-24 11:47:58,895 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:58,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1265415184, now seen corresponding path program 4 times [2018-10-24 11:47:58,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:58,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:58,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:59,294 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 11:47:59,646 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-24 11:48:01,837 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-24 11:48:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:01,837 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-24 11:48:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:48:01,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:48:01,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:01,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:02,216 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-24 11:48:02,220 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,222 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-24 11:48:02,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:02,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:02,245 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-24 11:48:02,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-24 11:48:02,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,478 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-24 11:48:02,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,482 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:02,488 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,488 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-24 11:48:02,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:02,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:02,508 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-24 11:48:02,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:29 [2018-10-24 11:48:02,726 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-24 11:48:02,730 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:02,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,738 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:02,740 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-24 11:48:02,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:02,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:02,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-24 11:48:02,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:56 [2018-10-24 11:48:03,071 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,072 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-24 11:48:03,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,085 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-24 11:48:03,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:48:03,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:03,135 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-24 11:48:03,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:50 [2018-10-24 11:48:03,347 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-24 11:48:03,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,529 INFO L303 Elim1Store]: Index analysis took 179 ms [2018-10-24 11:48:03,541 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-24 11:48:03,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:48:03,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:48:03,624 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-24 11:48:03,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:83 [2018-10-24 11:48:03,827 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-24 11:48:03,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:03,836 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-24 11:48:03,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:03,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:03,859 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-24 11:48:03,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2018-10-24 11:48:04,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 41 treesize of output 33 [2018-10-24 11:48:04,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:04,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:04,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:04,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:04,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:04,456 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-24 11:48:04,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:04,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:04,482 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-24 11:48:04,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2018-10-24 11:48:04,731 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-24 11:48:04,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:04,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 70 [2018-10-24 11:48:04,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-24 11:48:04,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-24 11:48:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4550, Unknown=0, NotChecked=0, Total=4830 [2018-10-24 11:48:04,755 INFO L87 Difference]: Start difference. First operand 592 states and 655 transitions. Second operand 70 states. [2018-10-24 11:48:08,536 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-24 11:48:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:12,625 INFO L93 Difference]: Finished difference Result 712 states and 780 transitions. [2018-10-24 11:48:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-24 11:48:12,625 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 79 [2018-10-24 11:48:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:12,628 INFO L225 Difference]: With dead ends: 712 [2018-10-24 11:48:12,628 INFO L226 Difference]: Without dead ends: 695 [2018-10-24 11:48:12,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5953 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1113, Invalid=16443, Unknown=0, NotChecked=0, Total=17556 [2018-10-24 11:48:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-24 11:48:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 591. [2018-10-24 11:48:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-24 11:48:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 653 transitions. [2018-10-24 11:48:12,745 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 653 transitions. Word has length 79 [2018-10-24 11:48:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:12,745 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 653 transitions. [2018-10-24 11:48:12,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-24 11:48:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 653 transitions. [2018-10-24 11:48:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-24 11:48:12,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:12,747 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-24 11:48:12,747 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:12,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash 82829615, now seen corresponding path program 5 times [2018-10-24 11:48:12,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:12,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:13,200 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-24 11:48:14,671 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-24 11:48:14,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:14,671 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-24 11:48:14,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:48:14,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-24 11:48:14,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:14,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:14,953 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-24 11:48:14,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:14,958 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-24 11:48:14,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:14,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:14,974 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-24 11:48:14,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-24 11:48:15,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 34 treesize of output 27 [2018-10-24 11:48:15,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,044 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-24 11:48:15,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:15,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:15,067 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-24 11:48:15,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-10-24 11:48:15,146 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-24 11:48:15,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,156 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-24 11:48:15,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:15,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:15,176 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-24 11:48:15,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-10-24 11:48:15,265 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-24 11:48:15,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,273 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,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, 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-24 11:48:15,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:15,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:15,314 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-24 11:48:15,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:48:15,549 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-24 11:48:15,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:15,609 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-24 11:48:15,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-24 11:48:15,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:48:15,712 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-24 11:48:15,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:105 [2018-10-24 11:48:16,116 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-24 11:48:16,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:16,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:16,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:16,132 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-24 11:48:16,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:16,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:16,150 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-24 11:48:16,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:19 [2018-10-24 11:48:16,361 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-24 11:48:16,365 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-24 11:48:16,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:16,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:16,369 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-24 11:48:16,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:48:16,437 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-24 11:48:16,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:16,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 50 [2018-10-24 11:48:16,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-24 11:48:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-24 11:48:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 11:48:16,460 INFO L87 Difference]: Start difference. First operand 591 states and 653 transitions. Second operand 50 states. [2018-10-24 11:48:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:22,361 INFO L93 Difference]: Finished difference Result 1007 states and 1095 transitions. [2018-10-24 11:48:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-24 11:48:22,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 81 [2018-10-24 11:48:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:22,367 INFO L225 Difference]: With dead ends: 1007 [2018-10-24 11:48:22,367 INFO L226 Difference]: Without dead ends: 893 [2018-10-24 11:48:22,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 54 SyntacticMatches, 21 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=850, Invalid=12260, Unknown=0, NotChecked=0, Total=13110 [2018-10-24 11:48:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-24 11:48:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 652. [2018-10-24 11:48:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-24 11:48:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 722 transitions. [2018-10-24 11:48:22,479 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 722 transitions. Word has length 81 [2018-10-24 11:48:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:22,479 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 722 transitions. [2018-10-24 11:48:22,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-24 11:48:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 722 transitions. [2018-10-24 11:48:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-24 11:48:22,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:22,481 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-24 11:48:22,481 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:22,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1325388897, now seen corresponding path program 9 times [2018-10-24 11:48:22,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:22,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:22,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:23,886 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-24 11:48:23,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:23,886 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-24 11:48:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:48:23,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 11:48:23,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:23,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:24,197 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-24 11:48:24,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,202 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-24 11:48:24,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:24,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:24,216 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-24 11:48:24,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:48:24,397 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-24 11:48:24,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,402 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,407 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-24 11:48:24,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:24,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:24,430 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-24 11:48:24,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-24 11:48:24,604 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-24 11:48:24,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,621 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-24 11:48:24,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:24,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:24,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-24 11:48:24,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:47 [2018-10-24 11:48:24,984 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-24 11:48:24,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:24,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:25,012 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-24 11:48:25,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:25,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:25,041 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-24 11:48:25,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:31 [2018-10-24 11:48:25,519 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-24 11:48:25,521 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:25,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:25,523 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:25,528 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-24 11:48:25,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:25,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:25,542 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-24 11:48:25,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:3 [2018-10-24 11:48:25,614 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-24 11:48:25,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:25,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 53 [2018-10-24 11:48:25,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-24 11:48:25,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-24 11:48:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2594, Unknown=0, NotChecked=0, Total=2756 [2018-10-24 11:48:25,636 INFO L87 Difference]: Start difference. First operand 652 states and 722 transitions. Second operand 53 states. [2018-10-24 11:48:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:30,941 INFO L93 Difference]: Finished difference Result 742 states and 817 transitions. [2018-10-24 11:48:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-24 11:48:30,942 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 82 [2018-10-24 11:48:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:30,944 INFO L225 Difference]: With dead ends: 742 [2018-10-24 11:48:30,944 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 11:48:30,945 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-24 11:48:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 11:48:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 674. [2018-10-24 11:48:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-10-24 11:48:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 746 transitions. [2018-10-24 11:48:31,054 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 746 transitions. Word has length 82 [2018-10-24 11:48:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:31,054 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 746 transitions. [2018-10-24 11:48:31,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-24 11:48:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 746 transitions. [2018-10-24 11:48:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-24 11:48:31,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:31,056 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-24 11:48:31,056 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:31,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash -754084382, now seen corresponding path program 8 times [2018-10-24 11:48:31,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:31,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:31,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:31,698 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-24 11:48:32,199 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-24 11:48:32,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:32,199 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-24 11:48:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:48:32,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:48:32,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:32,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:32,377 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-24 11:48:32,378 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-24 11:48:32,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:32,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:32,387 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-24 11:48:32,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:48:32,548 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-24 11:48:32,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:32,552 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-24 11:48:32,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:32,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:32,566 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-24 11:48:32,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-24 11:48:32,833 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-24 11:48:32,837 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-24 11:48:32,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:32,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:32,843 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-24 11:48:32,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:48:32,886 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-24 11:48:32,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:32,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-10-24 11:48:32,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-24 11:48:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-24 11:48:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 11:48:32,910 INFO L87 Difference]: Start difference. First operand 674 states and 746 transitions. Second operand 38 states. [2018-10-24 11:48:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:35,233 INFO L93 Difference]: Finished difference Result 1134 states and 1246 transitions. [2018-10-24 11:48:35,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-24 11:48:35,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-10-24 11:48:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:35,237 INFO L225 Difference]: With dead ends: 1134 [2018-10-24 11:48:35,237 INFO L226 Difference]: Without dead ends: 1132 [2018-10-24 11:48:35,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=429, Invalid=3861, Unknown=0, NotChecked=0, Total=4290 [2018-10-24 11:48:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-24 11:48:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 845. [2018-10-24 11:48:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-10-24 11:48:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 940 transitions. [2018-10-24 11:48:35,400 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 940 transitions. Word has length 84 [2018-10-24 11:48:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:35,401 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 940 transitions. [2018-10-24 11:48:35,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-24 11:48:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 940 transitions. [2018-10-24 11:48:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-24 11:48:35,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:35,402 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-24 11:48:35,403 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:35,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1734794316, now seen corresponding path program 7 times [2018-10-24 11:48:35,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:35,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:35,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:35,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:35,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:36,824 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-24 11:48:36,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:36,825 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-24 11:48:36,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:48:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:36,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:37,813 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-24 11:48:37,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:37,850 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-24 11:48:37,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:37,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:37,872 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-24 11:48:37,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:48:38,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,099 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-24 11:48:38,102 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,102 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:38,107 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,108 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-24 11:48:38,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,133 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-24 11:48:38,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-10-24 11:48: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, 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-24 11:48:38,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,281 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-24 11:48:38,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,304 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-24 11:48:38,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-10-24 11:48:38,399 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-24 11:48:38,402 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,405 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,409 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-24 11:48:38,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,432 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-24 11:48:38,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-10-24 11:48:38,533 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-24 11:48:38,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,559 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,564 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-24 11:48:38,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,590 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-24 11:48:38,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-24 11:48:38,650 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-24 11:48:38,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,661 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-24 11:48:38,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,685 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-24 11:48:38,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-24 11:48:38,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 36 treesize of output 29 [2018-10-24 11:48:38,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,757 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-24 11:48:38,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,780 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-24 11:48:38,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-10-24 11:48:38,937 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-24 11:48:38,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,958 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:38,959 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:38,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:38,960 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-24 11:48:38,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:38,975 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-24 11:48:38,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:48:39,037 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-24 11:48:39,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:39,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 49 [2018-10-24 11:48:39,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-24 11:48:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-24 11:48:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2140, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 11:48:39,060 INFO L87 Difference]: Start difference. First operand 845 states and 940 transitions. Second operand 49 states. [2018-10-24 11:48:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:43,447 INFO L93 Difference]: Finished difference Result 1120 states and 1236 transitions. [2018-10-24 11:48:43,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-24 11:48:43,448 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 85 [2018-10-24 11:48:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:43,451 INFO L225 Difference]: With dead ends: 1120 [2018-10-24 11:48:43,451 INFO L226 Difference]: Without dead ends: 1062 [2018-10-24 11:48:43,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=667, Invalid=7523, Unknown=0, NotChecked=0, Total=8190 [2018-10-24 11:48:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-10-24 11:48:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 879. [2018-10-24 11:48:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-10-24 11:48:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 978 transitions. [2018-10-24 11:48:43,616 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 978 transitions. Word has length 85 [2018-10-24 11:48:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:43,616 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 978 transitions. [2018-10-24 11:48:43,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-24 11:48:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 978 transitions. [2018-10-24 11:48:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-24 11:48:43,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:43,618 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-24 11:48:43,618 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:43,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash -533865805, now seen corresponding path program 10 times [2018-10-24 11:48:43,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:43,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:48:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:44,566 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-24 11:48:44,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:44,566 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-24 11:48:44,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:48:44,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:48:44,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:44,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:45,057 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-24 11:48:45,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,061 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-24 11:48:45,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,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-24 11:48:45,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:48:45,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,205 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-24 11:48:45,209 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,213 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-24 11:48:45,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,244 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-24 11:48:45,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-24 11:48:45,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 31 treesize of output 24 [2018-10-24 11:48:45,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,516 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-24 11:48:45,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,534 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-24 11:48:45,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-24 11:48:45,737 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-24 11:48:45,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:45,740 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-24 11:48:45,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:45,743 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-24 11:48:45,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:48:45,796 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-24 11:48:45,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:45,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-10-24 11:48:45,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-24 11:48:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-24 11:48:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2018-10-24 11:48:45,818 INFO L87 Difference]: Start difference. First operand 879 states and 978 transitions. Second operand 45 states. [2018-10-24 11:48:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:47,672 INFO L93 Difference]: Finished difference Result 1004 states and 1109 transitions. [2018-10-24 11:48:47,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 11:48:47,673 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2018-10-24 11:48:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:47,676 INFO L225 Difference]: With dead ends: 1004 [2018-10-24 11:48:47,677 INFO L226 Difference]: Without dead ends: 1002 [2018-10-24 11:48:47,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=406, Invalid=3884, Unknown=0, NotChecked=0, Total=4290 [2018-10-24 11:48:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-10-24 11:48:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 870. [2018-10-24 11:48:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-10-24 11:48:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 969 transitions. [2018-10-24 11:48:47,844 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 969 transitions. Word has length 85 [2018-10-24 11:48:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:47,844 INFO L481 AbstractCegarLoop]: Abstraction has 870 states and 969 transitions. [2018-10-24 11:48:47,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-24 11:48:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 969 transitions. [2018-10-24 11:48:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-24 11:48:47,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:47,845 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-24 11:48:47,845 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:47,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2068717775, now seen corresponding path program 11 times [2018-10-24 11:48:47,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:47,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:47,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:48,298 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-24 11:48:48,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:48,298 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-24 11:48:48,306 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:48:48,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-24 11:48:48,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:48,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:48,511 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-24 11:48:48,530 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-24 11:48:48,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,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-24 11:48:48,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:48:48,599 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-24 11:48:48,601 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-24 11:48:48,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,610 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-24 11:48:48,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:48:48,654 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-24 11:48:48,655 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-24 11:48:48,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,663 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-24 11:48:48,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-10-24 11:48:48,798 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-24 11:48:48,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:48,803 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-24 11:48:48,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:48,816 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-24 11:48:48,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-24 11:48:49,030 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-24 11:48:49,032 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-24 11:48:49,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:49,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:49,035 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-24 11:48:49,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:48:49,076 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-24 11:48:49,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:49,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-24 11:48:49,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 11:48:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 11:48:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 11:48:49,097 INFO L87 Difference]: Start difference. First operand 870 states and 969 transitions. Second operand 37 states. [2018-10-24 11:48:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:52,251 INFO L93 Difference]: Finished difference Result 1311 states and 1438 transitions. [2018-10-24 11:48:52,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-24 11:48:52,251 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 85 [2018-10-24 11:48:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:52,255 INFO L225 Difference]: With dead ends: 1311 [2018-10-24 11:48:52,255 INFO L226 Difference]: Without dead ends: 1309 [2018-10-24 11:48:52,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=787, Invalid=7045, Unknown=0, NotChecked=0, Total=7832 [2018-10-24 11:48:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2018-10-24 11:48:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 949. [2018-10-24 11:48:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2018-10-24 11:48:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1060 transitions. [2018-10-24 11:48:52,456 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1060 transitions. Word has length 85 [2018-10-24 11:48:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:52,456 INFO L481 AbstractCegarLoop]: Abstraction has 949 states and 1060 transitions. [2018-10-24 11:48:52,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 11:48:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1060 transitions. [2018-10-24 11:48:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-24 11:48:52,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:52,457 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-24 11:48:52,458 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:52,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash 570674658, now seen corresponding path program 12 times [2018-10-24 11:48:52,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:52,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:52,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:52,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:52,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:53,738 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-24 11:48:54,187 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-24 11:48:54,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:54,187 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-24 11:48:54,195 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:48:54,264 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-24 11:48:54,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:54,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:54,632 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-24 11:48:54,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,637 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-24 11:48:54,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,658 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-24 11:48:54,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:48:54,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,757 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-24 11:48:54,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,765 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-24 11:48:54,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,783 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-24 11:48:54,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-10-24 11:48:54,914 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-24 11:48:54,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,925 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-24 11:48:54,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,947 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-24 11:48:54,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-24 11:48:55,157 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-24 11:48:55,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:55,160 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-24 11:48:55,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,162 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-24 11:48:55,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:48:55,245 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-24 11:48:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-10-24 11:48:55,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-24 11:48:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-24 11:48:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 11:48:55,268 INFO L87 Difference]: Start difference. First operand 949 states and 1060 transitions. Second operand 44 states. [2018-10-24 11:48:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:58,255 INFO L93 Difference]: Finished difference Result 1163 states and 1283 transitions. [2018-10-24 11:48:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-24 11:48:58,256 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-10-24 11:48:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:58,259 INFO L225 Difference]: With dead ends: 1163 [2018-10-24 11:48:58,259 INFO L226 Difference]: Without dead ends: 1161 [2018-10-24 11:48:58,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=634, Invalid=4916, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 11:48:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2018-10-24 11:48:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 945. [2018-10-24 11:48:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-10-24 11:48:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1054 transitions. [2018-10-24 11:48:58,444 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1054 transitions. Word has length 86 [2018-10-24 11:48:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:58,444 INFO L481 AbstractCegarLoop]: Abstraction has 945 states and 1054 transitions. [2018-10-24 11:48:58,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-24 11:48:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1054 transitions. [2018-10-24 11:48:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-24 11:48:58,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:58,446 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-24 11:48:58,446 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:58,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -849888350, now seen corresponding path program 13 times [2018-10-24 11:48:58,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:58,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:58,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:59,073 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-24 11:48:59,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:59,073 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-24 11:48:59,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:48:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:59,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:59,241 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-24 11:48:59,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:59,302 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-24 11:48:59,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:59,326 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-24 11:48:59,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-24 11:48:59,435 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-24 11:48:59,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:59,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:59,439 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:48:59,441 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-24 11:48:59,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:59,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:59,447 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-24 11:48:59,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-24 11:48:59,477 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-24 11:48:59,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:59,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-10-24 11:48:59,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-24 11:48:59,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-24 11:48:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-24 11:48:59,499 INFO L87 Difference]: Start difference. First operand 945 states and 1054 transitions. Second operand 24 states. [2018-10-24 11:49:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:49:03,043 INFO L93 Difference]: Finished difference Result 1403 states and 1537 transitions. [2018-10-24 11:49:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-24 11:49:03,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-10-24 11:49:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:49:03,048 INFO L225 Difference]: With dead ends: 1403 [2018-10-24 11:49:03,048 INFO L226 Difference]: Without dead ends: 1401 [2018-10-24 11:49:03,049 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-24 11:49:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-24 11:49:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 978. [2018-10-24 11:49:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-10-24 11:49:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1092 transitions. [2018-10-24 11:49:03,240 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1092 transitions. Word has length 86 [2018-10-24 11:49:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:49:03,241 INFO L481 AbstractCegarLoop]: Abstraction has 978 states and 1092 transitions. [2018-10-24 11:49:03,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-24 11:49:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1092 transitions. [2018-10-24 11:49:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-24 11:49:03,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:49:03,242 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-24 11:49:03,242 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:49:03,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:49:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -107471819, now seen corresponding path program 7 times [2018-10-24 11:49:03,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:49:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:49:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:49:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:49:03,656 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-24 11:49:03,936 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-24 11:49:04,193 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-10-24 11:49:05,137 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-24 11:49:05,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:49:05,138 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-24 11:49:05,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:49:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:49:05,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:49:05,481 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-24 11:49:05,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,486 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-24 11:49:05,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:05,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:05,505 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-24 11:49:05,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-24 11:49:05,649 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-24 11:49:05,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,658 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-24 11:49:05,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:05,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:05,680 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-24 11:49:05,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-10-24 11:49:05,867 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-24 11:49:05,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,885 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-24 11:49:05,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:05,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:05,915 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-24 11:49:05,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2018-10-24 11:49:05,990 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-24 11:49:05,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:05,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:06,004 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-24 11:49:06,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:06,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:06,033 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-24 11:49:06,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2018-10-24 11:49:06,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 34 treesize of output 27 [2018-10-24 11:49:06,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:06,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:06,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:06,106 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-24 11:49:06,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:06,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:06,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-24 11:49:06,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-10-24 11:49:06,264 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-24 11:49:06,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:49:06,266 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:06,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:06,268 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:49:06,273 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-24 11:49:06,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:06,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:06,286 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-24 11:49:06,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 11:49:06,332 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-24 11:49:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:49:06,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2018-10-24 11:49:06,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-24 11:49:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-24 11:49:06,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 11:49:06,354 INFO L87 Difference]: Start difference. First operand 978 states and 1092 transitions. Second operand 43 states. [2018-10-24 11:49:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:49:09,797 INFO L93 Difference]: Finished difference Result 1189 states and 1317 transitions. [2018-10-24 11:49:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-24 11:49:09,797 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2018-10-24 11:49:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:49:09,801 INFO L225 Difference]: With dead ends: 1189 [2018-10-24 11:49:09,801 INFO L226 Difference]: Without dead ends: 1187 [2018-10-24 11:49:09,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=566, Invalid=5134, Unknown=0, NotChecked=0, Total=5700 [2018-10-24 11:49:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-10-24 11:49:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 993. [2018-10-24 11:49:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-10-24 11:49:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1109 transitions. [2018-10-24 11:49:09,982 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1109 transitions. Word has length 87 [2018-10-24 11:49:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:49:09,982 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1109 transitions. [2018-10-24 11:49:09,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-24 11:49:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1109 transitions. [2018-10-24 11:49:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-24 11:49:09,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:49:09,984 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-24 11:49:09,985 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:49:09,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:49:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1571272399, now seen corresponding path program 8 times [2018-10-24 11:49:09,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:49:09,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:49:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:49:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:49:10,364 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-24 11:49:10,601 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-24 11:49:10,852 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-24 11:49:11,141 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-24 11:49:11,418 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-24 11:49:11,963 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-24 11:49:11,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:49:11,964 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-24 11:49:11,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:49:12,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:49:12,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:49:12,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:49:12,274 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-24 11:49:12,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:12,278 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-24 11:49:12,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:12,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:12,294 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-24 11:49:12,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-10-24 11:49:12,374 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-24 11:49:12,378 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-24 11:49:12,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:12,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:12,380 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-24 11:49:12,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:49:12,477 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-24 11:49:12,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:49:12,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-24 11:49:12,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-24 11:49:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-24 11:49:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-10-24 11:49:12,500 INFO L87 Difference]: Start difference. First operand 993 states and 1109 transitions. Second operand 30 states. [2018-10-24 11:49:18,139 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-24 11:49:18,499 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-10-24 11:49:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:49:18,634 INFO L93 Difference]: Finished difference Result 1628 states and 1787 transitions. [2018-10-24 11:49:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-24 11:49:18,634 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-10-24 11:49:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:49:18,641 INFO L225 Difference]: With dead ends: 1628 [2018-10-24 11:49:18,641 INFO L226 Difference]: Without dead ends: 1556 [2018-10-24 11:49:18,643 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-24 11:49:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-10-24 11:49:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1009. [2018-10-24 11:49:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-10-24 11:49:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1128 transitions. [2018-10-24 11:49:18,856 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1128 transitions. Word has length 87 [2018-10-24 11:49:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:49:18,856 INFO L481 AbstractCegarLoop]: Abstraction has 1009 states and 1128 transitions. [2018-10-24 11:49:18,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-24 11:49:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1128 transitions. [2018-10-24 11:49:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 11:49:18,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:49:18,858 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-24 11:49:18,858 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:49:18,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:49:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 144675661, now seen corresponding path program 6 times [2018-10-24 11:49:18,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:49:18,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:49:18,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:18,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:49:18,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:49:19,669 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-24 11:49:21,926 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-24 11:49:21,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:49:21,926 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-24 11:49:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:49:21,973 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-24 11:49:21,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:49:21,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:49:22,104 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-24 11:49:22,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:49:22,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,113 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-24 11:49:22,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,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-24 11:49:22,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-24 11:49:22,256 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,256 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-24 11:49:22,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,263 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-24 11:49:22,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,280 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-24 11:49:22,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-10-24 11:49:22,323 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-24 11:49:22,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,328 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,334 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-24 11:49:22,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,358 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-24 11:49:22,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2018-10-24 11:49:22,415 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-24 11:49:22,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,419 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,424 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-24 11:49:22,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,458 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-24 11:49:22,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2018-10-24 11:49:22,594 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-24 11:49:22,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,602 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,607 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-24 11:49:22,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,667 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-24 11:49:22,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-24 11:49:22,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,903 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-24 11:49:22,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,916 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:49:22,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:22,926 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-24 11:49:22,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:49:22,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:22,990 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-24 11:49:22,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2018-10-24 11:49:23,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 61 treesize of output 50 [2018-10-24 11:49:23,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:23,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:23,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:23,203 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:23,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:23,211 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-24 11:49:23,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:23,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:23,236 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-24 11:49:23,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:37 [2018-10-24 11:49:23,441 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-24 11:49:23,444 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:23,445 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-24 11:49:23,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:23,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:23,449 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-24 11:49:23,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:49:23,526 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-24 11:49:23,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:49:23,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31] total 50 [2018-10-24 11:49:23,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-24 11:49:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-24 11:49:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 11:49:23,549 INFO L87 Difference]: Start difference. First operand 1009 states and 1128 transitions. Second operand 50 states. Received shutdown request... [2018-10-24 11:49:26,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 11:49:26,546 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 11:49:26,552 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 11:49:26,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:49:26 BoogieIcfgContainer [2018-10-24 11:49:26,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 11:49:26,553 INFO L168 Benchmark]: Toolchain (without parser) took 234887.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -494.8 MB). Peak memory consumption was 283.8 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:26,554 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:49:26,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.44 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-24 11:49:26,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.12 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-24 11:49:26,555 INFO L168 Benchmark]: Boogie Preprocessor took 51.76 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-24 11:49:26,555 INFO L168 Benchmark]: RCFGBuilder took 664.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:26,555 INFO L168 Benchmark]: TraceAbstraction took 233799.60 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 37.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 283.7 MB). Peak memory consumption was 320.9 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:26,556 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.44 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 53.12 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 51.76 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 664.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233799.60 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 37.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 283.7 MB). Peak memory consumption was 320.9 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 constructing difference of abstraction (1009states) and FLOYD_HOARE automaton (currently 39 states, 50 states before enhancement),while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. TIMEOUT Result, 233.7s OverallTime, 47 OverallIterations, 7 TraceHistogramMax, 128.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2416 SDtfs, 16629 SDslu, 30140 SDs, 0 SdLazy, 53379 SolverSat, 4684 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5552 GetRequests, 2207 SyntacticMatches, 353 SemanticMatches, 2992 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80084 ImplicationChecksByTransitivity, 151.0s 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.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 6185 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 97.0s 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