java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_find_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:52:19,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:52:19,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:52:19,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:52:19,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:52:19,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:52:19,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:52:19,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:52:19,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:52:19,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:52:19,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:52:19,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:52:19,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:52:19,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:52:19,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:52:19,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:52:19,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:52:19,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:52:19,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:52:19,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:52:19,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:52:19,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:52:19,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:52:19,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:52:19,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:52:19,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:52:19,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:52:19,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:52:19,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:52:19,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:52:19,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:52:19,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:52:19,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:52:19,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:52:19,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:52:19,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:52:19,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:52:19,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:52:19,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:52:19,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:52:19,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:52:19,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 09:52:19,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:52:19,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:52:19,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:52:19,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:52:19,890 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:52:19,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:52:19,890 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:52:19,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:52:19,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:52:19,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:52:19,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:52:19,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:52:19,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:52:19,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:52:19,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:52:19,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:52:19,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:52:19,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:52:19,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:52:19,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:52:19,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:52:19,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:52:19,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:52:19,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:52:19,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:52:19,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:52:19,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:52:19,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:52:19,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:52:19,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:52:19,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:52:19,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:52:19,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:52:19,941 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:52:19,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_find_ground-1.i [2019-09-07 09:52:20,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25cd08a6/d4b4002c057544a79b2cea43fa1fd0f7/FLAG3ecc13e53 [2019-09-07 09:52:20,509 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:52:20,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_find_ground-1.i [2019-09-07 09:52:20,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25cd08a6/d4b4002c057544a79b2cea43fa1fd0f7/FLAG3ecc13e53 [2019-09-07 09:52:20,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25cd08a6/d4b4002c057544a79b2cea43fa1fd0f7 [2019-09-07 09:52:20,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:52:20,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:52:20,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:52:20,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:52:20,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:52:20,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:52:20" (1/1) ... [2019-09-07 09:52:20,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c92838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:20, skipping insertion in model container [2019-09-07 09:52:20,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:52:20" (1/1) ... [2019-09-07 09:52:20,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:52:20,902 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:52:21,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:52:21,095 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:52:21,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:52:21,145 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:52:21,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21 WrapperNode [2019-09-07 09:52:21,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:52:21,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:52:21,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:52:21,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:52:21,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... [2019-09-07 09:52:21,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:52:21,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:52:21,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:52:21,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:52:21,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:52:21,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:52:21,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:52:21,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:52:21,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:52:21,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:52:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:52:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:52:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:52:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 09:52:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:52:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:52:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:52:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:52:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:52:21,594 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:52:21,594 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 09:52:21,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:52:21 BoogieIcfgContainer [2019-09-07 09:52:21,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:52:21,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:52:21,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:52:21,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:52:21,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:52:20" (1/3) ... [2019-09-07 09:52:21,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd3889c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:52:21, skipping insertion in model container [2019-09-07 09:52:21,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:21" (2/3) ... [2019-09-07 09:52:21,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd3889c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:52:21, skipping insertion in model container [2019-09-07 09:52:21,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:52:21" (3/3) ... [2019-09-07 09:52:21,620 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_find_ground-1.i [2019-09-07 09:52:21,628 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:52:21,635 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:52:21,650 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:52:21,676 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:52:21,677 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:52:21,677 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:52:21,677 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:52:21,677 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:52:21,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:52:21,677 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:52:21,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:52:21,677 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:52:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 09:52:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 09:52:21,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:21,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:21,702 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1063635089, now seen corresponding path program 1 times [2019-09-07 09:52:21,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:21,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:21,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:52:21,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:52:21,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 09:52:21,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 09:52:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 09:52:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:52:21,860 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 09:52:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:21,888 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-09-07 09:52:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 09:52:21,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-07 09:52:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:21,902 INFO L225 Difference]: With dead ends: 46 [2019-09-07 09:52:21,902 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 09:52:21,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:52:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 09:52:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 09:52:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 09:52:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-07 09:52:21,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2019-09-07 09:52:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:21,944 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-07 09:52:21,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 09:52:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-07 09:52:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 09:52:21,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:21,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:21,946 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:21,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash -977598642, now seen corresponding path program 1 times [2019-09-07 09:52:21,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:21,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:52:22,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:52:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:52:22,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:52:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:52:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:52:22,008 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2019-09-07 09:52:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:22,057 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-09-07 09:52:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:52:22,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 09:52:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:22,059 INFO L225 Difference]: With dead ends: 38 [2019-09-07 09:52:22,059 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 09:52:22,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:52:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 09:52:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-07 09:52:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 09:52:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-07 09:52:22,067 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-07 09:52:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:22,067 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-07 09:52:22,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:52:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-07 09:52:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 09:52:22,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:22,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:22,069 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1311771152, now seen corresponding path program 1 times [2019-09-07 09:52:22,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:22,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:52:22,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:22,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:22,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:52:22,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:52:22,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:22,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 09:52:22,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 09:52:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 09:52:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:52:22,259 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-09-07 09:52:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:22,293 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-07 09:52:22,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:52:22,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-07 09:52:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:22,295 INFO L225 Difference]: With dead ends: 40 [2019-09-07 09:52:22,296 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 09:52:22,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:52:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 09:52:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-07 09:52:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 09:52:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-07 09:52:22,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2019-09-07 09:52:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:22,302 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-07 09:52:22,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 09:52:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-07 09:52:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 09:52:22,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:22,304 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:22,304 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash -329006062, now seen corresponding path program 2 times [2019-09-07 09:52:22,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:22,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:22,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:52:22,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:22,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:22,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:22,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 09:52:22,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:52:22,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 09:52:22,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:52:22,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-07 09:52:22,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:52:22,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:52:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:52:22,512 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2019-09-07 09:52:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:22,609 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-09-07 09:52:22,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:52:22,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-07 09:52:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:22,611 INFO L225 Difference]: With dead ends: 47 [2019-09-07 09:52:22,611 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 09:52:22,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:52:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 09:52:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-07 09:52:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 09:52:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-07 09:52:22,619 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-07 09:52:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:22,619 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-07 09:52:22,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:52:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-07 09:52:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 09:52:22,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:22,621 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:22,621 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:22,621 INFO L82 PathProgramCache]: Analyzing trace with hash 66875228, now seen corresponding path program 1 times [2019-09-07 09:52:22,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:22,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:52:22,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:22,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:22,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:52:22,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 09:52:22,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:22,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 09:52:22,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:52:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:52:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:52:22,821 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2019-09-07 09:52:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:22,870 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-09-07 09:52:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:52:22,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-07 09:52:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:22,872 INFO L225 Difference]: With dead ends: 50 [2019-09-07 09:52:22,873 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 09:52:22,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:52:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 09:52:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 09:52:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 09:52:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 09:52:22,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 25 [2019-09-07 09:52:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:22,881 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 09:52:22,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:52:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 09:52:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 09:52:22,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:22,882 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:22,883 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1275909882, now seen corresponding path program 2 times [2019-09-07 09:52:22,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:22,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:52:22,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:22,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:22,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:52:23,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:52:23,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:23,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 09:52:23,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:52:23,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:23,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 09:52:23,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 09:52:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 09:52:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:52:23,047 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-09-07 09:52:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:23,087 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-07 09:52:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:52:23,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-07 09:52:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:23,089 INFO L225 Difference]: With dead ends: 52 [2019-09-07 09:52:23,089 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 09:52:23,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:52:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 09:52:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-07 09:52:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 09:52:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-07 09:52:23,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2019-09-07 09:52:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:23,096 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-07 09:52:23,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 09:52:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-07 09:52:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 09:52:23,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:23,097 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:23,098 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:23,098 INFO L82 PathProgramCache]: Analyzing trace with hash -777924840, now seen corresponding path program 3 times [2019-09-07 09:52:23,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:23,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:52:23,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:23,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:23,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:52:23,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 09:52:23,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:23,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:52:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:23,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:52:23,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:23,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:23,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:23,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:52:23,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:52:23,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:23,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 09:52:23,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:52:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:52:23,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:52:23,437 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 15 states. [2019-09-07 09:52:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:23,830 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2019-09-07 09:52:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:52:23,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-09-07 09:52:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:23,837 INFO L225 Difference]: With dead ends: 71 [2019-09-07 09:52:23,837 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 09:52:23,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:52:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 09:52:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-09-07 09:52:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 09:52:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-09-07 09:52:23,865 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 29 [2019-09-07 09:52:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:23,866 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-09-07 09:52:23,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:52:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-09-07 09:52:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 09:52:23,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:23,870 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:23,871 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1872928056, now seen corresponding path program 1 times [2019-09-07 09:52:23,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:23,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:23,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 09:52:23,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:52:23,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:52:23,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:52:23,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:52:23,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:52:23,925 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 3 states. [2019-09-07 09:52:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:23,946 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-09-07 09:52:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:52:23,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 09:52:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:23,953 INFO L225 Difference]: With dead ends: 68 [2019-09-07 09:52:23,954 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 09:52:23,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:52:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 09:52:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-07 09:52:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 09:52:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-07 09:52:23,965 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2019-09-07 09:52:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:23,966 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-07 09:52:23,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:52:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-07 09:52:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 09:52:23,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:23,972 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:23,972 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash 988397, now seen corresponding path program 1 times [2019-09-07 09:52:23,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:23,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:23,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:23,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:52:24,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:24,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:24,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:24,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:52:24,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 09:52:24,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:24,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 09:52:24,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:52:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:52:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:52:24,225 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 10 states. [2019-09-07 09:52:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:24,284 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-07 09:52:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:52:24,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-07 09:52:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:24,288 INFO L225 Difference]: With dead ends: 70 [2019-09-07 09:52:24,289 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 09:52:24,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:52:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 09:52:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-07 09:52:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 09:52:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-09-07 09:52:24,305 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2019-09-07 09:52:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:24,306 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-09-07 09:52:24,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:52:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-09-07 09:52:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 09:52:24,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:24,310 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:24,310 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1454714869, now seen corresponding path program 2 times [2019-09-07 09:52:24,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:24,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:24,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:52:24,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:24,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:24,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:24,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:52:24,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:24,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 09:52:24,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 09:52:24,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:24,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 09:52:24,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 09:52:24,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 09:52:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:52:24,545 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 11 states. [2019-09-07 09:52:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:24,596 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-09-07 09:52:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 09:52:24,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-07 09:52:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:24,597 INFO L225 Difference]: With dead ends: 72 [2019-09-07 09:52:24,597 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 09:52:24,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:52:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 09:52:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 09:52:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 09:52:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-09-07 09:52:24,604 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 41 [2019-09-07 09:52:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:24,605 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-09-07 09:52:24,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 09:52:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-09-07 09:52:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 09:52:24,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:24,606 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:24,606 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash -226214999, now seen corresponding path program 3 times [2019-09-07 09:52:24,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:24,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:24,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:52:24,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:24,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:24,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 09:52:24,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:24,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:52:24,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 09:52:24,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:24,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-07 09:52:24,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:52:24,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:52:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:52:24,829 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 15 states. [2019-09-07 09:52:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:25,035 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-07 09:52:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:52:25,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-09-07 09:52:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:25,037 INFO L225 Difference]: With dead ends: 84 [2019-09-07 09:52:25,037 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 09:52:25,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:52:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 09:52:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-07 09:52:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 09:52:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-09-07 09:52:25,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 43 [2019-09-07 09:52:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:25,056 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-09-07 09:52:25,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:52:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-09-07 09:52:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 09:52:25,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:25,057 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:25,058 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 461627959, now seen corresponding path program 4 times [2019-09-07 09:52:25,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:25,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:25,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:25,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 09:52:25,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:25,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:52:25,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:52:25,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:25,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:52:25,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:52:25,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:25,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 09:52:25,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:52:25,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:52:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:52:25,299 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 13 states. [2019-09-07 09:52:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:25,353 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-09-07 09:52:25,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:52:25,354 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-07 09:52:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:25,355 INFO L225 Difference]: With dead ends: 82 [2019-09-07 09:52:25,355 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 09:52:25,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:52:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 09:52:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-07 09:52:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 09:52:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-09-07 09:52:25,362 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 48 [2019-09-07 09:52:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:25,362 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-09-07 09:52:25,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:52:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-09-07 09:52:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 09:52:25,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:25,364 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:25,364 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash -354039591, now seen corresponding path program 5 times [2019-09-07 09:52:25,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:25,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:25,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 09:52:25,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:25,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:52:25,638 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-07 09:52:25,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:25,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:52:25,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:52:25,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:25,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 09:52:25,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:52:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:52:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:52:25,674 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 14 states. [2019-09-07 09:52:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:25,716 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-09-07 09:52:25,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 09:52:25,717 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-09-07 09:52:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:25,718 INFO L225 Difference]: With dead ends: 84 [2019-09-07 09:52:25,718 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 09:52:25,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:52:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 09:52:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-07 09:52:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 09:52:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-09-07 09:52:25,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 50 [2019-09-07 09:52:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:25,725 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-09-07 09:52:25,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:52:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-09-07 09:52:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 09:52:25,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:25,726 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:25,727 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1768460027, now seen corresponding path program 6 times [2019-09-07 09:52:25,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:25,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:25,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:25,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:25,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 09:52:25,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:25,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:25,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:52:25,882 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 09:52:25,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:25,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:52:25,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:26,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:52:26,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:26,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:26,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:26,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:52:26,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:52:26,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-09-07 09:52:26,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:52:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:52:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:52:26,083 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 23 states. [2019-09-07 09:52:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:26,772 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-09-07 09:52:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:52:26,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2019-09-07 09:52:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:26,774 INFO L225 Difference]: With dead ends: 96 [2019-09-07 09:52:26,774 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 09:52:26,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:52:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 09:52:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-09-07 09:52:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 09:52:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-09-07 09:52:26,782 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 52 [2019-09-07 09:52:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:26,783 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-09-07 09:52:26,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:52:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-09-07 09:52:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 09:52:26,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:26,784 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:26,784 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash -915645740, now seen corresponding path program 7 times [2019-09-07 09:52:26,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:26,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:26,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:26,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:26,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 09:52:26,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:26,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:26,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:52:26,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:52:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:26,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 09:52:26,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:52:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:52:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:52:27,000 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 16 states. [2019-09-07 09:52:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:27,062 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-09-07 09:52:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:52:27,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2019-09-07 09:52:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:27,063 INFO L225 Difference]: With dead ends: 104 [2019-09-07 09:52:27,063 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 09:52:27,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:52:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 09:52:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-07 09:52:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 09:52:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-07 09:52:27,070 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 62 [2019-09-07 09:52:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:27,070 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-07 09:52:27,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:52:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-07 09:52:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 09:52:27,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:27,072 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:27,072 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1721958922, now seen corresponding path program 8 times [2019-09-07 09:52:27,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 09:52:27,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:27,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:27,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:27,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:52:27,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:27,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 09:52:27,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:52:27,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:27,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 09:52:27,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:52:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:52:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:52:27,340 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 17 states. [2019-09-07 09:52:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:27,408 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2019-09-07 09:52:27,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 09:52:27,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2019-09-07 09:52:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:27,412 INFO L225 Difference]: With dead ends: 106 [2019-09-07 09:52:27,412 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 09:52:27,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:52:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 09:52:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-07 09:52:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 09:52:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-09-07 09:52:27,422 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 64 [2019-09-07 09:52:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:27,424 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-09-07 09:52:27,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:52:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-09-07 09:52:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 09:52:27,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:27,425 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:27,425 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash 800153752, now seen corresponding path program 9 times [2019-09-07 09:52:27,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:27,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:27,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 09:52:27,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:27,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:27,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:52:27,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:52:27,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:27,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:52:27,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-07 09:52:27,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:27,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 23 [2019-09-07 09:52:27,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:52:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:52:27,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:52:27,852 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 23 states. [2019-09-07 09:52:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:28,233 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-09-07 09:52:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:52:28,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-09-07 09:52:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:28,235 INFO L225 Difference]: With dead ends: 122 [2019-09-07 09:52:28,236 INFO L226 Difference]: Without dead ends: 76 [2019-09-07 09:52:28,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:52:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-07 09:52:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-07 09:52:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 09:52:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-09-07 09:52:28,263 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 66 [2019-09-07 09:52:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:28,263 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-09-07 09:52:28,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:52:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-09-07 09:52:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 09:52:28,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:28,268 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:28,269 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1986344498, now seen corresponding path program 10 times [2019-09-07 09:52:28,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:28,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:28,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:28,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:28,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 09:52:28,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:28,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:28,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:52:28,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:52:28,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:28,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:52:28,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 09:52:28,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:28,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 09:52:28,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:52:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:52:28,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:52:28,636 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 19 states. [2019-09-07 09:52:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:28,703 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2019-09-07 09:52:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:52:28,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2019-09-07 09:52:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:28,705 INFO L225 Difference]: With dead ends: 116 [2019-09-07 09:52:28,705 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 09:52:28,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:52:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 09:52:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 09:52:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 09:52:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-09-07 09:52:28,713 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 71 [2019-09-07 09:52:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:28,713 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-09-07 09:52:28,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:52:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-09-07 09:52:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:52:28,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:28,715 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:28,715 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -918750896, now seen corresponding path program 11 times [2019-09-07 09:52:28,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:28,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:28,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:28,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 256 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 09:52:28,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:28,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:52:29,094 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-07 09:52:29,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:29,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:52:29,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 09:52:29,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:29,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 09:52:29,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 09:52:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 09:52:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:52:29,137 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 20 states. [2019-09-07 09:52:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:29,206 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-09-07 09:52:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:52:29,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2019-09-07 09:52:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:29,208 INFO L225 Difference]: With dead ends: 118 [2019-09-07 09:52:29,208 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 09:52:29,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:52:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 09:52:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-07 09:52:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 09:52:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-09-07 09:52:29,214 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 73 [2019-09-07 09:52:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:29,214 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-09-07 09:52:29,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 09:52:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-09-07 09:52:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 09:52:29,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:29,215 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:29,216 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash -986682130, now seen corresponding path program 12 times [2019-09-07 09:52:29,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:29,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:29,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 09:52:29,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:29,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:29,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:52:29,472 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 09:52:29,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:29,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:52:29,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:29,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:52:29,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:29,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 09:52:29,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:29,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:29,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:29,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 09:52:29,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-07 09:52:29,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:29,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2019-09-07 09:52:29,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:52:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:52:29,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:52:29,862 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 31 states. [2019-09-07 09:52:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:30,982 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-09-07 09:52:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:52:30,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 75 [2019-09-07 09:52:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:30,984 INFO L225 Difference]: With dead ends: 141 [2019-09-07 09:52:30,984 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 09:52:30,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=678, Invalid=2402, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:52:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 09:52:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-07 09:52:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 09:52:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-09-07 09:52:30,994 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 75 [2019-09-07 09:52:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:30,994 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-09-07 09:52:30,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:52:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-09-07 09:52:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 09:52:30,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:30,995 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:30,996 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1015943520, now seen corresponding path program 13 times [2019-09-07 09:52:30,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:30,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:30,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 4 proven. 324 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 09:52:31,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:31,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:31,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:31,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:52:31,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 09:52:31,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:31,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 09:52:31,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:52:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:52:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:52:31,333 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 22 states. [2019-09-07 09:52:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:31,433 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-09-07 09:52:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:52:31,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2019-09-07 09:52:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:31,434 INFO L225 Difference]: With dead ends: 128 [2019-09-07 09:52:31,434 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 09:52:31,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:52:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 09:52:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-07 09:52:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 09:52:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-09-07 09:52:31,440 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 80 [2019-09-07 09:52:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:31,441 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-09-07 09:52:31,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:52:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-09-07 09:52:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 09:52:31,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:31,442 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:31,442 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1145097538, now seen corresponding path program 14 times [2019-09-07 09:52:31,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:31,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:31,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 4 proven. 361 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 09:52:31,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:31,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:52:31,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:52:31,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:31,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:52:31,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 09:52:31,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:31,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 09:52:31,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:52:31,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:52:31,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:52:31,853 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 23 states. [2019-09-07 09:52:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:31,949 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2019-09-07 09:52:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 09:52:31,955 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2019-09-07 09:52:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:31,956 INFO L225 Difference]: With dead ends: 130 [2019-09-07 09:52:31,956 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 09:52:31,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:52:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 09:52:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-07 09:52:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 09:52:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2019-09-07 09:52:31,961 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 82 [2019-09-07 09:52:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:31,962 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2019-09-07 09:52:31,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:52:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2019-09-07 09:52:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 09:52:31,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:31,963 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:31,963 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash -858616988, now seen corresponding path program 15 times [2019-09-07 09:52:31,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:31,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:31,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 4 proven. 400 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 09:52:32,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:32,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:32,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:32,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 09:52:32,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:32,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:52:32,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:32,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:52:32,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:32,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:32,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:32,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:52:32,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2019-09-07 09:52:32,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:32,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2019-09-07 09:52:32,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:52:32,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:52:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:52:32,717 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 34 states. [2019-09-07 09:52:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:33,710 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2019-09-07 09:52:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:52:33,710 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2019-09-07 09:52:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:33,712 INFO L225 Difference]: With dead ends: 142 [2019-09-07 09:52:33,712 INFO L226 Difference]: Without dead ends: 101 [2019-09-07 09:52:33,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=2511, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:52:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-07 09:52:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-09-07 09:52:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 09:52:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2019-09-07 09:52:33,719 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 84 [2019-09-07 09:52:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:33,719 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2019-09-07 09:52:33,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:52:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2019-09-07 09:52:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 09:52:33,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:33,720 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:33,721 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1092299203, now seen corresponding path program 16 times [2019-09-07 09:52:33,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:33,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:33,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 6 proven. 441 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 09:52:34,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:34,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:34,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:34,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:52:34,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:34,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:52:34,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 09:52:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:34,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 09:52:34,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:52:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:52:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:52:34,122 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 25 states. [2019-09-07 09:52:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:34,184 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2019-09-07 09:52:34,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:52:34,186 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2019-09-07 09:52:34,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:34,187 INFO L225 Difference]: With dead ends: 150 [2019-09-07 09:52:34,187 INFO L226 Difference]: Without dead ends: 101 [2019-09-07 09:52:34,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:52:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-07 09:52:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-07 09:52:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 09:52:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-09-07 09:52:34,194 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 94 [2019-09-07 09:52:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:34,194 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-09-07 09:52:34,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:52:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-09-07 09:52:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 09:52:34,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:34,196 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:34,196 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -500141729, now seen corresponding path program 17 times [2019-09-07 09:52:34,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:34,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:34,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:34,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 6 proven. 484 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 09:52:34,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:34,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:34,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:34,914 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 09:52:34,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:34,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:52:34,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 09:52:34,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:34,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 09:52:34,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 09:52:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 09:52:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:52:34,945 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 26 states. [2019-09-07 09:52:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:35,029 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2019-09-07 09:52:35,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:52:35,030 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2019-09-07 09:52:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:35,030 INFO L225 Difference]: With dead ends: 152 [2019-09-07 09:52:35,031 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 09:52:35,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:52:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 09:52:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-09-07 09:52:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 09:52:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-09-07 09:52:35,037 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 96 [2019-09-07 09:52:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:35,038 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-09-07 09:52:35,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 09:52:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-09-07 09:52:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 09:52:35,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:35,039 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:35,039 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1627507713, now seen corresponding path program 18 times [2019-09-07 09:52:35,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:35,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 09:52:35,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:35,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:35,407 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:52:35,471 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 09:52:35,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:35,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:52:35,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:35,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:35,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 09:52:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:35,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 09:52:35,783 INFO L567 ElimStorePlain]: treesize reduction 13, result has 51.9 percent of original size [2019-09-07 09:52:35,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:35,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:4 [2019-09-07 09:52:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-09-07 09:52:35,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:35,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15] total 39 [2019-09-07 09:52:35,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:52:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:52:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:52:35,858 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 39 states. [2019-09-07 09:52:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:37,975 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2019-09-07 09:52:37,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 09:52:37,975 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 98 [2019-09-07 09:52:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:37,976 INFO L225 Difference]: With dead ends: 179 [2019-09-07 09:52:37,977 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 09:52:37,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1152, Invalid=3960, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 09:52:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 09:52:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-07 09:52:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 09:52:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-09-07 09:52:37,989 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 98 [2019-09-07 09:52:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:37,990 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-09-07 09:52:37,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:52:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-09-07 09:52:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 09:52:37,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:37,991 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:37,991 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash 852133879, now seen corresponding path program 19 times [2019-09-07 09:52:37,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:37,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:37,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 09:52:38,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:38,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:38,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:38,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:52:38,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 09:52:38,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:38,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 09:52:38,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 09:52:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 09:52:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:52:38,389 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 28 states. [2019-09-07 09:52:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:38,485 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-09-07 09:52:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:52:38,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 103 [2019-09-07 09:52:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:38,487 INFO L225 Difference]: With dead ends: 162 [2019-09-07 09:52:38,488 INFO L226 Difference]: Without dead ends: 110 [2019-09-07 09:52:38,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:52:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-07 09:52:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-07 09:52:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 09:52:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2019-09-07 09:52:38,494 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 103 [2019-09-07 09:52:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:38,495 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2019-09-07 09:52:38,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 09:52:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2019-09-07 09:52:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 09:52:38,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:38,496 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:38,496 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2099139349, now seen corresponding path program 20 times [2019-09-07 09:52:38,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:38,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:38,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 6 proven. 625 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 09:52:38,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:38,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:38,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:52:38,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:52:38,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:38,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:52:38,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 09:52:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:38,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 09:52:38,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 09:52:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 09:52:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:52:38,917 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 29 states. [2019-09-07 09:52:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:39,031 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2019-09-07 09:52:39,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 09:52:39,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 105 [2019-09-07 09:52:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:39,033 INFO L225 Difference]: With dead ends: 164 [2019-09-07 09:52:39,033 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 09:52:39,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:52:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 09:52:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-07 09:52:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 09:52:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-09-07 09:52:39,040 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 105 [2019-09-07 09:52:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:39,040 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-09-07 09:52:39,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 09:52:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-09-07 09:52:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 09:52:39,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:39,042 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:39,042 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2119446861, now seen corresponding path program 21 times [2019-09-07 09:52:39,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:39,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:39,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 6 proven. 676 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 09:52:39,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:39,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:39,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:52:39,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 09:52:39,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:39,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:52:39,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:39,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:52:39,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:39,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:39,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:39,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:52:39,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2019-09-07 09:52:39,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 15] total 42 [2019-09-07 09:52:39,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 09:52:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 09:52:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:52:39,961 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 42 states. [2019-09-07 09:52:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:41,401 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2019-09-07 09:52:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 09:52:41,402 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 107 [2019-09-07 09:52:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:41,403 INFO L225 Difference]: With dead ends: 176 [2019-09-07 09:52:41,404 INFO L226 Difference]: Without dead ends: 124 [2019-09-07 09:52:41,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1259, Invalid=3853, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 09:52:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-07 09:52:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-09-07 09:52:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-07 09:52:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2019-09-07 09:52:41,412 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 107 [2019-09-07 09:52:41,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:41,412 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2019-09-07 09:52:41,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 09:52:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2019-09-07 09:52:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 09:52:41,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:41,413 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:41,414 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:41,414 INFO L82 PathProgramCache]: Analyzing trace with hash 702770440, now seen corresponding path program 22 times [2019-09-07 09:52:41,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:41,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:41,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:41,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:41,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 8 proven. 729 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 09:52:41,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:41,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:41,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:52:41,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:52:41,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:41,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:52:41,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-07 09:52:41,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:41,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 09:52:41,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:52:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:52:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:52:41,874 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand 31 states. [2019-09-07 09:52:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:41,979 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2019-09-07 09:52:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:52:41,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 117 [2019-09-07 09:52:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:41,981 INFO L225 Difference]: With dead ends: 184 [2019-09-07 09:52:41,981 INFO L226 Difference]: Without dead ends: 124 [2019-09-07 09:52:41,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:52:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-07 09:52:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-07 09:52:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-07 09:52:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2019-09-07 09:52:41,988 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 117 [2019-09-07 09:52:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:41,988 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2019-09-07 09:52:41,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:52:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2019-09-07 09:52:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 09:52:41,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:41,990 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:41,990 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash -336696410, now seen corresponding path program 23 times [2019-09-07 09:52:41,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:41,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:41,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:41,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:41,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 8 proven. 784 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 09:52:42,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:42,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:42,416 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:52:43,067 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-09-07 09:52:43,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:43,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:52:43,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-07 09:52:43,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:43,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 09:52:43,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 09:52:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 09:52:43,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:52:43,103 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 32 states. [2019-09-07 09:52:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:43,221 INFO L93 Difference]: Finished difference Result 186 states and 192 transitions. [2019-09-07 09:52:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:52:43,227 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2019-09-07 09:52:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:43,228 INFO L225 Difference]: With dead ends: 186 [2019-09-07 09:52:43,228 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 09:52:43,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:52:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 09:52:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-07 09:52:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-07 09:52:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2019-09-07 09:52:43,237 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 119 [2019-09-07 09:52:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:43,238 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2019-09-07 09:52:43,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 09:52:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2019-09-07 09:52:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 09:52:43,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:43,246 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:43,247 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:43,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1463040708, now seen corresponding path program 24 times [2019-09-07 09:52:43,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:43,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:43,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:43,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:43,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 8 proven. 841 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 09:52:43,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:43,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:43,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:43,801 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 09:52:43,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:43,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:52:43,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:44,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 09:52:44,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:44,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:44,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:44,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 09:52:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2019-09-07 09:52:44,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:44,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17] total 47 [2019-09-07 09:52:44,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:52:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:52:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:52:44,215 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 47 states. [2019-09-07 09:52:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:45,842 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2019-09-07 09:52:45,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:52:45,845 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 121 [2019-09-07 09:52:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:45,847 INFO L225 Difference]: With dead ends: 221 [2019-09-07 09:52:45,847 INFO L226 Difference]: Without dead ends: 161 [2019-09-07 09:52:45,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1531, Invalid=4631, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 09:52:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-07 09:52:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2019-09-07 09:52:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 09:52:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2019-09-07 09:52:45,864 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 121 [2019-09-07 09:52:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:45,865 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2019-09-07 09:52:45,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:52:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2019-09-07 09:52:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 09:52:45,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:45,868 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:45,869 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1370170150, now seen corresponding path program 25 times [2019-09-07 09:52:45,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:45,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 8 proven. 900 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 09:52:46,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:46,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:52:46,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:46,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:52:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 09:52:46,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 09:52:46,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:52:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:52:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:52:46,435 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 34 states. [2019-09-07 09:52:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:46,578 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2019-09-07 09:52:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:52:46,584 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 126 [2019-09-07 09:52:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:46,585 INFO L225 Difference]: With dead ends: 244 [2019-09-07 09:52:46,585 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 09:52:46,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:52:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 09:52:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-07 09:52:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 09:52:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-09-07 09:52:46,595 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 126 [2019-09-07 09:52:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:46,595 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-09-07 09:52:46,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:52:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-09-07 09:52:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 09:52:46,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:46,597 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:46,597 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash -562973112, now seen corresponding path program 26 times [2019-09-07 09:52:46,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:46,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:46,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:52:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 8 proven. 961 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 09:52:47,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:47,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:52:47,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:52:47,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:52:47,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:47,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:52:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 09:52:47,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:47,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 09:52:47,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:52:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:52:47,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:52:47,404 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 35 states. [2019-09-07 09:52:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:47,545 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2019-09-07 09:52:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:52:47,546 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2019-09-07 09:52:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:47,548 INFO L225 Difference]: With dead ends: 246 [2019-09-07 09:52:47,548 INFO L226 Difference]: Without dead ends: 159 [2019-09-07 09:52:47,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:52:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-07 09:52:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-07 09:52:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-07 09:52:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-09-07 09:52:47,563 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 128 [2019-09-07 09:52:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:47,563 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-09-07 09:52:47,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:52:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-09-07 09:52:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 09:52:47,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:47,565 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:47,565 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1407191274, now seen corresponding path program 27 times [2019-09-07 09:52:47,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:47,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:47,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 8 proven. 1024 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 09:52:48,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:48,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-09-07 09:52:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:52:48,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 09:52:48,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:48,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:52:48,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:48,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 09:52:48,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:48,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:48,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:48,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 09:52:48,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 8 proven. 92 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-09-07 09:52:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 17] total 50 [2019-09-07 09:52:48,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 09:52:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 09:52:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=1820, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:52:48,737 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 50 states. [2019-09-07 09:52:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:50,599 INFO L93 Difference]: Finished difference Result 258 states and 277 transitions. [2019-09-07 09:52:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 09:52:50,599 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 130 [2019-09-07 09:52:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:50,600 INFO L225 Difference]: With dead ends: 258 [2019-09-07 09:52:50,600 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 09:52:50,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1831, Invalid=5479, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 09:52:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 09:52:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 141. [2019-09-07 09:52:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 09:52:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2019-09-07 09:52:50,611 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 130 [2019-09-07 09:52:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:50,611 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2019-09-07 09:52:50,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 09:52:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2019-09-07 09:52:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 09:52:50,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:50,612 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:50,612 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 168366963, now seen corresponding path program 28 times [2019-09-07 09:52:50,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:50,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 10 proven. 1089 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-07 09:52:51,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:51,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:52:51,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:52:51,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:52:51,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:51,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:52:51,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-09-07 09:52:51,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:51,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 48 [2019-09-07 09:52:51,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 09:52:51,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 09:52:51,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=1566, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 09:52:51,677 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 48 states. [2019-09-07 09:52:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:52,858 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2019-09-07 09:52:52,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 09:52:52,864 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 137 [2019-09-07 09:52:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:52,865 INFO L225 Difference]: With dead ends: 238 [2019-09-07 09:52:52,865 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 09:52:52,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2118, Invalid=4524, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 09:52:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 09:52:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-07 09:52:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 09:52:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-09-07 09:52:52,876 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 137 [2019-09-07 09:52:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:52,876 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-09-07 09:52:52,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 09:52:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-09-07 09:52:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 09:52:52,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:52,878 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:52,878 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:52,878 INFO L82 PathProgramCache]: Analyzing trace with hash -906898971, now seen corresponding path program 29 times [2019-09-07 09:52:52,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:52,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:52,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 10 proven. 1156 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 09:52:53,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:53,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:52:53,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:52:55,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-09-07 09:52:55,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:55,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:52:55,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-07 09:52:55,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:55,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 09:52:55,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:52:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:52:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:52:55,350 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 38 states. [2019-09-07 09:52:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:52:55,480 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2019-09-07 09:52:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 09:52:55,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 142 [2019-09-07 09:52:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:52:55,481 INFO L225 Difference]: With dead ends: 220 [2019-09-07 09:52:55,481 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 09:52:55,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:52:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 09:52:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-07 09:52:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-07 09:52:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-09-07 09:52:55,490 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 142 [2019-09-07 09:52:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:52:55,492 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-09-07 09:52:55,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:52:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-09-07 09:52:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 09:52:55,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:52:55,493 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:52:55,494 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:52:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:52:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1270997255, now seen corresponding path program 30 times [2019-09-07 09:52:55,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:52:55,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:52:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:55,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:52:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:52:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:52:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 10 proven. 1225 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 09:52:56,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:52:56,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:52:56,177 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:52:56,346 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 09:52:56,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:52:56,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:52:56,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:52:56,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:52:56,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:56,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 09:52:56,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:52:56,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:52:56,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:52:56,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 09:52:56,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:52:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 38 proven. 85 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-09-07 09:52:57,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:52:57,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 19] total 55 [2019-09-07 09:52:57,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 09:52:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 09:52:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=2201, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:52:57,068 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 55 states. [2019-09-07 09:53:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:04,054 INFO L93 Difference]: Finished difference Result 255 states and 269 transitions. [2019-09-07 09:53:04,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 09:53:04,054 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 144 [2019-09-07 09:53:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:04,055 INFO L225 Difference]: With dead ends: 255 [2019-09-07 09:53:04,055 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 09:53:04,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2475, Invalid=8237, Unknown=0, NotChecked=0, Total=10712 [2019-09-07 09:53:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 09:53:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-07 09:53:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-07 09:53:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2019-09-07 09:53:04,064 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 144 [2019-09-07 09:53:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:04,064 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2019-09-07 09:53:04,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 09:53:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2019-09-07 09:53:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 09:53:04,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:04,066 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:04,066 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 908448333, now seen corresponding path program 31 times [2019-09-07 09:53:04,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:04,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:04,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 10 proven. 1296 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 09:53:04,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:04,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:04,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:53:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:04,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 09:53:04,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-09-07 09:53:04,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:04,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 09:53:04,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:53:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:53:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:53:04,891 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand 40 states. [2019-09-07 09:53:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:05,038 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-09-07 09:53:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:53:05,040 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 149 [2019-09-07 09:53:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:05,041 INFO L225 Difference]: With dead ends: 230 [2019-09-07 09:53:05,041 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 09:53:05,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:53:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 09:53:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-07 09:53:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-07 09:53:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2019-09-07 09:53:05,050 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 149 [2019-09-07 09:53:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:05,050 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2019-09-07 09:53:05,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:53:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2019-09-07 09:53:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 09:53:05,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:05,051 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:05,051 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:05,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:05,052 INFO L82 PathProgramCache]: Analyzing trace with hash 132045035, now seen corresponding path program 32 times [2019-09-07 09:53:05,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:05,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:53:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 10 proven. 1369 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 09:53:05,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:05,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:05,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:53:05,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:53:05,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:05,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:53:05,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-09-07 09:53:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:05,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 09:53:05,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 09:53:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 09:53:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:53:05,871 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 41 states. [2019-09-07 09:53:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:06,016 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2019-09-07 09:53:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 09:53:06,025 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 151 [2019-09-07 09:53:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:06,026 INFO L225 Difference]: With dead ends: 232 [2019-09-07 09:53:06,026 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 09:53:06,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:53:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 09:53:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-07 09:53:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-07 09:53:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-09-07 09:53:06,045 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 151 [2019-09-07 09:53:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:06,046 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-09-07 09:53:06,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 09:53:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-09-07 09:53:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-07 09:53:06,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:06,047 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:06,048 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1332785161, now seen corresponding path program 33 times [2019-09-07 09:53:06,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:06,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:06,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:06,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:06,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 10 proven. 1444 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 09:53:06,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:06,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:06,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:53:06,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 09:53:06,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:06,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 09:53:06,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:07,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:53:07,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:53:07,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:53:07,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:53:07,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:53:07,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:53:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 10 proven. 131 refuted. 0 times theorem prover too weak. 1487 trivial. 0 not checked. [2019-09-07 09:53:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:07,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 19] total 58 [2019-09-07 09:53:07,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 09:53:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 09:53:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=860, Invalid=2446, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:53:07,413 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 58 states. [2019-09-07 09:53:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:10,026 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-09-07 09:53:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 09:53:10,026 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 153 [2019-09-07 09:53:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:10,028 INFO L225 Difference]: With dead ends: 244 [2019-09-07 09:53:10,028 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 09:53:10,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2511, Invalid=7389, Unknown=0, NotChecked=0, Total=9900 [2019-09-07 09:53:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 09:53:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-09-07 09:53:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-07 09:53:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-09-07 09:53:10,037 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 153 [2019-09-07 09:53:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:10,037 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-09-07 09:53:10,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 09:53:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-09-07 09:53:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 09:53:10,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:10,039 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:10,039 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash -199453730, now seen corresponding path program 34 times [2019-09-07 09:53:10,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:10,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 12 proven. 1521 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-09-07 09:53:10,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:10,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:53:10,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:53:10,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:10,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 09:53:10,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:53:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:10,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 09:53:10,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:53:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:53:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:53:10,911 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 43 states. [2019-09-07 09:53:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:11,049 INFO L93 Difference]: Finished difference Result 252 states and 258 transitions. [2019-09-07 09:53:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 09:53:11,050 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 163 [2019-09-07 09:53:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:11,051 INFO L225 Difference]: With dead ends: 252 [2019-09-07 09:53:11,051 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 09:53:11,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:53:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 09:53:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-07 09:53:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-07 09:53:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2019-09-07 09:53:11,058 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 163 [2019-09-07 09:53:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:11,058 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2019-09-07 09:53:11,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:53:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2019-09-07 09:53:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 09:53:11,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:11,060 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:11,060 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1744743932, now seen corresponding path program 35 times [2019-09-07 09:53:11,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:11,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1828 backedges. 12 proven. 1600 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-09-07 09:53:11,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:11,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:11,826 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:53:25,831 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-09-07 09:53:25,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:25,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 09:53:25,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1828 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-09-07 09:53:25,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:25,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-07 09:53:25,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 09:53:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 09:53:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:53:25,892 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand 44 states. [2019-09-07 09:53:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:26,036 INFO L93 Difference]: Finished difference Result 254 states and 260 transitions. [2019-09-07 09:53:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:53:26,037 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 165 [2019-09-07 09:53:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:26,037 INFO L225 Difference]: With dead ends: 254 [2019-09-07 09:53:26,038 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 09:53:26,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:53:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 09:53:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-07 09:53:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 09:53:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2019-09-07 09:53:26,046 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 165 [2019-09-07 09:53:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:26,046 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2019-09-07 09:53:26,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 09:53:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2019-09-07 09:53:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 09:53:26,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:26,048 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:26,048 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1807923354, now seen corresponding path program 36 times [2019-09-07 09:53:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:26,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:26,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1909 backedges. 12 proven. 1681 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-09-07 09:53:26,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:26,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:26,789 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:53:27,056 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-07 09:53:27,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:27,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:53:27,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:27,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:53:27,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 09:53:28,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:53:28,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 09:53:28,018 INFO L567 ElimStorePlain]: treesize reduction 13, result has 51.9 percent of original size [2019-09-07 09:53:28,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:53:28,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:4 [2019-09-07 09:53:28,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:53:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1909 backedges. 78 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:53:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21] total 63 [2019-09-07 09:53:28,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 09:53:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 09:53:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=2872, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:53:28,215 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 63 states. [2019-09-07 09:53:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:33,933 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-09-07 09:53:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 09:53:33,933 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 167 [2019-09-07 09:53:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:33,935 INFO L225 Difference]: With dead ends: 293 [2019-09-07 09:53:33,935 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 09:53:33,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2870 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3336, Invalid=10944, Unknown=0, NotChecked=0, Total=14280 [2019-09-07 09:53:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 09:53:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-07 09:53:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 09:53:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 179 transitions. [2019-09-07 09:53:33,945 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 179 transitions. Word has length 167 [2019-09-07 09:53:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:33,945 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 179 transitions. [2019-09-07 09:53:33,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 09:53:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2019-09-07 09:53:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 09:53:33,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:33,947 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:33,947 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1496649644, now seen corresponding path program 37 times [2019-09-07 09:53:33,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:33,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 12 proven. 1764 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-07 09:53:34,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:34,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:34,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:53:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:34,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 09:53:34,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:53:34,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:34,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 09:53:34,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 09:53:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 09:53:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:53:34,938 INFO L87 Difference]: Start difference. First operand 176 states and 179 transitions. Second operand 46 states. [2019-09-07 09:53:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:35,119 INFO L93 Difference]: Finished difference Result 264 states and 270 transitions. [2019-09-07 09:53:35,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 09:53:35,120 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 172 [2019-09-07 09:53:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:35,122 INFO L225 Difference]: With dead ends: 264 [2019-09-07 09:53:35,122 INFO L226 Difference]: Without dead ends: 179 [2019-09-07 09:53:35,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:53:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-07 09:53:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-07 09:53:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 09:53:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 181 transitions. [2019-09-07 09:53:35,130 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 181 transitions. Word has length 172 [2019-09-07 09:53:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:35,131 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 181 transitions. [2019-09-07 09:53:35,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 09:53:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 181 transitions. [2019-09-07 09:53:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 09:53:35,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:35,133 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:35,133 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash 967538510, now seen corresponding path program 38 times [2019-09-07 09:53:35,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:35,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:35,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:53:35,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 12 proven. 1849 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-07 09:53:36,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:36,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:53:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:53:36,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:53:36,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:36,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 09:53:36,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 09:53:36,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 09:53:36,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:53:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:53:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:53:36,137 INFO L87 Difference]: Start difference. First operand 178 states and 181 transitions. Second operand 47 states. [2019-09-07 09:53:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:36,327 INFO L93 Difference]: Finished difference Result 266 states and 272 transitions. [2019-09-07 09:53:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 09:53:36,328 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 174 [2019-09-07 09:53:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:36,329 INFO L225 Difference]: With dead ends: 266 [2019-09-07 09:53:36,329 INFO L226 Difference]: Without dead ends: 181 [2019-09-07 09:53:36,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:53:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-07 09:53:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-07 09:53:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-07 09:53:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2019-09-07 09:53:36,335 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 174 [2019-09-07 09:53:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:36,335 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2019-09-07 09:53:36,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:53:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2019-09-07 09:53:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-07 09:53:36,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:36,336 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:36,337 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash -702120336, now seen corresponding path program 39 times [2019-09-07 09:53:36,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:36,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:36,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 12 proven. 1936 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-07 09:53:37,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:37,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-07 09:53:37,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:53:37,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 09:53:37,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:37,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 09:53:37,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:38,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:53:38,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:53:38,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:53:38,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:53:38,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:53:38,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:53:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 1999 trivial. 0 not checked. [2019-09-07 09:53:38,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:38,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 21] total 66 [2019-09-07 09:53:38,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-07 09:53:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-07 09:53:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1126, Invalid=3164, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 09:53:38,191 INFO L87 Difference]: Start difference. First operand 180 states and 183 transitions. Second operand 66 states. [2019-09-07 09:53:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:41,568 INFO L93 Difference]: Finished difference Result 278 states and 285 transitions. [2019-09-07 09:53:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 09:53:41,569 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 176 [2019-09-07 09:53:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:41,570 INFO L225 Difference]: With dead ends: 278 [2019-09-07 09:53:41,570 INFO L226 Difference]: Without dead ends: 193 [2019-09-07 09:53:41,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2314 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3299, Invalid=9583, Unknown=0, NotChecked=0, Total=12882 [2019-09-07 09:53:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-07 09:53:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2019-09-07 09:53:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-07 09:53:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 193 transitions. [2019-09-07 09:53:41,578 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 193 transitions. Word has length 176 [2019-09-07 09:53:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:41,578 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 193 transitions. [2019-09-07 09:53:41,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-07 09:53:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 193 transitions. [2019-09-07 09:53:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 09:53:41,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:41,580 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:41,580 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -378730935, now seen corresponding path program 40 times [2019-09-07 09:53:41,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:41,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 14 proven. 2025 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-07 09:53:42,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:42,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:53:42,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:53:42,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:53:42,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:53:42,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 09:53:42,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:53:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-09-07 09:53:42,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:53:42,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 09:53:42,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:53:42,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:53:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:53:42,846 INFO L87 Difference]: Start difference. First operand 190 states and 193 transitions. Second operand 49 states. [2019-09-07 09:53:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:53:42,992 INFO L93 Difference]: Finished difference Result 286 states and 292 transitions. [2019-09-07 09:53:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 09:53:42,992 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 186 [2019-09-07 09:53:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:53:42,994 INFO L225 Difference]: With dead ends: 286 [2019-09-07 09:53:42,994 INFO L226 Difference]: Without dead ends: 193 [2019-09-07 09:53:42,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:53:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-07 09:53:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-07 09:53:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-07 09:53:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 195 transitions. [2019-09-07 09:53:43,006 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 195 transitions. Word has length 186 [2019-09-07 09:53:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:53:43,006 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 195 transitions. [2019-09-07 09:53:43,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:53:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 195 transitions. [2019-09-07 09:53:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 09:53:43,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:53:43,008 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:53:43,008 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:53:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:53:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -402888085, now seen corresponding path program 41 times [2019-09-07 09:53:43,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:53:43,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:53:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:43,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:53:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:53:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:53:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 14 proven. 2116 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-07 09:53:43,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:53:43,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:53:43,919 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:54:00,554 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-09-07 09:54:00,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:00,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 09:54:00,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-09-07 09:54:00,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:00,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 09:54:00,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 09:54:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 09:54:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:54:00,624 INFO L87 Difference]: Start difference. First operand 192 states and 195 transitions. Second operand 50 states. [2019-09-07 09:54:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:00,816 INFO L93 Difference]: Finished difference Result 288 states and 294 transitions. [2019-09-07 09:54:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:54:00,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 188 [2019-09-07 09:54:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:00,817 INFO L225 Difference]: With dead ends: 288 [2019-09-07 09:54:00,817 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 09:54:00,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:54:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 09:54:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-07 09:54:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 09:54:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2019-09-07 09:54:00,826 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 188 [2019-09-07 09:54:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:00,826 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2019-09-07 09:54:00,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 09:54:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2019-09-07 09:54:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 09:54:00,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:00,827 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:00,828 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2143072755, now seen corresponding path program 42 times [2019-09-07 09:54:00,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:00,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 14 proven. 2209 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-07 09:54:01,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:01,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:01,779 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:54:02,071 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-07 09:54:02,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:02,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:54:02,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:03,011 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:54:03,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:54:03,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 09:54:03,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:54:03,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:54:03,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:54:03,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 09:54:03,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:54:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 80 proven. 140 refuted. 0 times theorem prover too weak. 2293 trivial. 0 not checked. [2019-09-07 09:54:03,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:03,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23] total 71 [2019-09-07 09:54:03,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 09:54:03,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 09:54:03,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=3645, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 09:54:03,212 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 71 states. [2019-09-07 09:54:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:10,499 INFO L93 Difference]: Finished difference Result 331 states and 347 transitions. [2019-09-07 09:54:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-07 09:54:10,500 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 190 [2019-09-07 09:54:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:10,501 INFO L225 Difference]: With dead ends: 331 [2019-09-07 09:54:10,501 INFO L226 Difference]: Without dead ends: 200 [2019-09-07 09:54:10,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3694 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4310, Invalid=14050, Unknown=0, NotChecked=0, Total=18360 [2019-09-07 09:54:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-07 09:54:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-07 09:54:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-07 09:54:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 202 transitions. [2019-09-07 09:54:10,511 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 202 transitions. Word has length 190 [2019-09-07 09:54:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:10,511 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 202 transitions. [2019-09-07 09:54:10,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 09:54:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 202 transitions. [2019-09-07 09:54:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-07 09:54:10,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:10,513 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:10,513 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1781666653, now seen corresponding path program 43 times [2019-09-07 09:54:10,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:10,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2635 backedges. 14 proven. 2304 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 09:54:11,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:11,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:11,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:54:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:11,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 09:54:11,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2635 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:54:11,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:11,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 09:54:11,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 09:54:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 09:54:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:54:11,744 INFO L87 Difference]: Start difference. First operand 199 states and 202 transitions. Second operand 52 states. [2019-09-07 09:54:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:12,018 INFO L93 Difference]: Finished difference Result 298 states and 304 transitions. [2019-09-07 09:54:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 09:54:12,019 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 195 [2019-09-07 09:54:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:12,020 INFO L225 Difference]: With dead ends: 298 [2019-09-07 09:54:12,020 INFO L226 Difference]: Without dead ends: 202 [2019-09-07 09:54:12,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:54:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-07 09:54:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-07 09:54:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-07 09:54:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2019-09-07 09:54:12,031 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 195 [2019-09-07 09:54:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:12,031 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2019-09-07 09:54:12,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 09:54:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2019-09-07 09:54:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-07 09:54:12,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:12,033 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:12,033 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1441788223, now seen corresponding path program 44 times [2019-09-07 09:54:12,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:12,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:12,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:54:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2732 backedges. 14 proven. 2401 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 09:54:13,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:13,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:54:13,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:13,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:54:13,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:13,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 09:54:13,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2732 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-07 09:54:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 09:54:13,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:54:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:54:13,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:54:13,371 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand 53 states. [2019-09-07 09:54:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:13,555 INFO L93 Difference]: Finished difference Result 300 states and 306 transitions. [2019-09-07 09:54:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 09:54:13,556 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 197 [2019-09-07 09:54:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:13,558 INFO L225 Difference]: With dead ends: 300 [2019-09-07 09:54:13,558 INFO L226 Difference]: Without dead ends: 204 [2019-09-07 09:54:13,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:54:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-07 09:54:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-07 09:54:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-07 09:54:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 206 transitions. [2019-09-07 09:54:13,568 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 206 transitions. Word has length 197 [2019-09-07 09:54:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:13,568 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 206 transitions. [2019-09-07 09:54:13,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:54:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 206 transitions. [2019-09-07 09:54:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 09:54:13,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:13,570 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:13,570 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1236131489, now seen corresponding path program 45 times [2019-09-07 09:54:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:13,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 14 proven. 2500 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 09:54:14,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:14,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:54:14,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 09:54:14,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:14,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 09:54:14,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:15,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 09:54:15,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:54:15,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:54:15,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:54:15,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 09:54:15,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:54:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 14 proven. 230 refuted. 0 times theorem prover too weak. 2587 trivial. 0 not checked. [2019-09-07 09:54:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 23] total 74 [2019-09-07 09:54:15,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 09:54:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 09:54:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=3974, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 09:54:15,690 INFO L87 Difference]: Start difference. First operand 203 states and 206 transitions. Second operand 74 states. [2019-09-07 09:54:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:18,397 INFO L93 Difference]: Finished difference Result 312 states and 319 transitions. [2019-09-07 09:54:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 09:54:18,397 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 199 [2019-09-07 09:54:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:18,399 INFO L225 Difference]: With dead ends: 312 [2019-09-07 09:54:18,399 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 09:54:18,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2929 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4195, Invalid=12061, Unknown=0, NotChecked=0, Total=16256 [2019-09-07 09:54:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 09:54:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2019-09-07 09:54:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-07 09:54:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 216 transitions. [2019-09-07 09:54:18,409 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 216 transitions. Word has length 199 [2019-09-07 09:54:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:18,409 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 216 transitions. [2019-09-07 09:54:18,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 09:54:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 216 transitions. [2019-09-07 09:54:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 09:54:18,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:18,411 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:18,411 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1103746380, now seen corresponding path program 46 times [2019-09-07 09:54:18,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:18,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2992 backedges. 16 proven. 2601 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-09-07 09:54:19,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:19,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:19,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:54:19,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:54:19,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:19,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 09:54:19,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2992 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 09:54:19,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:19,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-07 09:54:19,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 09:54:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 09:54:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:54:19,829 INFO L87 Difference]: Start difference. First operand 213 states and 216 transitions. Second operand 55 states. [2019-09-07 09:54:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:20,037 INFO L93 Difference]: Finished difference Result 320 states and 326 transitions. [2019-09-07 09:54:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 09:54:20,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-07 09:54:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:20,038 INFO L225 Difference]: With dead ends: 320 [2019-09-07 09:54:20,039 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 09:54:20,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:54:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 09:54:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-07 09:54:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-07 09:54:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2019-09-07 09:54:20,047 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 209 [2019-09-07 09:54:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:20,047 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2019-09-07 09:54:20,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 09:54:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2019-09-07 09:54:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 09:54:20,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:20,049 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:20,049 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -489996206, now seen corresponding path program 47 times [2019-09-07 09:54:20,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:20,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:20,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3095 backedges. 16 proven. 2704 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-09-07 09:54:21,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:21,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:21,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:54:37,961 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-09-07 09:54:37,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:37,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 09:54:37,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3095 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 09:54:38,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:38,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 09:54:38,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 09:54:38,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 09:54:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:54:38,051 INFO L87 Difference]: Start difference. First operand 215 states and 218 transitions. Second operand 56 states. [2019-09-07 09:54:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:38,262 INFO L93 Difference]: Finished difference Result 322 states and 328 transitions. [2019-09-07 09:54:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 09:54:38,262 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 211 [2019-09-07 09:54:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:38,263 INFO L225 Difference]: With dead ends: 322 [2019-09-07 09:54:38,263 INFO L226 Difference]: Without dead ends: 218 [2019-09-07 09:54:38,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:54:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-07 09:54:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-07 09:54:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-07 09:54:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 220 transitions. [2019-09-07 09:54:38,271 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 220 transitions. Word has length 211 [2019-09-07 09:54:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:38,272 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 220 transitions. [2019-09-07 09:54:38,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 09:54:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 220 transitions. [2019-09-07 09:54:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 09:54:38,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:38,274 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:38,274 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 913401456, now seen corresponding path program 48 times [2019-09-07 09:54:38,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:38,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 16 proven. 2809 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-09-07 09:54:39,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:39,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:54:39,857 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 09:54:39,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:39,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:54:39,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:40,973 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:54:40,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:54:40,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 09:54:40,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:54:40,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:54:40,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:54:40,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 09:54:41,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:54:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 136 proven. 143 refuted. 0 times theorem prover too weak. 2921 trivial. 0 not checked. [2019-09-07 09:54:41,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:41,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 25] total 79 [2019-09-07 09:54:41,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 09:54:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 09:54:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1668, Invalid=4494, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 09:54:41,188 INFO L87 Difference]: Start difference. First operand 217 states and 220 transitions. Second operand 79 states. [2019-09-07 09:54:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:52,257 INFO L93 Difference]: Finished difference Result 369 states and 386 transitions. [2019-09-07 09:54:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 09:54:52,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 213 [2019-09-07 09:54:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:52,258 INFO L225 Difference]: With dead ends: 369 [2019-09-07 09:54:52,258 INFO L226 Difference]: Without dead ends: 223 [2019-09-07 09:54:52,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5427, Invalid=17525, Unknown=0, NotChecked=0, Total=22952 [2019-09-07 09:54:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-07 09:54:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-09-07 09:54:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-07 09:54:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 225 transitions. [2019-09-07 09:54:52,269 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 225 transitions. Word has length 213 [2019-09-07 09:54:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:52,269 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 225 transitions. [2019-09-07 09:54:52,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 09:54:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 225 transitions. [2019-09-07 09:54:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 09:54:52,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:52,271 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:52,271 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1170355250, now seen corresponding path program 49 times [2019-09-07 09:54:52,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:52,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:52,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 16 proven. 2916 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2019-09-07 09:54:53,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:53,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:53,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:54:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:53,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:54:53,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-09-07 09:54:53,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:53,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 09:54:53,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 09:54:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 09:54:53,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:54:53,949 INFO L87 Difference]: Start difference. First operand 222 states and 225 transitions. Second operand 58 states. [2019-09-07 09:54:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:54,189 INFO L93 Difference]: Finished difference Result 332 states and 338 transitions. [2019-09-07 09:54:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 09:54:54,190 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 218 [2019-09-07 09:54:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:54,191 INFO L225 Difference]: With dead ends: 332 [2019-09-07 09:54:54,191 INFO L226 Difference]: Without dead ends: 225 [2019-09-07 09:54:54,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:54:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-07 09:54:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-09-07 09:54:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-07 09:54:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 227 transitions. [2019-09-07 09:54:54,199 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 227 transitions. Word has length 218 [2019-09-07 09:54:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:54,199 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 227 transitions. [2019-09-07 09:54:54,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 09:54:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 227 transitions. [2019-09-07 09:54:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-07 09:54:54,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:54,201 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:54,201 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1147703380, now seen corresponding path program 50 times [2019-09-07 09:54:54,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:54,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:54:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3446 backedges. 16 proven. 3025 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2019-09-07 09:54:55,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:55,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:55,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:54:55,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:54:55,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:55,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 09:54:55,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3446 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:54:55,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:55,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-07 09:54:55,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 09:54:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 09:54:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:54:55,639 INFO L87 Difference]: Start difference. First operand 224 states and 227 transitions. Second operand 59 states. [2019-09-07 09:54:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:54:55,842 INFO L93 Difference]: Finished difference Result 334 states and 340 transitions. [2019-09-07 09:54:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 09:54:55,849 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 220 [2019-09-07 09:54:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:54:55,850 INFO L225 Difference]: With dead ends: 334 [2019-09-07 09:54:55,850 INFO L226 Difference]: Without dead ends: 227 [2019-09-07 09:54:55,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:54:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-07 09:54:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-09-07 09:54:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-07 09:54:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 229 transitions. [2019-09-07 09:54:55,858 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 229 transitions. Word has length 220 [2019-09-07 09:54:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:54:55,858 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 229 transitions. [2019-09-07 09:54:55,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 09:54:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 229 transitions. [2019-09-07 09:54:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 09:54:55,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:54:55,860 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:54:55,860 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:54:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:54:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash 854092790, now seen corresponding path program 51 times [2019-09-07 09:54:55,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:54:55,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:54:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:55,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:54:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:54:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:54:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 16 proven. 3136 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2019-09-07 09:54:57,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:54:57,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:54:57,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:54:57,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 09:54:57,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:54:57,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:54:57,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:54:58,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:54:58,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:54:58,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:54:58,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:54:58,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:54:58,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:54:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 16 proven. 290 refuted. 0 times theorem prover too weak. 3251 trivial. 0 not checked. [2019-09-07 09:54:58,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:54:58,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 25] total 82 [2019-09-07 09:54:58,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-07 09:54:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-07 09:54:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1766, Invalid=4876, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 09:54:58,315 INFO L87 Difference]: Start difference. First operand 226 states and 229 transitions. Second operand 82 states. [2019-09-07 09:55:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:55:03,304 INFO L93 Difference]: Finished difference Result 346 states and 353 transitions. [2019-09-07 09:55:03,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 09:55:03,305 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 222 [2019-09-07 09:55:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:55:03,307 INFO L225 Difference]: With dead ends: 346 [2019-09-07 09:55:03,307 INFO L226 Difference]: Without dead ends: 239 [2019-09-07 09:55:03,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3616 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5199, Invalid=14823, Unknown=0, NotChecked=0, Total=20022 [2019-09-07 09:55:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-07 09:55:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-09-07 09:55:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-07 09:55:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2019-09-07 09:55:03,316 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 222 [2019-09-07 09:55:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:55:03,317 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2019-09-07 09:55:03,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-07 09:55:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2019-09-07 09:55:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 09:55:03,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:55:03,318 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:55:03,319 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:55:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:55:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1596539471, now seen corresponding path program 52 times [2019-09-07 09:55:03,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:55:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:55:03,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:03,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:55:03,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3738 backedges. 18 proven. 3249 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 09:55:04,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:55:04,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:55:04,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:55:05,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:55:05,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:55:05,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 09:55:05,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:55:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3738 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2019-09-07 09:55:05,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:55:05,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-07 09:55:05,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:55:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:55:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:55:05,116 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand 61 states. [2019-09-07 09:55:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:55:05,373 INFO L93 Difference]: Finished difference Result 354 states and 360 transitions. [2019-09-07 09:55:05,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 09:55:05,373 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 232 [2019-09-07 09:55:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:55:05,374 INFO L225 Difference]: With dead ends: 354 [2019-09-07 09:55:05,374 INFO L226 Difference]: Without dead ends: 239 [2019-09-07 09:55:05,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:55:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-07 09:55:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-09-07 09:55:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-07 09:55:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 241 transitions. [2019-09-07 09:55:05,384 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 241 transitions. Word has length 232 [2019-09-07 09:55:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:55:05,384 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 241 transitions. [2019-09-07 09:55:05,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:55:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 241 transitions. [2019-09-07 09:55:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-07 09:55:05,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:55:05,386 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:55:05,386 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:55:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:55:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1935492367, now seen corresponding path program 53 times [2019-09-07 09:55:05,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:55:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:55:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:05,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:55:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 18 proven. 3364 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 09:55:06,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:55:06,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:55:06,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:55:40,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-09-07 09:55:40,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:55:40,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:55:40,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:55:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2019-09-07 09:55:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:55:40,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-07 09:55:40,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 09:55:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 09:55:40,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:55:40,430 INFO L87 Difference]: Start difference. First operand 238 states and 241 transitions. Second operand 62 states. [2019-09-07 09:55:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:55:40,646 INFO L93 Difference]: Finished difference Result 356 states and 362 transitions. [2019-09-07 09:55:40,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:55:40,647 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 234 [2019-09-07 09:55:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:55:40,648 INFO L225 Difference]: With dead ends: 356 [2019-09-07 09:55:40,648 INFO L226 Difference]: Without dead ends: 241 [2019-09-07 09:55:40,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:55:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-07 09:55:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-09-07 09:55:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 09:55:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 243 transitions. [2019-09-07 09:55:40,656 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 243 transitions. Word has length 234 [2019-09-07 09:55:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:55:40,657 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 243 transitions. [2019-09-07 09:55:40,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 09:55:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 243 transitions. [2019-09-07 09:55:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 09:55:40,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:55:40,658 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:55:40,659 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:55:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:55:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1101042451, now seen corresponding path program 54 times [2019-09-07 09:55:40,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:55:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:55:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:40,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:55:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3970 backedges. 18 proven. 3481 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 09:55:42,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:55:42,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:55:42,161 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:55:43,270 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-07 09:55:43,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:55:43,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 09:55:43,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:55:44,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:55:44,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:55:44,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 09:55:44,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:55:44,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:55:44,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:55:44,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 09:55:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:55:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3970 backedges. 171 proven. 174 refuted. 0 times theorem prover too weak. 3625 trivial. 0 not checked. [2019-09-07 09:55:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:55:44,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 27] total 87 [2019-09-07 09:55:44,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-07 09:55:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-07 09:55:44,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2042, Invalid=5440, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 09:55:44,752 INFO L87 Difference]: Start difference. First operand 240 states and 243 transitions. Second operand 87 states. [2019-09-07 09:55:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:55:54,353 INFO L93 Difference]: Finished difference Result 407 states and 425 transitions. [2019-09-07 09:55:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-07 09:55:54,354 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 236 [2019-09-07 09:55:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:55:54,355 INFO L225 Difference]: With dead ends: 407 [2019-09-07 09:55:54,355 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 09:55:54,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5705 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6663, Invalid=21393, Unknown=0, NotChecked=0, Total=28056 [2019-09-07 09:55:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 09:55:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-09-07 09:55:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-07 09:55:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2019-09-07 09:55:54,366 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 236 [2019-09-07 09:55:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:55:54,366 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2019-09-07 09:55:54,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-07 09:55:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2019-09-07 09:55:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-07 09:55:54,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:55:54,368 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:55:54,368 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:55:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:55:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1228953337, now seen corresponding path program 55 times [2019-09-07 09:55:54,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:55:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:55:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:54,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:55:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4122 backedges. 18 proven. 3600 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-09-07 09:55:55,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:55:55,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:55:55,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:55:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:55,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 09:55:55,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:55:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4122 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-09-07 09:55:56,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:55:56,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-07 09:55:56,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 09:55:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 09:55:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 09:55:56,018 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand 64 states. [2019-09-07 09:55:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:55:56,273 INFO L93 Difference]: Finished difference Result 366 states and 372 transitions. [2019-09-07 09:55:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 09:55:56,273 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 241 [2019-09-07 09:55:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:55:56,274 INFO L225 Difference]: With dead ends: 366 [2019-09-07 09:55:56,274 INFO L226 Difference]: Without dead ends: 248 [2019-09-07 09:55:56,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 09:55:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-07 09:55:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-07 09:55:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-07 09:55:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 250 transitions. [2019-09-07 09:55:56,283 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 250 transitions. Word has length 241 [2019-09-07 09:55:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:55:56,283 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 250 transitions. [2019-09-07 09:55:56,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 09:55:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 250 transitions. [2019-09-07 09:55:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-07 09:55:56,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:55:56,285 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:55:56,285 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:55:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:55:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 929526935, now seen corresponding path program 56 times [2019-09-07 09:55:56,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:55:56,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:55:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:55:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4243 backedges. 18 proven. 3721 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-09-07 09:55:57,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:55:57,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:55:57,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:55:57,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:55:57,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:55:57,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-07 09:55:57,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:55:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4243 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-09-07 09:55:57,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:55:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-07 09:55:57,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 09:55:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 09:55:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:55:57,991 INFO L87 Difference]: Start difference. First operand 247 states and 250 transitions. Second operand 65 states. [2019-09-07 09:55:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:55:58,279 INFO L93 Difference]: Finished difference Result 368 states and 374 transitions. [2019-09-07 09:55:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 09:55:58,280 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 243 [2019-09-07 09:55:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:55:58,281 INFO L225 Difference]: With dead ends: 368 [2019-09-07 09:55:58,281 INFO L226 Difference]: Without dead ends: 250 [2019-09-07 09:55:58,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:55:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-07 09:55:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-07 09:55:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-07 09:55:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2019-09-07 09:55:58,288 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 243 [2019-09-07 09:55:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:55:58,288 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2019-09-07 09:55:58,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 09:55:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2019-09-07 09:55:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 09:55:58,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:55:58,290 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:55:58,290 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:55:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:55:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 943563445, now seen corresponding path program 57 times [2019-09-07 09:55:58,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:55:58,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:55:58,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:58,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:55:58,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:55:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:55:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 18 proven. 3844 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-09-07 09:55:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:55:59,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:55:59,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:55:59,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 09:55:59,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:56:00,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:56:00,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:56:01,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:56:01,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:56:01,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:56:01,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:56:01,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:56:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:56:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 18 proven. 357 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2019-09-07 09:56:01,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:56:01,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 27] total 90 [2019-09-07 09:56:01,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-07 09:56:01,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-07 09:56:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2140, Invalid=5870, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 09:56:01,278 INFO L87 Difference]: Start difference. First operand 249 states and 252 transitions. Second operand 90 states. [2019-09-07 09:56:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:56:06,381 INFO L93 Difference]: Finished difference Result 380 states and 387 transitions. [2019-09-07 09:56:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-07 09:56:06,381 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 245 [2019-09-07 09:56:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:56:06,383 INFO L225 Difference]: With dead ends: 380 [2019-09-07 09:56:06,383 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 09:56:06,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4375 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6311, Invalid=17869, Unknown=0, NotChecked=0, Total=24180 [2019-09-07 09:56:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 09:56:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2019-09-07 09:56:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-07 09:56:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 262 transitions. [2019-09-07 09:56:06,394 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 262 transitions. Word has length 245 [2019-09-07 09:56:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:56:06,394 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 262 transitions. [2019-09-07 09:56:06,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-07 09:56:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 262 transitions. [2019-09-07 09:56:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 09:56:06,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:56:06,397 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:56:06,397 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:56:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:56:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1289073034, now seen corresponding path program 58 times [2019-09-07 09:56:06,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:56:06,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:56:06,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:06,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:56:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:56:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 20 proven. 3969 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-07 09:56:08,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:56:08,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:56:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:56:08,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:56:08,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:56:08,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 09:56:08,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:56:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-09-07 09:56:08,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:56:08,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-09-07 09:56:08,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 09:56:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 09:56:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:56:08,291 INFO L87 Difference]: Start difference. First operand 259 states and 262 transitions. Second operand 67 states. [2019-09-07 09:56:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:56:08,577 INFO L93 Difference]: Finished difference Result 388 states and 394 transitions. [2019-09-07 09:56:08,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 09:56:08,578 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 255 [2019-09-07 09:56:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:56:08,579 INFO L225 Difference]: With dead ends: 388 [2019-09-07 09:56:08,579 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 09:56:08,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:56:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 09:56:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-09-07 09:56:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-07 09:56:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 264 transitions. [2019-09-07 09:56:08,587 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 264 transitions. Word has length 255 [2019-09-07 09:56:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:56:08,587 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 264 transitions. [2019-09-07 09:56:08,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 09:56:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 264 transitions. [2019-09-07 09:56:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-07 09:56:08,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:56:08,589 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:56:08,589 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:56:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:56:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash 993108648, now seen corresponding path program 59 times [2019-09-07 09:56:08,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:56:08,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:56:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:08,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:56:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:56:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4694 backedges. 20 proven. 4096 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-07 09:56:10,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:56:10,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:56:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:56:41,338 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-09-07 09:56:41,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:56:41,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-07 09:56:41,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:56:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4694 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-09-07 09:56:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:56:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-09-07 09:56:41,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-07 09:56:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-07 09:56:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 09:56:41,440 INFO L87 Difference]: Start difference. First operand 261 states and 264 transitions. Second operand 68 states. [2019-09-07 09:56:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:56:41,719 INFO L93 Difference]: Finished difference Result 390 states and 396 transitions. [2019-09-07 09:56:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 09:56:41,720 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 257 [2019-09-07 09:56:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:56:41,721 INFO L225 Difference]: With dead ends: 390 [2019-09-07 09:56:41,721 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 09:56:41,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 09:56:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 09:56:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-09-07 09:56:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 09:56:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2019-09-07 09:56:41,730 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 257 [2019-09-07 09:56:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:56:41,730 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2019-09-07 09:56:41,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-07 09:56:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2019-09-07 09:56:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-07 09:56:41,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:56:41,732 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:56:41,732 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:56:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:56:41,732 INFO L82 PathProgramCache]: Analyzing trace with hash 39175238, now seen corresponding path program 60 times [2019-09-07 09:56:41,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:56:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:56:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:41,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:56:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:56:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4823 backedges. 20 proven. 4225 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-07 09:56:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:56:43,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:56:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:56:45,638 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-07 09:56:45,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:56:45,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:56:45,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:56:46,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:56:46,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 09:56:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:56:46,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 09:56:46,778 INFO L567 ElimStorePlain]: treesize reduction 13, result has 51.9 percent of original size [2019-09-07 09:56:46,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:56:46,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:4 [2019-09-07 09:56:46,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:56:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4823 backedges. 210 proven. 208 refuted. 0 times theorem prover too weak. 4405 trivial. 0 not checked. [2019-09-07 09:56:47,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:56:47,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 29] total 95 [2019-09-07 09:56:47,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-07 09:56:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-07 09:56:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2454, Invalid=6476, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 09:56:47,021 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand 95 states. [2019-09-07 09:56:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:56:58,671 INFO L93 Difference]: Finished difference Result 445 states and 464 transitions. [2019-09-07 09:56:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-07 09:56:58,671 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 259 [2019-09-07 09:56:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:56:58,672 INFO L225 Difference]: With dead ends: 445 [2019-09-07 09:56:58,672 INFO L226 Difference]: Without dead ends: 269 [2019-09-07 09:56:58,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6864 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8026, Invalid=25646, Unknown=0, NotChecked=0, Total=33672 [2019-09-07 09:56:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-07 09:56:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-09-07 09:56:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-07 09:56:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-09-07 09:56:58,680 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2019-09-07 09:56:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:56:58,681 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-09-07 09:56:58,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-07 09:56:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-09-07 09:56:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-07 09:56:58,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:56:58,682 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:56:58,682 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:56:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:56:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1032130744, now seen corresponding path program 61 times [2019-09-07 09:56:58,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:56:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:56:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:58,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:56:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:56:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:57:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4990 backedges. 20 proven. 4356 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2019-09-07 09:57:00,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:57:00,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:57:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:57:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:57:00,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 09:57:00,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:57:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4990 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-09-07 09:57:00,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:57:00,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-09-07 09:57:00,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 09:57:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 09:57:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 09:57:00,575 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 70 states. [2019-09-07 09:57:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:57:00,815 INFO L93 Difference]: Finished difference Result 400 states and 406 transitions. [2019-09-07 09:57:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 09:57:00,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 264 [2019-09-07 09:57:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:57:00,816 INFO L225 Difference]: With dead ends: 400 [2019-09-07 09:57:00,816 INFO L226 Difference]: Without dead ends: 271 [2019-09-07 09:57:00,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 09:57:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-07 09:57:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2019-09-07 09:57:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-07 09:57:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-09-07 09:57:00,825 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 264 [2019-09-07 09:57:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:57:00,825 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-09-07 09:57:00,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 09:57:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-09-07 09:57:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-07 09:57:00,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:57:00,827 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:57:00,827 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:57:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:57:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash 161710426, now seen corresponding path program 62 times [2019-09-07 09:57:00,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:57:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:57:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:00,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:57:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:57:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 20 proven. 4489 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2019-09-07 09:57:02,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:57:02,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:57:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:57:02,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:57:02,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:57:02,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-07 09:57:02,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:57:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-09-07 09:57:02,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:57:02,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-09-07 09:57:02,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 09:57:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 09:57:02,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 09:57:02,982 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 71 states. [2019-09-07 09:57:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:57:03,219 INFO L93 Difference]: Finished difference Result 402 states and 408 transitions. [2019-09-07 09:57:03,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 09:57:03,220 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 266 [2019-09-07 09:57:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:57:03,221 INFO L225 Difference]: With dead ends: 402 [2019-09-07 09:57:03,221 INFO L226 Difference]: Without dead ends: 273 [2019-09-07 09:57:03,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 09:57:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-07 09:57:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2019-09-07 09:57:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-07 09:57:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2019-09-07 09:57:03,231 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 266 [2019-09-07 09:57:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:57:03,231 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2019-09-07 09:57:03,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 09:57:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2019-09-07 09:57:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-07 09:57:03,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:57:03,233 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:57:03,233 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:57:03,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:57:03,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1206407548, now seen corresponding path program 63 times [2019-09-07 09:57:03,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:57:03,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:57:03,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:03,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:57:03,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:57:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5258 backedges. 20 proven. 4624 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2019-09-07 09:57:05,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:57:05,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:57:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:57:05,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-07 09:57:05,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:57:05,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:57:05,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:57:06,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 09:57:06,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:57:06,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:57:06,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:57:06,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 09:57:06,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:57:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5258 backedges. 20 proven. 431 refuted. 0 times theorem prover too weak. 4807 trivial. 0 not checked. [2019-09-07 09:57:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:57:06,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 29] total 98 [2019-09-07 09:57:06,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-07 09:57:06,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-07 09:57:06,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2550, Invalid=6956, Unknown=0, NotChecked=0, Total=9506 [2019-09-07 09:57:06,654 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 98 states. [2019-09-07 09:57:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:57:11,344 INFO L93 Difference]: Finished difference Result 414 states and 421 transitions. [2019-09-07 09:57:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-07 09:57:11,345 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 268 [2019-09-07 09:57:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:57:11,346 INFO L225 Difference]: With dead ends: 414 [2019-09-07 09:57:11,347 INFO L226 Difference]: Without dead ends: 285 [2019-09-07 09:57:11,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5206 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7531, Invalid=21199, Unknown=0, NotChecked=0, Total=28730 [2019-09-07 09:57:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-07 09:57:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-09-07 09:57:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-07 09:57:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-07 09:57:11,374 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 268 [2019-09-07 09:57:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:57:11,374 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-07 09:57:11,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-07 09:57:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-07 09:57:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-07 09:57:11,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:57:11,376 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:57:11,376 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:57:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:57:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1346136491, now seen corresponding path program 64 times [2019-09-07 09:57:11,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:57:11,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:57:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:11,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:57:11,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:57:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5479 backedges. 22 proven. 4761 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-09-07 09:57:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:57:13,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:57:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:57:13,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:57:13,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:57:13,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 09:57:13,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:57:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5479 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2019-09-07 09:57:13,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:57:13,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 73 [2019-09-07 09:57:13,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 09:57:13,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 09:57:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:57:13,453 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 73 states. [2019-09-07 09:57:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:57:13,762 INFO L93 Difference]: Finished difference Result 422 states and 428 transitions. [2019-09-07 09:57:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 09:57:13,763 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 278 [2019-09-07 09:57:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:57:13,764 INFO L225 Difference]: With dead ends: 422 [2019-09-07 09:57:13,764 INFO L226 Difference]: Without dead ends: 285 [2019-09-07 09:57:13,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:57:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-07 09:57:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2019-09-07 09:57:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-07 09:57:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2019-09-07 09:57:13,774 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 278 [2019-09-07 09:57:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:57:13,774 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2019-09-07 09:57:13,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 09:57:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2019-09-07 09:57:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-07 09:57:13,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:57:13,776 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:57:13,776 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:57:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:57:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash -893959305, now seen corresponding path program 65 times [2019-09-07 09:57:13,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:57:13,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:57:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:13,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:57:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:57:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:57:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 22 proven. 4900 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-09-07 09:57:15,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:57:15,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:57:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:58:08,166 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-09-07 09:58:08,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:58:08,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 09:58:08,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:58:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2019-09-07 09:58:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:58:08,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-09-07 09:58:08,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 09:58:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 09:58:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 09:58:08,266 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand 74 states. [2019-09-07 09:58:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:58:08,534 INFO L93 Difference]: Finished difference Result 424 states and 430 transitions. [2019-09-07 09:58:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 09:58:08,534 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 280 [2019-09-07 09:58:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:58:08,535 INFO L225 Difference]: With dead ends: 424 [2019-09-07 09:58:08,535 INFO L226 Difference]: Without dead ends: 287 [2019-09-07 09:58:08,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 09:58:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-07 09:58:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-09-07 09:58:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-07 09:58:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-07 09:58:08,543 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 280 [2019-09-07 09:58:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:58:08,544 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-07 09:58:08,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 09:58:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-07 09:58:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-07 09:58:08,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:58:08,546 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:58:08,546 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:58:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:58:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash -143380455, now seen corresponding path program 66 times [2019-09-07 09:58:08,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:58:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:58:08,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:08,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:58:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5759 backedges. 22 proven. 5041 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-09-07 09:58:10,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:58:10,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:58:10,523 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:58:15,364 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 09:58:15,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:58:15,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 09:58:15,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:58:16,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:58:16,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:58:16,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 09:58:16,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:58:16,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:58:16,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:58:16,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 09:58:17,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:58:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5759 backedges. 253 proven. 245 refuted. 0 times theorem prover too weak. 5261 trivial. 0 not checked. [2019-09-07 09:58:17,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:58:17,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 31] total 103 [2019-09-07 09:58:17,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-07 09:58:17,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-07 09:58:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2904, Invalid=7602, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 09:58:17,303 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 103 states. [2019-09-07 09:58:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:58:30,851 INFO L93 Difference]: Finished difference Result 483 states and 503 transitions. [2019-09-07 09:58:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-07 09:58:30,851 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 282 [2019-09-07 09:58:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:58:30,852 INFO L225 Difference]: With dead ends: 483 [2019-09-07 09:58:30,853 INFO L226 Difference]: Without dead ends: 292 [2019-09-07 09:58:30,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8130 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=9516, Invalid=30284, Unknown=0, NotChecked=0, Total=39800 [2019-09-07 09:58:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-07 09:58:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-09-07 09:58:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-07 09:58:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2019-09-07 09:58:30,863 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 282 [2019-09-07 09:58:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:58:30,864 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2019-09-07 09:58:30,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-07 09:58:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2019-09-07 09:58:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-07 09:58:30,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:58:30,865 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:58:30,865 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:58:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:58:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash -780496561, now seen corresponding path program 67 times [2019-09-07 09:58:30,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:58:30,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:58:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:30,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:58:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5941 backedges. 22 proven. 5184 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-07 09:58:32,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:58:32,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:58:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:58:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:33,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-07 09:58:33,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:58:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5941 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 09:58:33,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:58:33,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 76 [2019-09-07 09:58:33,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-07 09:58:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-07 09:58:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 09:58:33,082 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 76 states. [2019-09-07 09:58:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:58:33,352 INFO L93 Difference]: Finished difference Result 434 states and 440 transitions. [2019-09-07 09:58:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 09:58:33,352 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 287 [2019-09-07 09:58:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:58:33,354 INFO L225 Difference]: With dead ends: 434 [2019-09-07 09:58:33,354 INFO L226 Difference]: Without dead ends: 294 [2019-09-07 09:58:33,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 09:58:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-07 09:58:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-09-07 09:58:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-07 09:58:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-09-07 09:58:33,361 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 287 [2019-09-07 09:58:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:58:33,361 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-09-07 09:58:33,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-07 09:58:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-09-07 09:58:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-07 09:58:33,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:58:33,362 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:58:33,363 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:58:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:58:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1796901485, now seen corresponding path program 68 times [2019-09-07 09:58:33,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:58:33,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:58:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:33,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:58:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6086 backedges. 22 proven. 5329 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-07 09:58:35,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:58:35,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:58:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:58:35,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:58:35,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:58:35,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-07 09:58:35,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:58:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6086 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 09:58:35,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:58:35,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 77 [2019-09-07 09:58:35,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-07 09:58:35,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-07 09:58:35,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:58:35,909 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 77 states. [2019-09-07 09:58:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:58:36,163 INFO L93 Difference]: Finished difference Result 436 states and 442 transitions. [2019-09-07 09:58:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 09:58:36,163 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 289 [2019-09-07 09:58:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:58:36,164 INFO L225 Difference]: With dead ends: 436 [2019-09-07 09:58:36,164 INFO L226 Difference]: Without dead ends: 296 [2019-09-07 09:58:36,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:58:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-07 09:58:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-09-07 09:58:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-07 09:58:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2019-09-07 09:58:36,171 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 289 [2019-09-07 09:58:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:58:36,172 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2019-09-07 09:58:36,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-07 09:58:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2019-09-07 09:58:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-07 09:58:36,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:58:36,174 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:58:36,174 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:58:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:58:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash 480293899, now seen corresponding path program 69 times [2019-09-07 09:58:36,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:58:36,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:58:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:36,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:58:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6233 backedges. 22 proven. 5476 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-07 09:58:38,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:58:38,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:58:38,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:58:38,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 09:58:38,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:58:38,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:58:38,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:58:39,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 09:58:39,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:58:39,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:58:39,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:58:39,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 09:58:39,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:58:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6233 backedges. 22 proven. 512 refuted. 0 times theorem prover too weak. 5699 trivial. 0 not checked. [2019-09-07 09:58:39,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:58:39,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 31] total 106 [2019-09-07 09:58:39,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-07 09:58:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-07 09:58:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2996, Invalid=8134, Unknown=0, NotChecked=0, Total=11130 [2019-09-07 09:58:39,930 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 106 states. [2019-09-07 09:58:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:58:46,420 INFO L93 Difference]: Finished difference Result 448 states and 455 transitions. [2019-09-07 09:58:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-07 09:58:46,420 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 291 [2019-09-07 09:58:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:58:46,423 INFO L225 Difference]: With dead ends: 448 [2019-09-07 09:58:46,423 INFO L226 Difference]: Without dead ends: 308 [2019-09-07 09:58:46,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6109 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8859, Invalid=24813, Unknown=0, NotChecked=0, Total=33672 [2019-09-07 09:58:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-07 09:58:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2019-09-07 09:58:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-07 09:58:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 308 transitions. [2019-09-07 09:58:46,431 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 308 transitions. Word has length 291 [2019-09-07 09:58:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:58:46,432 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 308 transitions. [2019-09-07 09:58:46,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-07 09:58:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 308 transitions. [2019-09-07 09:58:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-07 09:58:46,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:58:46,433 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:58:46,433 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:58:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:58:46,433 INFO L82 PathProgramCache]: Analyzing trace with hash 136357984, now seen corresponding path program 70 times [2019-09-07 09:58:46,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:58:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:58:46,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:46,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:58:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6474 backedges. 24 proven. 5625 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-07 09:58:48,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:58:48,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:58:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:58:48,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:58:48,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:58:48,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-07 09:58:48,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:58:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6474 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-09-07 09:58:48,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:58:48,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 79 [2019-09-07 09:58:48,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 09:58:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 09:58:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 09:58:48,812 INFO L87 Difference]: Start difference. First operand 305 states and 308 transitions. Second operand 79 states. [2019-09-07 09:58:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:58:49,090 INFO L93 Difference]: Finished difference Result 456 states and 462 transitions. [2019-09-07 09:58:49,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-07 09:58:49,090 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 301 [2019-09-07 09:58:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:58:49,091 INFO L225 Difference]: With dead ends: 456 [2019-09-07 09:58:49,091 INFO L226 Difference]: Without dead ends: 308 [2019-09-07 09:58:49,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 09:58:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-07 09:58:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-09-07 09:58:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-07 09:58:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 310 transitions. [2019-09-07 09:58:49,099 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 310 transitions. Word has length 301 [2019-09-07 09:58:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:58:49,099 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 310 transitions. [2019-09-07 09:58:49,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 09:58:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 310 transitions. [2019-09-07 09:58:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 09:58:49,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:58:49,101 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:58:49,101 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:58:49,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:58:49,101 INFO L82 PathProgramCache]: Analyzing trace with hash -779135746, now seen corresponding path program 71 times [2019-09-07 09:58:49,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:58:49,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:58:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:49,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:58:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:58:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:58:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6625 backedges. 24 proven. 5776 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-07 09:58:51,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:58:51,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:58:51,318 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:00:41,613 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2019-09-07 10:00:41,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-07 10:00:41,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6625 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-09-07 10:00:41,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:41,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 80 [2019-09-07 10:00:41,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-07 10:00:41,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-07 10:00:41,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:00:41,741 INFO L87 Difference]: Start difference. First operand 307 states and 310 transitions. Second operand 80 states. [2019-09-07 10:00:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:42,052 INFO L93 Difference]: Finished difference Result 458 states and 464 transitions. [2019-09-07 10:00:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 10:00:42,053 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 303 [2019-09-07 10:00:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:42,054 INFO L225 Difference]: With dead ends: 458 [2019-09-07 10:00:42,054 INFO L226 Difference]: Without dead ends: 310 [2019-09-07 10:00:42,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:00:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-07 10:00:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-09-07 10:00:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-07 10:00:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2019-09-07 10:00:42,062 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 303 [2019-09-07 10:00:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:42,063 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2019-09-07 10:00:42,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-07 10:00:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2019-09-07 10:00:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-07 10:00:42,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:42,064 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:42,064 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash -100314596, now seen corresponding path program 72 times [2019-09-07 10:00:42,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:42,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:42,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 24 proven. 5929 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-07 10:00:44,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:44,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:44,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:00:46,915 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-07 10:00:46,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:46,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-07 10:00:46,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:48,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 10:00:48,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:00:48,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:00:48,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:00:48,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 10:00:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:00:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 24 proven. 561 refuted. 0 times theorem prover too weak. 6193 trivial. 0 not checked. [2019-09-07 10:00:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:48,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 33] total 111 [2019-09-07 10:00:48,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-07 10:00:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-07 10:00:48,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3236, Invalid=8974, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 10:00:48,648 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 111 states. [2019-09-07 10:00:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:55,453 INFO L93 Difference]: Finished difference Result 525 states and 547 transitions. [2019-09-07 10:00:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-07 10:00:55,453 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 305 [2019-09-07 10:00:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:55,455 INFO L225 Difference]: With dead ends: 525 [2019-09-07 10:00:55,455 INFO L226 Difference]: Without dead ends: 377 [2019-09-07 10:00:55,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6710 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9563, Invalid=26727, Unknown=0, NotChecked=0, Total=36290 [2019-09-07 10:00:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-07 10:00:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 370. [2019-09-07 10:00:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-07 10:00:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 387 transitions. [2019-09-07 10:00:55,467 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 387 transitions. Word has length 305 [2019-09-07 10:00:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:55,467 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 387 transitions. [2019-09-07 10:00:55,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-07 10:00:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 387 transitions. [2019-09-07 10:00:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-07 10:00:55,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:55,469 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 15, 15, 14, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:55,469 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -651156162, now seen corresponding path program 73 times [2019-09-07 10:00:55,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:55,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 24 proven. 6084 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-09-07 10:00:57,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:57,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:57,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-07 10:00:57,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2019-09-07 10:00:57,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:57,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 82 [2019-09-07 10:00:57,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-07 10:00:57,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-07 10:00:57,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 10:00:57,965 INFO L87 Difference]: Start difference. First operand 370 states and 387 transitions. Second operand 82 states. [2019-09-07 10:00:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:58,329 INFO L93 Difference]: Finished difference Result 580 states and 614 transitions. [2019-09-07 10:00:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-07 10:00:58,330 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 310 [2019-09-07 10:00:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:58,331 INFO L225 Difference]: With dead ends: 580 [2019-09-07 10:00:58,331 INFO L226 Difference]: Without dead ends: 373 [2019-09-07 10:00:58,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 10:00:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-07 10:00:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2019-09-07 10:00:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-07 10:00:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 389 transitions. [2019-09-07 10:00:58,343 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 389 transitions. Word has length 310 [2019-09-07 10:00:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:58,343 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 389 transitions. [2019-09-07 10:00:58,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-07 10:00:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 389 transitions. [2019-09-07 10:00:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 10:00:58,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:58,346 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 15, 15, 14, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:58,346 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash -388576672, now seen corresponding path program 74 times [2019-09-07 10:00:58,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:58,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7132 backedges. 24 proven. 6241 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-09-07 10:01:00,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:00,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:00,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:01:00,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:01:00,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:01:00,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-07 10:01:00,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7132 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2019-09-07 10:01:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:00,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 83 [2019-09-07 10:01:00,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-07 10:01:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-07 10:01:00,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:01:00,905 INFO L87 Difference]: Start difference. First operand 372 states and 389 transitions. Second operand 83 states. [2019-09-07 10:01:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:01,266 INFO L93 Difference]: Finished difference Result 582 states and 616 transitions. [2019-09-07 10:01:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 10:01:01,266 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 312 [2019-09-07 10:01:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:01,268 INFO L225 Difference]: With dead ends: 582 [2019-09-07 10:01:01,268 INFO L226 Difference]: Without dead ends: 375 [2019-09-07 10:01:01,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:01:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-07 10:01:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 374. [2019-09-07 10:01:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-07 10:01:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 391 transitions. [2019-09-07 10:01:01,280 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 391 transitions. Word has length 312 [2019-09-07 10:01:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:01,280 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 391 transitions. [2019-09-07 10:01:01,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-07 10:01:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 391 transitions. [2019-09-07 10:01:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-07 10:01:01,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:01,282 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 15, 15, 14, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:01,282 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:01,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1452757246, now seen corresponding path program 75 times [2019-09-07 10:01:01,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:01,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:01,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:01:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 24 proven. 6400 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-09-07 10:01:03,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:03,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:03,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:01:03,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:01:03,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:01:03,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 10:01:03,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:05,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 10:01:05,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:01:05,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:01:05,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:01:05,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 10:01:05,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:01:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 24 proven. 600 refuted. 0 times theorem prover too weak. 6667 trivial. 0 not checked. [2019-09-07 10:01:05,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:05,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33] total 114 [2019-09-07 10:01:05,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-07 10:01:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-07 10:01:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3478, Invalid=9404, Unknown=0, NotChecked=0, Total=12882 [2019-09-07 10:01:05,806 INFO L87 Difference]: Start difference. First operand 374 states and 391 transitions. Second operand 114 states. [2019-09-07 10:01:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:13,473 INFO L93 Difference]: Finished difference Result 594 states and 629 transitions. [2019-09-07 10:01:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-07 10:01:13,473 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 314 [2019-09-07 10:01:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:13,475 INFO L225 Difference]: With dead ends: 594 [2019-09-07 10:01:13,475 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 10:01:13,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7084 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10295, Invalid=28711, Unknown=0, NotChecked=0, Total=39006 [2019-09-07 10:01:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 10:01:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 325. [2019-09-07 10:01:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-07 10:01:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 328 transitions. [2019-09-07 10:01:13,486 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 328 transitions. Word has length 314 [2019-09-07 10:01:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:13,486 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 328 transitions. [2019-09-07 10:01:13,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-07 10:01:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 328 transitions. [2019-09-07 10:01:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-07 10:01:13,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:13,487 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:13,487 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1134622005, now seen corresponding path program 76 times [2019-09-07 10:01:13,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:13,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:13,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:13,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:01:13,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7510 backedges. 26 proven. 6561 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-09-07 10:01:15,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:15,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:15,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:01:16,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:01:16,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:01:16,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-07 10:01:16,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7510 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (82)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:01:16,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:16,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 85 [2019-09-07 10:01:16,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-07 10:01:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-07 10:01:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 10:01:16,246 INFO L87 Difference]: Start difference. First operand 325 states and 328 transitions. Second operand 85 states. [2019-09-07 10:01:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:16,635 INFO L93 Difference]: Finished difference Result 484 states and 490 transitions. [2019-09-07 10:01:16,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 10:01:16,635 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 321 [2019-09-07 10:01:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:16,641 INFO L225 Difference]: With dead ends: 484 [2019-09-07 10:01:16,641 INFO L226 Difference]: Without dead ends: 328 [2019-09-07 10:01:16,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 10:01:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-07 10:01:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-09-07 10:01:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-07 10:01:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 330 transitions. [2019-09-07 10:01:16,655 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 330 transitions. Word has length 321 [2019-09-07 10:01:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:16,655 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 330 transitions. [2019-09-07 10:01:16,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-07 10:01:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 330 transitions. [2019-09-07 10:01:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-07 10:01:16,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:16,657 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:16,658 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 237452393, now seen corresponding path program 77 times [2019-09-07 10:01:16,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:16,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:16,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:01:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 26 proven. 6724 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-09-07 10:01:19,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:19,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:19,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:04:17,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2019-09-07 10:04:17,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:17,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-07 10:04:17,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2019-09-07 10:04:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:17,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 86 [2019-09-07 10:04:17,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-07 10:04:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-07 10:04:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 10:04:17,723 INFO L87 Difference]: Start difference. First operand 327 states and 330 transitions. Second operand 86 states. [2019-09-07 10:04:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:18,026 INFO L93 Difference]: Finished difference Result 486 states and 492 transitions. [2019-09-07 10:04:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 10:04:18,026 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 323 [2019-09-07 10:04:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:18,028 INFO L225 Difference]: With dead ends: 486 [2019-09-07 10:04:18,028 INFO L226 Difference]: Without dead ends: 330 [2019-09-07 10:04:18,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 10:04:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-07 10:04:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-09-07 10:04:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-07 10:04:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 332 transitions. [2019-09-07 10:04:18,037 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 332 transitions. Word has length 323 [2019-09-07 10:04:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:18,037 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 332 transitions. [2019-09-07 10:04:18,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-07 10:04:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 332 transitions. [2019-09-07 10:04:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-07 10:04:18,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:18,039 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:18,039 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash 245988999, now seen corresponding path program 78 times [2019-09-07 10:04:18,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:18,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:18,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:04:18,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7838 backedges. 26 proven. 6889 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-09-07 10:04:20,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:20,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:20,703 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:04:22,329 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-07 10:04:22,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:22,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:04:22,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7838 backedges. 364 proven. 273 refuted. 0 times theorem prover too weak. 7201 trivial. 0 not checked. [2019-09-07 10:04:23,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:23,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 30] total 114 [2019-09-07 10:04:23,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-07 10:04:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-07 10:04:23,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3907, Invalid=8975, Unknown=0, NotChecked=0, Total=12882 [2019-09-07 10:04:23,658 INFO L87 Difference]: Start difference. First operand 329 states and 332 transitions. Second operand 114 states. [2019-09-07 10:04:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:28,353 INFO L93 Difference]: Finished difference Result 546 states and 567 transitions. [2019-09-07 10:04:28,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-07 10:04:28,354 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 325 [2019-09-07 10:04:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:28,355 INFO L225 Difference]: With dead ends: 546 [2019-09-07 10:04:28,355 INFO L226 Difference]: Without dead ends: 335 [2019-09-07 10:04:28,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7084 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=12307, Invalid=26699, Unknown=0, NotChecked=0, Total=39006 [2019-09-07 10:04:28,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-07 10:04:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 334. [2019-09-07 10:04:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-07 10:04:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 337 transitions. [2019-09-07 10:04:28,367 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 337 transitions. Word has length 325 [2019-09-07 10:04:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:28,367 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 337 transitions. [2019-09-07 10:04:28,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-07 10:04:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 337 transitions. [2019-09-07 10:04:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-07 10:04:28,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:28,370 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 15, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:28,370 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash 966854081, now seen corresponding path program 79 times [2019-09-07 10:04:28,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:28,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:28,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:28,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:04:28,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8047 backedges. 26 proven. 7056 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-09-07 10:04:31,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:31,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:31,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:04:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:31,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-07 10:04:31,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8047 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2019-09-07 10:04:31,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:31,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 88 [2019-09-07 10:04:31,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-07 10:04:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-07 10:04:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 10:04:31,265 INFO L87 Difference]: Start difference. First operand 334 states and 337 transitions. Second operand 88 states. [2019-09-07 10:04:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:31,677 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-09-07 10:04:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 10:04:31,677 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 330 [2019-09-07 10:04:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:31,678 INFO L225 Difference]: With dead ends: 496 [2019-09-07 10:04:31,679 INFO L226 Difference]: Without dead ends: 337 [2019-09-07 10:04:31,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 10:04:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-07 10:04:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2019-09-07 10:04:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 10:04:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 339 transitions. [2019-09-07 10:04:31,688 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 339 transitions. Word has length 330 [2019-09-07 10:04:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:31,689 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 339 transitions. [2019-09-07 10:04:31,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-07 10:04:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 339 transitions. [2019-09-07 10:04:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-07 10:04:31,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:31,690 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 15, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:31,690 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1020511715, now seen corresponding path program 80 times [2019-09-07 10:04:31,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:31,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:04:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8216 backedges. 26 proven. 7225 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-09-07 10:04:34,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:34,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:34,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:04:34,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:04:34,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:34,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-07 10:04:34,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8216 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2019-09-07 10:04:34,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:34,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 89 [2019-09-07 10:04:34,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-07 10:04:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-07 10:04:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:04:34,576 INFO L87 Difference]: Start difference. First operand 336 states and 339 transitions. Second operand 89 states. [2019-09-07 10:04:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:34,928 INFO L93 Difference]: Finished difference Result 498 states and 504 transitions. [2019-09-07 10:04:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-07 10:04:34,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 332 [2019-09-07 10:04:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:34,930 INFO L225 Difference]: With dead ends: 498 [2019-09-07 10:04:34,930 INFO L226 Difference]: Without dead ends: 339 [2019-09-07 10:04:34,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:04:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-07 10:04:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2019-09-07 10:04:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-07 10:04:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 341 transitions. [2019-09-07 10:04:34,938 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 341 transitions. Word has length 332 [2019-09-07 10:04:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:34,938 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 341 transitions. [2019-09-07 10:04:34,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-07 10:04:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 341 transitions. [2019-09-07 10:04:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-07 10:04:34,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:34,940 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 15, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:34,940 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1045890437, now seen corresponding path program 81 times [2019-09-07 10:04:34,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:34,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:04:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8387 backedges. 26 proven. 7396 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-09-07 10:04:37,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:37,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:04:37,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:04:37,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:37,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:04:37,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:39,964 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:04:39,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:04:39,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2019-09-07 10:04:39,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:04:39,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:04:39,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:04:39,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:4 [2019-09-07 10:04:40,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:04:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8387 backedges. 302 proven. 377 refuted. 0 times theorem prover too weak. 7708 trivial. 0 not checked. [2019-09-07 10:04:40,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:40,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 35] total 122 [2019-09-07 10:04:40,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-07 10:04:40,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-07 10:04:40,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4166, Invalid=10596, Unknown=0, NotChecked=0, Total=14762 [2019-09-07 10:04:40,360 INFO L87 Difference]: Start difference. First operand 338 states and 341 transitions. Second operand 122 states. [2019-09-07 10:04:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:56,553 INFO L93 Difference]: Finished difference Result 565 states and 587 transitions. [2019-09-07 10:04:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-07 10:04:56,554 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 334 [2019-09-07 10:04:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:56,555 INFO L225 Difference]: With dead ends: 565 [2019-09-07 10:04:56,556 INFO L226 Difference]: Without dead ends: 344 [2019-09-07 10:04:56,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11440 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13685, Invalid=42721, Unknown=0, NotChecked=0, Total=56406 [2019-09-07 10:04:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-07 10:04:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2019-09-07 10:04:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-07 10:04:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 346 transitions. [2019-09-07 10:04:56,570 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 346 transitions. Word has length 334 [2019-09-07 10:04:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:56,570 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 346 transitions. [2019-09-07 10:04:56,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-07 10:04:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 346 transitions. [2019-09-07 10:04:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-07 10:04:56,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:56,573 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 16, 16, 15, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:56,573 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -964293889, now seen corresponding path program 82 times [2019-09-07 10:04:56,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:56,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:04:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8605 backedges. 26 proven. 7569 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2019-09-07 10:04:59,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:59,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:59,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:04:59,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:04:59,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:59,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-07 10:04:59,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8605 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2019-09-07 10:04:59,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 91 [2019-09-07 10:04:59,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-07 10:04:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-07 10:04:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-07 10:04:59,732 INFO L87 Difference]: Start difference. First operand 343 states and 346 transitions. Second operand 91 states. [2019-09-07 10:05:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:05:00,164 INFO L93 Difference]: Finished difference Result 508 states and 514 transitions. [2019-09-07 10:05:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-07 10:05:00,165 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 339 [2019-09-07 10:05:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:05:00,166 INFO L225 Difference]: With dead ends: 508 [2019-09-07 10:05:00,166 INFO L226 Difference]: Without dead ends: 346 [2019-09-07 10:05:00,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-07 10:05:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-07 10:05:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-09-07 10:05:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-07 10:05:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 348 transitions. [2019-09-07 10:05:00,175 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 348 transitions. Word has length 339 [2019-09-07 10:05:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:05:00,175 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 348 transitions. [2019-09-07 10:05:00,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-07 10:05:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 348 transitions. [2019-09-07 10:05:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-07 10:05:00,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:05:00,177 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 16, 16, 15, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:05:00,177 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:05:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:05:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1037283043, now seen corresponding path program 83 times [2019-09-07 10:05:00,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:05:00,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:05:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:05:00,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:05:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:05:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:05:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8780 backedges. 26 proven. 7744 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2019-09-07 10:05:03,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:05:03,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:05:03,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1