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/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:53:41,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:53:41,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:53:41,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:53:41,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:53:41,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:53:41,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:53:41,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:53:41,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:53:41,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:53:41,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:53:41,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:53:41,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:53:41,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:53:41,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:53:41,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:53:41,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:53:41,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:53:41,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:53:41,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:53:41,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:53:41,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:53:41,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:53:41,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:53:41,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:53:41,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:53:41,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:53:41,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:53:41,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:53:41,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:53:41,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:53:41,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:53:41,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:53:41,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:53:41,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:53:41,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:53:41,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:53:41,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:53:41,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:53:41,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:53:41,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:53:41,908 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-03 19:53:41,923 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:53:41,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:53:41,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:53:41,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:53:41,924 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:53:41,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:53:41,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:53:41,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:53:41,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:53:41,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:53:41,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:53:41,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:53:41,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:53:41,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:53:41,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:53:41,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:53:41,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:53:41,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:53:41,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:53:41,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:53:41,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:53:41,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:53:41,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:53:41,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:53:41,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:53:41,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:53:41,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:53:41,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:53:41,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:53:41,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:53:41,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:53:41,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:53:41,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:53:41,981 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:53:41,982 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-03 19:53:42,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebe2d7ed/4d044797f005482bbfa8aae126655be1/FLAGfff0b13c6 [2019-09-03 19:53:42,457 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:53:42,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-03 19:53:42,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebe2d7ed/4d044797f005482bbfa8aae126655be1/FLAGfff0b13c6 [2019-09-03 19:53:42,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebe2d7ed/4d044797f005482bbfa8aae126655be1 [2019-09-03 19:53:42,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:53:42,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:53:42,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:53:42,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:53:42,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:53:42,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:53:42" (1/1) ... [2019-09-03 19:53:42,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1e9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:42, skipping insertion in model container [2019-09-03 19:53:42,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:53:42" (1/1) ... [2019-09-03 19:53:42,871 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:53:42,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:53:43,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:53:43,112 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:53:43,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:53:43,148 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:53:43,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43 WrapperNode [2019-09-03 19:53:43,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:53:43,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:53:43,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:53:43,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:53:43,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (1/1) ... [2019-09-03 19:53:43,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:53:43,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:53:43,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:53:43,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:53:43,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (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-03 19:53:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:53:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:53:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:53:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:53:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:53:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:53:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:53:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:53:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:53:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:53:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:53:43,483 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:53:43,483 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:53:43,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:53:43 BoogieIcfgContainer [2019-09-03 19:53:43,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:53:43,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:53:43,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:53:43,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:53:43,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:53:42" (1/3) ... [2019-09-03 19:53:43,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:53:43, skipping insertion in model container [2019-09-03 19:53:43,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:43" (2/3) ... [2019-09-03 19:53:43,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:53:43, skipping insertion in model container [2019-09-03 19:53:43,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:53:43" (3/3) ... [2019-09-03 19:53:43,500 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-09-03 19:53:43,513 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:53:43,531 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:53:43,575 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:53:43,607 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:53:43,608 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:53:43,608 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:53:43,608 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:53:43,608 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:53:43,608 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:53:43,609 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:53:43,609 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:53:43,609 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:53:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-03 19:53:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:53:43,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,636 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-03 19:53:43,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,741 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-03 19:53:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:43,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:53:43,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:53:43,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:53:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:53:43,760 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-03 19:53:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,778 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-03 19:53:43,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:53:43,779 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 19:53:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,786 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:53:43,786 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 19:53:43,790 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-03 19:53:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 19:53:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 19:53:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:53:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 19:53:43,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 19:53:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,823 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 19:53:43,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:53:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 19:53:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:53:43,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,825 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-09-03 19:53:43,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:43,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,905 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-03 19:53:43,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:43,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:53:43,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:53:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:53:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:53:43,908 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-09-03 19:53:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,944 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-09-03 19:53:43,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:53:43,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:53:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,946 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:53:43,946 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:53:43,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:53:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:53:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:53:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:53:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-03 19:53:43,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-03 19:53:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,952 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-03 19:53:43,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:53:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-03 19:53:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:53:43,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,954 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-09-03 19:53:43,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,978 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-03 19:53:43,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:43,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:53:43,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:53:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:53:43,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:53:43,983 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-03 19:53:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:44,013 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-03 19:53:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:53:44,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 19:53:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:44,015 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:53:44,015 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:53:44,016 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-03 19:53:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:53:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 19:53:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:53:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-03 19:53:44,028 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-09-03 19:53:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:44,031 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-03 19:53:44,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:53:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-03 19:53:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:53:44,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:44,034 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:44,037 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:44,037 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-09-03 19:53:44,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:44,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:44,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:44,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:44,101 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) [2019-09-03 19:53:44,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:53:44,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:44,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:44,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-03 19:53:44,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:53:44,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:53:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:53:44,184 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-09-03 19:53:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:44,209 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-03 19:53:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:53:44,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-03 19:53:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:44,210 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:53:44,211 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:53:44,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:53:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:53:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 19:53:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:53:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 19:53:44,217 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-09-03 19:53:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:44,218 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 19:53:44,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:53:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 19:53:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:53:44,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:44,219 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:44,220 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-09-03 19:53:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:44,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:44,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:44,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:44,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:44,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:53:44,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:44,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:44,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-03 19:53:44,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:53:44,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:53:44,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:53:44,329 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-03 19:53:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:44,369 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-03 19:53:44,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:53:44,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-03 19:53:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:44,371 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:53:44,371 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:53:44,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-03 19:53:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:53:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:53:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:53:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-03 19:53:44,377 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-09-03 19:53:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:44,377 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-03 19:53:44,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:53:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-03 19:53:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:53:44,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:44,379 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:44,379 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:44,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1243468678, now seen corresponding path program 3 times [2019-09-03 19:53:44,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:44,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:44,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:44,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:44,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:44,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:53:44,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:44,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:53:44,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:53:44,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:44,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-03 19:53:44,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:53:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:53:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:53:44,536 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2019-09-03 19:53:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:44,696 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2019-09-03 19:53:44,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:53:44,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 19:53:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:44,700 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:53:44,700 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:53:44,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:53:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-09-03 19:53:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:53:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-03 19:53:44,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2019-09-03 19:53:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:44,732 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-03 19:53:44,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:53:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-03 19:53:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:53:44,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:44,740 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:44,741 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 546656573, now seen corresponding path program 4 times [2019-09-03 19:53:44,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:44,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:44,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:44,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:44,835 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-03 19:53:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:44,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:44,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:44,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:53:44,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-03 19:53:44,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:53:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:53:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:53:44,897 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-09-03 19:53:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:44,930 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-03 19:53:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:53:44,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-09-03 19:53:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:44,931 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:53:44,931 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:53:44,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:53:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:53:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:53:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:53:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 19:53:44,938 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 33 [2019-09-03 19:53:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:44,938 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 19:53:44,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:53:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 19:53:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:53:44,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:44,940 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:44,940 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash 508995066, now seen corresponding path program 5 times [2019-09-03 19:53:44,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:44,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:44,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:45,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,008 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-03 19:53:45,021 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:45,047 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-03 19:53:45,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:45,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:45,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-03 19:53:45,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:53:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:53:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:53:45,073 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-09-03 19:53:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,115 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-03 19:53:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:53:45,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-03 19:53:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,118 INFO L225 Difference]: With dead ends: 59 [2019-09-03 19:53:45,118 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:53:45,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:53:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:53:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-03 19:53:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:53:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 19:53:45,125 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 36 [2019-09-03 19:53:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,125 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 19:53:45,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:53:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 19:53:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:53:45,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,127 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,127 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash -478495715, now seen corresponding path program 6 times [2019-09-03 19:53:45,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:45,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:45,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:45,225 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:45,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-03 19:53:45,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:45,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:45,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-09-03 19:53:45,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:53:45,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:53:45,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:53:45,328 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 14 states. [2019-09-03 19:53:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,511 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2019-09-03 19:53:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:53:45,514 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-09-03 19:53:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,515 INFO L225 Difference]: With dead ends: 75 [2019-09-03 19:53:45,516 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:53:45,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:53:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:53:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-09-03 19:53:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:53:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-09-03 19:53:45,528 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 39 [2019-09-03 19:53:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,528 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-09-03 19:53:45,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:53:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-09-03 19:53:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:53:45,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,530 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,531 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1304445755, now seen corresponding path program 7 times [2019-09-03 19:53:45,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 19:53:45,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,655 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:45,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 19:53:45,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-03 19:53:45,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:53:45,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:53:45,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:53:45,713 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 10 states. [2019-09-03 19:53:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,751 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-03 19:53:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:53:45,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-03 19:53:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,755 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:53:45,755 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:53:45,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:53:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:53:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 19:53:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:53:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-03 19:53:45,764 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 45 [2019-09-03 19:53:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,765 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-03 19:53:45,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:53:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-03 19:53:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:53:45,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,766 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,767 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,767 INFO L82 PathProgramCache]: Analyzing trace with hash -958438280, now seen corresponding path program 8 times [2019-09-03 19:53:45,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 19:53:45,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,874 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:45,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:45,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:45,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:45,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 19:53:45,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-03 19:53:45,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:53:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:53:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:53:45,940 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 11 states. [2019-09-03 19:53:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:46,000 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-09-03 19:53:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:53:46,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-03 19:53:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:46,002 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:53:46,002 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:53:46,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:53:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:53:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-03 19:53:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:53:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-09-03 19:53:46,014 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 48 [2019-09-03 19:53:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:46,016 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-09-03 19:53:46,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:53:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-09-03 19:53:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:53:46,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:46,017 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:46,017 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash -730046949, now seen corresponding path program 9 times [2019-09-03 19:53:46,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:46,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 125 proven. 126 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 19:53:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:46,135 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-03 19:53:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:46,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 19:53:46,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:46,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:53:46,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 203 proven. 57 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-03 19:53:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:46,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-03 19:53:46,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:53:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:53:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:53:46,354 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 22 states. [2019-09-03 19:53:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:46,708 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2019-09-03 19:53:46,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:53:46,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-09-03 19:53:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:46,710 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:53:46,710 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:53:46,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=1235, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:53:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:53:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 70. [2019-09-03 19:53:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:53:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-03 19:53:46,722 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 51 [2019-09-03 19:53:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:46,722 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-03 19:53:46,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:53:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-03 19:53:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 19:53:46,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:46,724 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:46,724 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash -346376131, now seen corresponding path program 10 times [2019-09-03 19:53:46,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:46,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:46,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:46,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:46,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:46,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:46,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:46,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:53:46,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:46,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-03 19:53:46,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:53:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:53:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:53:46,920 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 13 states. [2019-09-03 19:53:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:46,976 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-09-03 19:53:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:53:46,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-09-03 19:53:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:46,977 INFO L225 Difference]: With dead ends: 110 [2019-09-03 19:53:46,977 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 19:53:46,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:53:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 19:53:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 19:53:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:53:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-09-03 19:53:46,986 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 69 [2019-09-03 19:53:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:46,986 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-09-03 19:53:46,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:53:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-09-03 19:53:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:53:46,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:46,988 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:46,988 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1894331002, now seen corresponding path program 11 times [2019-09-03 19:53:46,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:46,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:47,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:47,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:47,136 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:47,176 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-03 19:53:47,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:47,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:53:47,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:47,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:47,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-03 19:53:47,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:53:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:53:47,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:53:47,202 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 14 states. [2019-09-03 19:53:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:47,252 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-09-03 19:53:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:53:47,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-09-03 19:53:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:47,253 INFO L225 Difference]: With dead ends: 113 [2019-09-03 19:53:47,253 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:53:47,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:53:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:53:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-03 19:53:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:53:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-09-03 19:53:47,271 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 72 [2019-09-03 19:53:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:47,272 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-09-03 19:53:47,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:53:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-09-03 19:53:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 19:53:47,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:47,275 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:47,275 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1876151523, now seen corresponding path program 12 times [2019-09-03 19:53:47,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:47,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:47,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:47,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:47,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 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-03 19:53:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:47,464 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-03 19:53:47,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:47,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:53:47,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:47,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:47,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-03 19:53:47,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:53:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:53:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:53:47,495 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 15 states. [2019-09-03 19:53:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:47,568 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-03 19:53:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:53:47,568 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2019-09-03 19:53:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:47,569 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:53:47,569 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:53:47,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:53:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:53:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 19:53:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:53:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-03 19:53:47,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 75 [2019-09-03 19:53:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:47,576 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-03 19:53:47,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:53:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-03 19:53:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:53:47,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:47,577 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:47,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2041361510, now seen corresponding path program 13 times [2019-09-03 19:53:47,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:47,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:47,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:47,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:47,709 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:47,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:47,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:53:47,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:47,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:47,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-03 19:53:47,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:53:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:53:47,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:53:47,782 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 16 states. [2019-09-03 19:53:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:47,845 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-09-03 19:53:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:53:47,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-09-03 19:53:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:47,846 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:53:47,846 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:53:47,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:53:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:53:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-03 19:53:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 19:53:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-09-03 19:53:47,853 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 78 [2019-09-03 19:53:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:47,853 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-09-03 19:53:47,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:53:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-09-03 19:53:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 19:53:47,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:47,854 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 14, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:47,855 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1779563011, now seen corresponding path program 14 times [2019-09-03 19:53:47,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:47,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:48,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:48,018 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-03 19:53:48,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:48,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:48,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:48,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:53:48,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:48,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:48,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-03 19:53:48,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:53:48,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:53:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:48,088 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 17 states. [2019-09-03 19:53:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:48,139 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2019-09-03 19:53:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:53:48,139 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-03 19:53:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:48,140 INFO L225 Difference]: With dead ends: 122 [2019-09-03 19:53:48,140 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 19:53:48,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 19:53:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 19:53:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:53:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2019-09-03 19:53:48,148 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 81 [2019-09-03 19:53:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:48,149 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2019-09-03 19:53:48,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:53:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2019-09-03 19:53:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:53:48,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:48,152 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 15, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:48,152 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2093878458, now seen corresponding path program 15 times [2019-09-03 19:53:48,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:48,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 438 proven. 345 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:48,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:48,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:48,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-03 19:53:48,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:48,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:53:48,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 24 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:48,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:48,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 27 [2019-09-03 19:53:48,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:53:48,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:53:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:53:48,639 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 27 states. [2019-09-03 19:53:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:48,717 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2019-09-03 19:53:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:53:48,717 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2019-09-03 19:53:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:48,718 INFO L225 Difference]: With dead ends: 152 [2019-09-03 19:53:48,718 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:53:48,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:53:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:53:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 19:53:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:53:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-09-03 19:53:48,725 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 84 [2019-09-03 19:53:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:48,725 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-09-03 19:53:48,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:53:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-09-03 19:53:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:53:48,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:48,727 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:48,727 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:48,727 INFO L82 PathProgramCache]: Analyzing trace with hash -711742886, now seen corresponding path program 16 times [2019-09-03 19:53:48,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:48,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:48,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 718 proven. 950 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:49,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,052 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-03 19:53:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:49,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:49,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:49,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:53:49,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 718 proven. 950 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:49,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:49,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-03 19:53:49,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:53:49,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:53:49,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:53:49,157 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 28 states. [2019-09-03 19:53:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:49,251 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2019-09-03 19:53:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:53:49,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2019-09-03 19:53:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:49,256 INFO L225 Difference]: With dead ends: 155 [2019-09-03 19:53:49,257 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 19:53:49,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:53:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 19:53:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-03 19:53:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 19:53:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-09-03 19:53:49,264 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 114 [2019-09-03 19:53:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:49,264 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-09-03 19:53:49,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:53:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-09-03 19:53:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 19:53:49,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:49,266 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:49,266 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:49,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 700460861, now seen corresponding path program 17 times [2019-09-03 19:53:49,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:49,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 746 proven. 1027 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:49,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,640 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-03 19:53:49,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:49,723 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-03 19:53:49,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:49,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:53:49,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 746 proven. 1027 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:49,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-03 19:53:49,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:53:49,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:53:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:53:49,762 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 29 states. [2019-09-03 19:53:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:49,860 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2019-09-03 19:53:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:53:49,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 117 [2019-09-03 19:53:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:49,867 INFO L225 Difference]: With dead ends: 158 [2019-09-03 19:53:49,867 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:53:49,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:53:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:53:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 19:53:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 19:53:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2019-09-03 19:53:49,875 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 117 [2019-09-03 19:53:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:49,875 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2019-09-03 19:53:49,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:53:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2019-09-03 19:53:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:53:49,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:49,877 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:49,877 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1837343878, now seen corresponding path program 18 times [2019-09-03 19:53:49,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:49,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:50,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:50,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 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-03 19:53:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:50,399 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:53:50,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:50,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:53:50,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:50,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:50,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-03 19:53:50,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:53:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:53:50,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:53:50,437 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 30 states. [2019-09-03 19:53:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:50,526 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2019-09-03 19:53:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:53:50,527 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 120 [2019-09-03 19:53:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:50,528 INFO L225 Difference]: With dead ends: 161 [2019-09-03 19:53:50,528 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 19:53:50,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:53:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 19:53:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-03 19:53:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 19:53:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-09-03 19:53:50,534 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 120 [2019-09-03 19:53:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:50,534 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-09-03 19:53:50,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:53:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-09-03 19:53:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-03 19:53:50,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:50,536 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:50,536 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1269011939, now seen corresponding path program 19 times [2019-09-03 19:53:50,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:50,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:50,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:50,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:50,984 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) [2019-09-03 19:53:51,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:51,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:51,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:51,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:51,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-03 19:53:51,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:53:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:53:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:53:51,105 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 31 states. [2019-09-03 19:53:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:51,208 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2019-09-03 19:53:51,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:53:51,209 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-09-03 19:53:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:51,210 INFO L225 Difference]: With dead ends: 164 [2019-09-03 19:53:51,210 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:53:51,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:53:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:53:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 19:53:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 19:53:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2019-09-03 19:53:51,216 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 123 [2019-09-03 19:53:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:51,217 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2019-09-03 19:53:51,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:53:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2019-09-03 19:53:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 19:53:51,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:51,233 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:51,233 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash -853298022, now seen corresponding path program 20 times [2019-09-03 19:53:51,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:51,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:51,705 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-03 19:53:51,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:51,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:51,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:51,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:53:51,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:51,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:51,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-03 19:53:51,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:53:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:53:51,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:53:51,846 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 32 states. [2019-09-03 19:53:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:51,962 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2019-09-03 19:53:51,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:53:51,962 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-09-03 19:53:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:51,964 INFO L225 Difference]: With dead ends: 167 [2019-09-03 19:53:51,964 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 19:53:51,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:53:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 19:53:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-03 19:53:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:53:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-09-03 19:53:51,974 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 126 [2019-09-03 19:53:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:51,974 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-09-03 19:53:51,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:53:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-09-03 19:53:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-03 19:53:51,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:51,977 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:51,977 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288957, now seen corresponding path program 21 times [2019-09-03 19:53:51,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:51,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 858 proven. 1365 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 19:53:52,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:52,596 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-03 19:53:52,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:52,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 19:53:52,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:52,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:53:52,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1481 proven. 262 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-03 19:53:52,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13] total 44 [2019-09-03 19:53:52,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:53:52,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:53:52,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=1287, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:52,910 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 44 states. [2019-09-03 19:53:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:53,832 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2019-09-03 19:53:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:53:53,832 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 129 [2019-09-03 19:53:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:53,834 INFO L225 Difference]: With dead ends: 201 [2019-09-03 19:53:53,834 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 19:53:53,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2049, Invalid=5091, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:53:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 19:53:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2019-09-03 19:53:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 19:53:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-09-03 19:53:53,844 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 129 [2019-09-03 19:53:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:53,845 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-09-03 19:53:53,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:53:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-09-03 19:53:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-03 19:53:53,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:53,847 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 31, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:53,847 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash 403855515, now seen corresponding path program 22 times [2019-09-03 19:53:53,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:53,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:53,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 19:53:54,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:54,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:54,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:54,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:54,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:53:54,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:54,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:54,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-03 19:53:54,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:53:54,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:53:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:53:54,390 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 34 states. [2019-09-03 19:53:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:54,504 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2019-09-03 19:53:54,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:53:54,504 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-03 19:53:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:54,505 INFO L225 Difference]: With dead ends: 179 [2019-09-03 19:53:54,505 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 19:53:54,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:53:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 19:53:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 19:53:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:53:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2019-09-03 19:53:54,512 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 135 [2019-09-03 19:53:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:54,513 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2019-09-03 19:53:54,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:53:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2019-09-03 19:53:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 19:53:54,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:54,515 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 32, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:54,515 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1808478312, now seen corresponding path program 23 times [2019-09-03 19:53:54,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:54,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 19:53:55,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:55,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:55,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:55,190 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-03 19:53:55,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:55,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:53:55,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 19:53:55,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:55,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-03 19:53:55,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:53:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:53:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:53:55,230 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 35 states. [2019-09-03 19:53:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:55,329 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2019-09-03 19:53:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:53:55,331 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-09-03 19:53:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:55,333 INFO L225 Difference]: With dead ends: 182 [2019-09-03 19:53:55,333 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:53:55,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:53:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:53:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-03 19:53:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 19:53:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2019-09-03 19:53:55,342 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 138 [2019-09-03 19:53:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:55,343 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2019-09-03 19:53:55,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:53:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2019-09-03 19:53:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 19:53:55,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:55,344 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 33, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:55,345 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1122605947, now seen corresponding path program 24 times [2019-09-03 19:53:55,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:55,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:55,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1043 proven. 1650 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 19:53:55,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:55,969 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) [2019-09-03 19:53:55,987 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:56,065 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2019-09-03 19:53:56,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:56,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:53:56,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 2486 proven. 321 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-03 19:53:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2019-09-03 19:53:57,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:53:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:53:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:53:57,004 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 70 states. [2019-09-03 19:53:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:58,692 INFO L93 Difference]: Finished difference Result 967 states and 1266 transitions. [2019-09-03 19:53:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:53:58,692 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 141 [2019-09-03 19:53:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:58,697 INFO L225 Difference]: With dead ends: 967 [2019-09-03 19:53:58,697 INFO L226 Difference]: Without dead ends: 928 [2019-09-03 19:53:58,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3837, Invalid=14795, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 19:53:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-03 19:53:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 214. [2019-09-03 19:53:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-03 19:53:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2019-09-03 19:53:58,724 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 248 transitions. Word has length 141 [2019-09-03 19:53:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:58,725 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 248 transitions. [2019-09-03 19:53:58,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:53:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 248 transitions. [2019-09-03 19:53:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-03 19:53:58,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:58,726 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:58,726 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1937984451, now seen corresponding path program 25 times [2019-09-03 19:53:58,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 3466 proven. 1751 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:53:59,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:59,265 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-03 19:53:59,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:59,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:53:59,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 3466 proven. 1751 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:53:59,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:59,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-03 19:53:59,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:53:59,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:53:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:53:59,400 INFO L87 Difference]: Start difference. First operand 214 states and 248 transitions. Second operand 37 states. [2019-09-03 19:53:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:59,511 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2019-09-03 19:53:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:53:59,515 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 213 [2019-09-03 19:53:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:59,517 INFO L225 Difference]: With dead ends: 326 [2019-09-03 19:53:59,517 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:53:59,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:53:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:53:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-03 19:53:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 19:53:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2019-09-03 19:53:59,531 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 213 [2019-09-03 19:53:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:59,531 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2019-09-03 19:53:59,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:53:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2019-09-03 19:53:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-03 19:53:59,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:59,533 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:59,533 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash 13649018, now seen corresponding path program 26 times [2019-09-03 19:53:59,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:59,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:59,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3566 proven. 1855 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:00,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:00,138 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) [2019-09-03 19:54:00,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:00,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:00,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:00,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:54:00,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3566 proven. 1855 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:00,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-03 19:54:00,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:54:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:54:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:54:00,268 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand 38 states. [2019-09-03 19:54:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:00,385 INFO L93 Difference]: Finished difference Result 329 states and 398 transitions. [2019-09-03 19:54:00,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:54:00,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 216 [2019-09-03 19:54:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:00,387 INFO L225 Difference]: With dead ends: 329 [2019-09-03 19:54:00,387 INFO L226 Difference]: Without dead ends: 221 [2019-09-03 19:54:00,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:54:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-03 19:54:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-09-03 19:54:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 19:54:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2019-09-03 19:54:00,402 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 216 [2019-09-03 19:54:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:00,402 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2019-09-03 19:54:00,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:54:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2019-09-03 19:54:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-03 19:54:00,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:00,404 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 36, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:00,404 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:00,404 INFO L82 PathProgramCache]: Analyzing trace with hash 154038045, now seen corresponding path program 27 times [2019-09-03 19:54:00,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:00,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:00,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:00,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:00,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 3666 proven. 1962 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:01,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:01,068 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-03 19:54:01,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:01,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-03 19:54:01,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:01,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:54:01,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 3666 proven. 1962 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:01,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:01,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-03 19:54:01,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:54:01,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:54:01,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:54:01,265 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand 39 states. [2019-09-03 19:54:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:01,386 INFO L93 Difference]: Finished difference Result 332 states and 401 transitions. [2019-09-03 19:54:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:54:01,386 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 219 [2019-09-03 19:54:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:01,388 INFO L225 Difference]: With dead ends: 332 [2019-09-03 19:54:01,388 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 19:54:01,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:54:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 19:54:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-03 19:54:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 19:54:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 257 transitions. [2019-09-03 19:54:01,402 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 257 transitions. Word has length 219 [2019-09-03 19:54:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:01,402 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 257 transitions. [2019-09-03 19:54:01,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:54:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 257 transitions. [2019-09-03 19:54:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 19:54:01,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:01,404 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 37, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:01,404 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:01,404 INFO L82 PathProgramCache]: Analyzing trace with hash -814604902, now seen corresponding path program 28 times [2019-09-03 19:54:01,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 3766 proven. 2072 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:02,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:02,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:54:02,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:02,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:02,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:02,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:54:02,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 3766 proven. 2072 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:02,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:02,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-03 19:54:02,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:54:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:54:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:54:02,152 INFO L87 Difference]: Start difference. First operand 223 states and 257 transitions. Second operand 40 states. [2019-09-03 19:54:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:02,257 INFO L93 Difference]: Finished difference Result 335 states and 404 transitions. [2019-09-03 19:54:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:54:02,258 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 222 [2019-09-03 19:54:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:02,259 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:54:02,259 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 19:54:02,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:54:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 19:54:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-09-03 19:54:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 19:54:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 260 transitions. [2019-09-03 19:54:02,273 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 260 transitions. Word has length 222 [2019-09-03 19:54:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:02,274 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 260 transitions. [2019-09-03 19:54:02,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:54:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 260 transitions. [2019-09-03 19:54:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-03 19:54:02,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:02,275 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 38, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:02,276 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 228622845, now seen corresponding path program 29 times [2019-09-03 19:54:02,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3866 proven. 2185 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:03,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:03,012 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:03,021 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:03,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-03 19:54:03,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:03,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:54:03,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3866 proven. 2185 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:03,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-03 19:54:03,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:54:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:54:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:54:03,229 INFO L87 Difference]: Start difference. First operand 226 states and 260 transitions. Second operand 41 states. [2019-09-03 19:54:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:03,355 INFO L93 Difference]: Finished difference Result 338 states and 407 transitions. [2019-09-03 19:54:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:54:03,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2019-09-03 19:54:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:03,359 INFO L225 Difference]: With dead ends: 338 [2019-09-03 19:54:03,359 INFO L226 Difference]: Without dead ends: 230 [2019-09-03 19:54:03,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:54:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-03 19:54:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-03 19:54:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-03 19:54:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 263 transitions. [2019-09-03 19:54:03,373 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 263 transitions. Word has length 225 [2019-09-03 19:54:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:03,374 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 263 transitions. [2019-09-03 19:54:03,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:54:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 263 transitions. [2019-09-03 19:54:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 19:54:03,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:03,375 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 39, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:03,376 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash 643079866, now seen corresponding path program 30 times [2019-09-03 19:54:03,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:03,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 3966 proven. 2301 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-03 19:54:04,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:04,506 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) [2019-09-03 19:54:04,518 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:04,700 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-03 19:54:04,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:04,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 19:54:04,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 4450 proven. 3334 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 19:54:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 82 [2019-09-03 19:54:06,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:54:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:54:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:54:06,021 INFO L87 Difference]: Start difference. First operand 229 states and 263 transitions. Second operand 82 states. [2019-09-03 19:54:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:08,455 INFO L93 Difference]: Finished difference Result 959 states and 1238 transitions. [2019-09-03 19:54:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 19:54:08,455 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 228 [2019-09-03 19:54:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:08,460 INFO L225 Difference]: With dead ends: 959 [2019-09-03 19:54:08,460 INFO L226 Difference]: Without dead ends: 851 [2019-09-03 19:54:08,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6046 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5235, Invalid=20525, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 19:54:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-09-03 19:54:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 250. [2019-09-03 19:54:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-03 19:54:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2019-09-03 19:54:08,490 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 228 [2019-09-03 19:54:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:08,491 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2019-09-03 19:54:08,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:54:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2019-09-03 19:54:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-03 19:54:08,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:08,493 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:08,493 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash -974894275, now seen corresponding path program 31 times [2019-09-03 19:54:08,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:08,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 4798 proven. 2420 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:09,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:09,543 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-03 19:54:09,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:09,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:54:09,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 4798 proven. 2420 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:09,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:09,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-03 19:54:09,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:54:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:54:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:54:09,692 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand 43 states. [2019-09-03 19:54:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:09,838 INFO L93 Difference]: Finished difference Result 380 states and 461 transitions. [2019-09-03 19:54:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:54:09,838 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2019-09-03 19:54:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:09,840 INFO L225 Difference]: With dead ends: 380 [2019-09-03 19:54:09,840 INFO L226 Difference]: Without dead ends: 254 [2019-09-03 19:54:09,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:54:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-03 19:54:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-03 19:54:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-03 19:54:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 293 transitions. [2019-09-03 19:54:09,869 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 293 transitions. Word has length 249 [2019-09-03 19:54:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:09,870 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 293 transitions. [2019-09-03 19:54:09,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:54:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 293 transitions. [2019-09-03 19:54:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:54:09,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:09,873 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:09,874 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash -491962118, now seen corresponding path program 32 times [2019-09-03 19:54:09,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 4916 proven. 2542 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:10,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:10,927 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-03 19:54:10,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:11,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:11,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:11,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:54:11,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 4916 proven. 2542 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:11,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:11,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-03 19:54:11,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:54:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:54:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:54:11,074 INFO L87 Difference]: Start difference. First operand 253 states and 293 transitions. Second operand 44 states. [2019-09-03 19:54:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:11,199 INFO L93 Difference]: Finished difference Result 383 states and 464 transitions. [2019-09-03 19:54:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:54:11,199 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 252 [2019-09-03 19:54:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:11,200 INFO L225 Difference]: With dead ends: 383 [2019-09-03 19:54:11,200 INFO L226 Difference]: Without dead ends: 257 [2019-09-03 19:54:11,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:54:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-03 19:54:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-09-03 19:54:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 19:54:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2019-09-03 19:54:11,223 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 252 [2019-09-03 19:54:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:11,223 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2019-09-03 19:54:11,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:54:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2019-09-03 19:54:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-03 19:54:11,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:11,225 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 42, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:11,225 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1600514531, now seen corresponding path program 33 times [2019-09-03 19:54:11,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:11,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:11,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:11,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 5034 proven. 2667 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:12,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:12,017 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-03 19:54:12,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:12,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-03 19:54:12,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:12,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:54:12,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 5034 proven. 2667 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:12,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:12,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-03 19:54:12,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:54:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:54:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:54:12,266 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand 45 states. [2019-09-03 19:54:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:12,394 INFO L93 Difference]: Finished difference Result 386 states and 467 transitions. [2019-09-03 19:54:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:54:12,395 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 255 [2019-09-03 19:54:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:12,397 INFO L225 Difference]: With dead ends: 386 [2019-09-03 19:54:12,397 INFO L226 Difference]: Without dead ends: 260 [2019-09-03 19:54:12,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:54:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-03 19:54:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-09-03 19:54:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 19:54:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2019-09-03 19:54:12,419 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 255 [2019-09-03 19:54:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:12,419 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2019-09-03 19:54:12,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:54:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2019-09-03 19:54:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:54:12,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:12,421 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 43, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:12,422 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1813056026, now seen corresponding path program 34 times [2019-09-03 19:54:12,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:12,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:12,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5152 proven. 2795 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:13,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:13,252 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-03 19:54:13,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:13,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:13,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:13,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:54:13,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5152 proven. 2795 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:13,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:13,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-03 19:54:13,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:54:13,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:54:13,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:54:13,385 INFO L87 Difference]: Start difference. First operand 259 states and 299 transitions. Second operand 46 states. [2019-09-03 19:54:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:13,527 INFO L93 Difference]: Finished difference Result 389 states and 470 transitions. [2019-09-03 19:54:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:54:13,528 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 258 [2019-09-03 19:54:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:13,530 INFO L225 Difference]: With dead ends: 389 [2019-09-03 19:54:13,530 INFO L226 Difference]: Without dead ends: 263 [2019-09-03 19:54:13,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:54:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-03 19:54:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-09-03 19:54:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-03 19:54:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 302 transitions. [2019-09-03 19:54:13,551 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 302 transitions. Word has length 258 [2019-09-03 19:54:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:13,552 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 302 transitions. [2019-09-03 19:54:13,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:54:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 302 transitions. [2019-09-03 19:54:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 19:54:13,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:13,554 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 44, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:13,554 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:13,554 INFO L82 PathProgramCache]: Analyzing trace with hash -742115075, now seen corresponding path program 35 times [2019-09-03 19:54:13,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:13,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:13,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 5270 proven. 2926 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:14,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:14,348 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-03 19:54:14,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:14,537 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-03 19:54:14,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:14,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:54:14,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 5270 proven. 2926 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:14,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:14,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-03 19:54:14,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:54:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:54:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:54:14,621 INFO L87 Difference]: Start difference. First operand 262 states and 302 transitions. Second operand 47 states. [2019-09-03 19:54:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:14,759 INFO L93 Difference]: Finished difference Result 392 states and 473 transitions. [2019-09-03 19:54:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:54:14,760 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 261 [2019-09-03 19:54:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:14,761 INFO L225 Difference]: With dead ends: 392 [2019-09-03 19:54:14,761 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 19:54:14,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:54:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 19:54:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-09-03 19:54:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 19:54:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 305 transitions. [2019-09-03 19:54:14,783 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 305 transitions. Word has length 261 [2019-09-03 19:54:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:14,783 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 305 transitions. [2019-09-03 19:54:14,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:54:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 305 transitions. [2019-09-03 19:54:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-03 19:54:14,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:14,785 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 45, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:14,785 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2138997958, now seen corresponding path program 36 times [2019-09-03 19:54:14,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 5388 proven. 3060 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:15,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:15,872 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-03 19:54:15,882 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:16,060 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-03 19:54:16,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:16,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:54:16,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 5388 proven. 3060 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:16,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:16,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-03 19:54:16,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:54:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:54:16,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:54:16,145 INFO L87 Difference]: Start difference. First operand 265 states and 305 transitions. Second operand 48 states. [2019-09-03 19:54:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:16,275 INFO L93 Difference]: Finished difference Result 395 states and 476 transitions. [2019-09-03 19:54:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:54:16,276 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 264 [2019-09-03 19:54:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:16,277 INFO L225 Difference]: With dead ends: 395 [2019-09-03 19:54:16,277 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 19:54:16,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:54:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 19:54:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-09-03 19:54:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-03 19:54:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2019-09-03 19:54:16,299 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 264 [2019-09-03 19:54:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:16,299 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2019-09-03 19:54:16,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:54:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2019-09-03 19:54:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-03 19:54:16,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:16,301 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 46, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:16,302 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1556132829, now seen corresponding path program 37 times [2019-09-03 19:54:16,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 5506 proven. 3197 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:17,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:17,178 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-03 19:54:17,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:17,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:54:17,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 5506 proven. 3197 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:17,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:17,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-03 19:54:17,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:54:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:54:17,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:54:17,318 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand 49 states. [2019-09-03 19:54:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:17,500 INFO L93 Difference]: Finished difference Result 398 states and 479 transitions. [2019-09-03 19:54:17,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:54:17,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 267 [2019-09-03 19:54:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:17,502 INFO L225 Difference]: With dead ends: 398 [2019-09-03 19:54:17,502 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 19:54:17,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:54:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 19:54:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-09-03 19:54:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 19:54:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 311 transitions. [2019-09-03 19:54:17,524 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 311 transitions. Word has length 267 [2019-09-03 19:54:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:17,524 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 311 transitions. [2019-09-03 19:54:17,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:54:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 311 transitions. [2019-09-03 19:54:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 19:54:17,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:17,526 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 47, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:17,527 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1109355430, now seen corresponding path program 38 times [2019-09-03 19:54:17,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:17,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 5624 proven. 3337 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:18,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:18,454 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-03 19:54:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:18,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:18,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:54:18,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 5624 proven. 3337 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:18,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:18,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-03 19:54:18,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:54:18,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:54:18,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:54:18,640 INFO L87 Difference]: Start difference. First operand 271 states and 311 transitions. Second operand 50 states. [2019-09-03 19:54:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:18,834 INFO L93 Difference]: Finished difference Result 401 states and 482 transitions. [2019-09-03 19:54:18,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:54:18,835 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 270 [2019-09-03 19:54:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:18,837 INFO L225 Difference]: With dead ends: 401 [2019-09-03 19:54:18,837 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 19:54:18,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:54:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 19:54:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-09-03 19:54:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-03 19:54:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2019-09-03 19:54:18,859 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 270 [2019-09-03 19:54:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:18,860 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2019-09-03 19:54:18,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:54:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2019-09-03 19:54:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-03 19:54:18,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:18,861 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 48, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:18,862 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:18,862 INFO L82 PathProgramCache]: Analyzing trace with hash 980256445, now seen corresponding path program 39 times [2019-09-03 19:54:18,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:18,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:18,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 5742 proven. 3480 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:19,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:19,917 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-03 19:54:19,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:20,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-03 19:54:20,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:20,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:54:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 5742 proven. 3480 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:20,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:20,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-03 19:54:20,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:54:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:54:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:54:20,176 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand 51 states. [2019-09-03 19:54:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:20,336 INFO L93 Difference]: Finished difference Result 404 states and 485 transitions. [2019-09-03 19:54:20,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:54:20,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 273 [2019-09-03 19:54:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:20,339 INFO L225 Difference]: With dead ends: 404 [2019-09-03 19:54:20,339 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 19:54:20,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:54:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 19:54:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-09-03 19:54:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-03 19:54:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2019-09-03 19:54:20,361 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 273 [2019-09-03 19:54:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:20,361 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2019-09-03 19:54:20,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:54:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2019-09-03 19:54:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 19:54:20,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:20,363 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 49, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:20,363 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1351636346, now seen corresponding path program 40 times [2019-09-03 19:54:20,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:20,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:20,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 5860 proven. 3626 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:22,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54: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 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-03 19:54:22,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:22,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:22,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:22,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:54:22,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 5860 proven. 3626 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-03 19:54:22,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:22,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-03 19:54:22,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:54:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:54:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:22,434 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand 52 states. [2019-09-03 19:54:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:22,747 INFO L93 Difference]: Finished difference Result 444 states and 525 transitions. [2019-09-03 19:54:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:54:22,748 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 276 [2019-09-03 19:54:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:22,750 INFO L225 Difference]: With dead ends: 444 [2019-09-03 19:54:22,750 INFO L226 Difference]: Without dead ends: 318 [2019-09-03 19:54:22,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-03 19:54:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2019-09-03 19:54:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 19:54:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2019-09-03 19:54:22,790 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 276 [2019-09-03 19:54:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:22,791 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2019-09-03 19:54:22,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:54:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2019-09-03 19:54:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-03 19:54:22,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:22,795 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 50, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:22,795 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1294512541, now seen corresponding path program 41 times [2019-09-03 19:54:22,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:22,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:22,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:22,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:22,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 7121 proven. 4642 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-03 19:54:24,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:24,495 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) [2019-09-03 19:54:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:24,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-03 19:54:24,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:24,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:54:24,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 7255 proven. 4642 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-03 19:54:25,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:25,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 53] total 53 [2019-09-03 19:54:25,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:54:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:54:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:54:25,131 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand 53 states. [2019-09-03 19:54:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:25,696 INFO L93 Difference]: Finished difference Result 1616 states and 2106 transitions. [2019-09-03 19:54:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:54:25,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2019-09-03 19:54:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:25,707 INFO L225 Difference]: With dead ends: 1616 [2019-09-03 19:54:25,707 INFO L226 Difference]: Without dead ends: 1611 [2019-09-03 19:54:25,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:54:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2019-09-03 19:54:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 313. [2019-09-03 19:54:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-03 19:54:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2019-09-03 19:54:25,777 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 279 [2019-09-03 19:54:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:25,780 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2019-09-03 19:54:25,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:54:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2019-09-03 19:54:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 19:54:25,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:25,783 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:25,783 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash -644776136, now seen corresponding path program 42 times [2019-09-03 19:54:25,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:25,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:25,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:29,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:29,782 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-03 19:54:29,793 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:30,021 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2019-09-03 19:54:30,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:30,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 410 conjunts are in the unsatisfiable core [2019-09-03 19:54:30,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:50,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:51,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:51,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 205] total 307 [2019-09-03 19:54:51,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 307 states [2019-09-03 19:54:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 307 interpolants. [2019-09-03 19:54:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4640, Invalid=89302, Unknown=0, NotChecked=0, Total=93942 [2019-09-03 19:54:51,501 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 307 states. [2019-09-03 19:55:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:19,997 INFO L93 Difference]: Finished difference Result 4548 states and 6025 transitions. [2019-09-03 19:55:19,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2019-09-03 19:55:19,997 INFO L78 Accepts]: Start accepts. Automaton has 307 states. Word has length 312 [2019-09-03 19:55:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:20,015 INFO L225 Difference]: With dead ends: 4548 [2019-09-03 19:55:20,015 INFO L226 Difference]: Without dead ends: 4386 [2019-09-03 19:55:20,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35852 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=4646, Invalid=89910, Unknown=0, NotChecked=0, Total=94556 [2019-09-03 19:55:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2019-09-03 19:55:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4190. [2019-09-03 19:55:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-09-03 19:55:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2019-09-03 19:55:21,142 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 312 [2019-09-03 19:55:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:21,143 INFO L475 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2019-09-03 19:55:21,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 307 states. [2019-09-03 19:55:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2019-09-03 19:55:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-03 19:55:21,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:21,145 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:21,146 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:21,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1847249315, now seen corresponding path program 43 times [2019-09-03 19:55:21,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:21,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:21,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-03 19:55:22,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:22,413 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) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:22,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:22,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 19:55:22,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-03 19:55:22,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:22,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-03 19:55:22,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:55:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:55:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:55:22,635 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand 54 states. [2019-09-03 19:55:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:23,563 INFO L93 Difference]: Finished difference Result 4341 states and 4441 transitions. [2019-09-03 19:55:23,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:55:23,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2019-09-03 19:55:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:23,564 INFO L225 Difference]: With dead ends: 4341 [2019-09-03 19:55:23,564 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:55:23,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:55:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:55:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:55:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:55:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:55:23,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 315 [2019-09-03 19:55:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:23,571 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:55:23,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:55:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:55:23,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:55:23,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:55:31,060 WARN L188 SmtUtils]: Spent 7.47 s on a formula simplification. DAG size of input: 1950 DAG size of output: 1530 [2019-09-03 19:55:47,773 WARN L188 SmtUtils]: Spent 16.67 s on a formula simplification. DAG size of input: 1526 DAG size of output: 493 [2019-09-03 19:55:47,778 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:55:47,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:55:47,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:55:47,778 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:55:47,778 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:55:47,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:55:47,778 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2019-09-03 19:55:47,778 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2019-09-03 19:55:47,778 INFO L443 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-09-03 19:55:47,778 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2019-09-03 19:55:47,779 INFO L443 ceAbstractionStarter]: For program point L15-2(lines 14 22) no Hoare annotation was computed. [2019-09-03 19:55:47,779 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2019-09-03 19:55:47,780 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (let ((.cse4 (<= main_~y~0 14)) (.cse5 (<= 14 main_~y~0)) (.cse10 (<= main_~y~0 17)) (.cse11 (<= 17 main_~y~0)) (.cse2 (<= 0 main_~y~0)) (.cse3 (<= main_~y~0 0)) (.cse0 (<= 44 main_~y~0)) (.cse1 (<= main_~y~0 44)) (.cse15 (<= main_~y~0 30)) (.cse14 (<= 30 main_~y~0)) (.cse17 (<= 23 main_~y~0)) (.cse16 (<= main_~y~0 23)) (.cse12 (<= 32 main_~y~0)) (.cse13 (<= main_~y~0 32)) (.cse8 (<= main_~y~0 3)) (.cse9 (<= 3 main_~y~0)) (.cse6 (<= 19 main_~y~0)) (.cse7 (<= main_~y~0 19))) (or (and (= main_~x~0 50) (= main_~y~0 50)) (and (and (= 56 main_~x~0) .cse0) .cse1) (and (= 18 main_~y~0) (= main_~x~0 82)) (and (= 45 main_~x~0) (= main_~y~0 45)) (and (= 43 main_~x~0) (<= 43 main_~y~0) (<= main_~y~0 43)) (and (<= main_~y~0 34) (and (<= 66 main_~x~0) (<= main_~x~0 66) (<= 34 main_~y~0))) (and (= main_~x~0 48) (= main_~y~0 48)) (and (= main_~x~0 0) .cse2 .cse3) (and (= main_~y~0 24) (= 24 main_~x~0)) (and (= 35 main_~y~0) (= main_~x~0 65)) (and (= main_~x~0 36) (= main_~y~0 36)) (and (<= main_~y~0 35) (<= 35 main_~y~0) (= main_~x~0 35)) (and (<= main_~y~0 28) (and (<= 28 main_~y~0) (<= 72 main_~x~0) (<= main_~x~0 72))) (and (= main_~x~0 34) (= main_~y~0 34)) (and .cse4 (= main_~x~0 14) .cse5) (and (= 89 main_~x~0) (= 11 main_~y~0)) (and (and (= 81 main_~x~0) .cse6) .cse7) (and (= main_~y~0 15) (= main_~x~0 15)) (and (= main_~x~0 52) (= 48 main_~y~0)) (and (= 9 main_~x~0) (= main_~y~0 9)) (and .cse4 (and .cse5 (<= main_~x~0 86) (<= 86 main_~x~0))) (and (= 58 main_~x~0) (= 42 main_~y~0)) (and (= main_~x~0 5) (= main_~y~0 5)) (and (= main_~y~0 40) (= 40 main_~x~0)) (and .cse8 (= 3 main_~x~0) .cse9) (and (= main_~x~0 88) (= 12 main_~y~0)) (and .cse10 .cse11 (= main_~x~0 17)) (and (= main_~x~0 27) (= main_~y~0 27)) (and (= 24 main_~y~0) (= main_~x~0 76)) (and .cse10 (and .cse11 (<= 83 main_~x~0) (<= main_~x~0 83))) (and (= 53 main_~x~0) (= 47 main_~y~0)) (and (= main_~x~0 22) (= main_~y~0 22)) (and (<= main_~x~0 100) .cse2 (<= 100 main_~x~0) .cse3) (and (and (<= 80 main_~x~0) (<= main_~x~0 80) (<= 20 main_~y~0)) (<= main_~y~0 20)) (and (= 26 main_~x~0) (= main_~y~0 26)) (and (= main_~y~0 16) (= 16 main_~x~0)) (and (<= main_~y~0 41) (and (<= 41 main_~y~0) (<= 59 main_~x~0) (<= main_~x~0 59))) (and (= main_~y~0 33) (= 33 main_~x~0)) (and (= 8 main_~x~0) (<= 8 main_~y~0) (<= main_~y~0 8)) (and (and (<= 62 main_~x~0) (<= main_~x~0 62) (<= 38 main_~y~0)) (<= main_~y~0 38)) (and (= main_~x~0 7) (= main_~y~0 7)) (and (= main_~x~0 38) (= main_~y~0 38)) (and (= 2 main_~x~0) (= main_~y~0 2)) (and (and (<= 68 main_~x~0) .cse12 (<= main_~x~0 68)) .cse13) (and (and (<= 25 main_~y~0) (<= main_~x~0 75) (<= 75 main_~x~0)) (<= main_~y~0 25)) (and (= 8 main_~y~0) (= main_~x~0 92)) (and (= main_~x~0 78) (= 22 main_~y~0)) (and (= 54 main_~x~0) (= 46 main_~y~0)) (and (= main_~x~0 49) (= main_~y~0 49)) (and (= main_~x~0 12) (= main_~y~0 12)) (and (= 61 main_~x~0) (= 39 main_~y~0)) (and (= main_~x~0 37) (= main_~y~0 37)) (and (= main_~x~0 44) .cse0 .cse1) (and (= 43 main_~y~0) (= main_~x~0 57)) (and (<= main_~y~0 13) (and (<= 13 main_~y~0) (= 87 main_~x~0))) (and (= 1 main_~y~0) (= 99 main_~x~0)) (and (and (<= 74 main_~x~0) (<= 26 main_~y~0) (<= main_~x~0 74)) (<= main_~y~0 26)) (and (= main_~y~0 21) (= main_~x~0 21)) (and (= 37 main_~y~0) (= main_~x~0 63)) (and (= main_~x~0 51) (= 49 main_~y~0)) (and (= main_~y~0 11) (= main_~x~0 11)) (and (= 46 main_~x~0) (= main_~y~0 46)) (and (= main_~x~0 28) (= main_~y~0 28)) (and (= main_~x~0 39) (<= main_~y~0 39) (<= 39 main_~y~0)) (and (and .cse14 (= main_~x~0 70)) .cse15) (and .cse15 .cse14 (= 30 main_~x~0)) (and (and (<= 31 main_~y~0) (<= main_~x~0 69) (<= 69 main_~x~0)) (<= main_~y~0 31)) (and .cse16 (and (<= 77 main_~x~0) (<= main_~x~0 77) .cse17)) (and (= main_~x~0 4) (= main_~y~0 4)) (and (= main_~x~0 18) (= main_~y~0 18)) (and (<= main_~y~0 4) (and (<= main_~x~0 96) (<= 4 main_~y~0) (<= 96 main_~x~0))) (and (<= main_~y~0 40) (and (<= 40 main_~y~0) (<= main_~x~0 60) (<= 60 main_~x~0))) (and (= main_~y~0 31) (= main_~x~0 31)) (and (= main_~y~0 10) (= 10 main_~x~0)) (and .cse17 (= 23 main_~x~0) .cse16) (and (= 1 main_~x~0) (= main_~y~0 1)) (and (= 41 main_~x~0) (= main_~y~0 41)) (and (and (<= 6 main_~y~0) (<= 94 main_~x~0) (<= main_~x~0 94)) (<= main_~y~0 6)) (and (and (<= 2 main_~y~0) (= 98 main_~x~0)) (<= main_~y~0 2)) (and (and (= 93 main_~x~0) (<= 7 main_~y~0)) (<= main_~y~0 7)) (and (= main_~y~0 25) (= 25 main_~x~0)) (and (<= main_~y~0 36) (and (= 64 main_~x~0) (<= 36 main_~y~0))) (and (<= main_~y~0 29) (and (<= 71 main_~x~0) (<= 29 main_~y~0) (<= main_~x~0 71))) (and (<= main_~y~0 45) (and (<= 45 main_~y~0) (<= main_~x~0 55) (<= 55 main_~x~0))) (and (= main_~y~0 13) (= 13 main_~x~0)) (and (= main_~x~0 91) (= 9 main_~y~0)) (and (<= main_~y~0 21) (and (<= 21 main_~y~0) (<= main_~x~0 79) (<= 79 main_~x~0))) (and .cse12 .cse13 (= main_~x~0 32)) (and (= 20 main_~x~0) (= main_~y~0 20)) (and (<= main_~y~0 33) (and (<= 33 main_~y~0) (<= 67 main_~x~0) (<= main_~x~0 67))) (and (= main_~x~0 42) (= main_~y~0 42)) (and (<= 47 main_~y~0) (<= main_~y~0 47) (= main_~x~0 47)) (and .cse8 (and .cse9 (<= 97 main_~x~0) (<= main_~x~0 97))) (and .cse6 (= main_~x~0 19) .cse7) (and (<= main_~y~0 5) (and (<= main_~x~0 95) (<= 5 main_~y~0) (<= 95 main_~x~0))) (and (= 29 main_~x~0) (= main_~y~0 29)) (and (= main_~x~0 6) (= main_~y~0 6)) (and (<= main_~y~0 15) (and (<= main_~x~0 85) (<= 85 main_~x~0) (<= 15 main_~y~0))) (and (<= main_~y~0 16) (and (= 84 main_~x~0) (<= 16 main_~y~0))) (and (<= main_~y~0 10) (and (<= 10 main_~y~0) (<= 90 main_~x~0) (<= main_~x~0 90))) (and (and (<= main_~x~0 73) (<= 73 main_~x~0) (<= 27 main_~y~0)) (<= main_~y~0 27)))) [2019-09-03 19:55:47,780 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (and (<= main_~x~0 100) (<= 100 main_~x~0)) [2019-09-03 19:55:47,781 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:55:47,781 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:55:47,781 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:55:47,781 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:55:47,781 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:55:47,781 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:55:47,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:55:47 BoogieIcfgContainer [2019-09-03 19:55:47,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:55:47,815 INFO L168 Benchmark]: Toolchain (without parser) took 124960.42 ms. Allocated memory was 133.2 MB in the beginning and 1.1 GB in the end (delta: 962.6 MB). Free memory was 88.4 MB in the beginning and 520.5 MB in the end (delta: -432.1 MB). Peak memory consumption was 944.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:55:47,815 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 133.2 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:55:47,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.65 ms. Allocated memory is still 133.2 MB. Free memory was 88.0 MB in the beginning and 79.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:55:47,816 INFO L168 Benchmark]: Boogie Preprocessor took 110.65 ms. Allocated memory was 133.2 MB in the beginning and 199.2 MB in the end (delta: 66.1 MB). Free memory was 79.1 MB in the beginning and 176.3 MB in the end (delta: -97.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:55:47,817 INFO L168 Benchmark]: RCFGBuilder took 224.55 ms. Allocated memory is still 199.2 MB. Free memory was 176.3 MB in the beginning and 164.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:55:47,818 INFO L168 Benchmark]: TraceAbstraction took 124322.36 ms. Allocated memory was 199.2 MB in the beginning and 1.1 GB in the end (delta: 896.5 MB). Free memory was 164.5 MB in the beginning and 520.5 MB in the end (delta: -356.0 MB). Peak memory consumption was 954.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:55:47,820 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 133.2 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.65 ms. Allocated memory is still 133.2 MB. Free memory was 88.0 MB in the beginning and 79.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.65 ms. Allocated memory was 133.2 MB in the beginning and 199.2 MB in the end (delta: 66.1 MB). Free memory was 79.1 MB in the beginning and 176.3 MB in the end (delta: -97.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 224.55 ms. Allocated memory is still 199.2 MB. Free memory was 176.3 MB in the beginning and 164.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124322.36 ms. Allocated memory was 199.2 MB in the beginning and 1.1 GB in the end (delta: 896.5 MB). Free memory was 164.5 MB in the beginning and 520.5 MB in the end (delta: -356.0 MB). Peak memory consumption was 954.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x == 50 && y == 50) || ((56 == x && 44 <= y) && y <= 44)) || (18 == y && x == 82)) || (45 == x && y == 45)) || ((43 == x && 43 <= y) && y <= 43)) || (y <= 34 && (66 <= x && x <= 66) && 34 <= y)) || (x == 48 && y == 48)) || ((x == 0 && 0 <= y) && y <= 0)) || (y == 24 && 24 == x)) || (35 == y && x == 65)) || (x == 36 && y == 36)) || ((y <= 35 && 35 <= y) && x == 35)) || (y <= 28 && (28 <= y && 72 <= x) && x <= 72)) || (x == 34 && y == 34)) || ((y <= 14 && x == 14) && 14 <= y)) || (89 == x && 11 == y)) || ((81 == x && 19 <= y) && y <= 19)) || (y == 15 && x == 15)) || (x == 52 && 48 == y)) || (9 == x && y == 9)) || (y <= 14 && (14 <= y && x <= 86) && 86 <= x)) || (58 == x && 42 == y)) || (x == 5 && y == 5)) || (y == 40 && 40 == x)) || ((y <= 3 && 3 == x) && 3 <= y)) || (x == 88 && 12 == y)) || ((y <= 17 && 17 <= y) && x == 17)) || (x == 27 && y == 27)) || (24 == y && x == 76)) || (y <= 17 && (17 <= y && 83 <= x) && x <= 83)) || (53 == x && 47 == y)) || (x == 22 && y == 22)) || (((x <= 100 && 0 <= y) && 100 <= x) && y <= 0)) || (((80 <= x && x <= 80) && 20 <= y) && y <= 20)) || (26 == x && y == 26)) || (y == 16 && 16 == x)) || (y <= 41 && (41 <= y && 59 <= x) && x <= 59)) || (y == 33 && 33 == x)) || ((8 == x && 8 <= y) && y <= 8)) || (((62 <= x && x <= 62) && 38 <= y) && y <= 38)) || (x == 7 && y == 7)) || (x == 38 && y == 38)) || (2 == x && y == 2)) || (((68 <= x && 32 <= y) && x <= 68) && y <= 32)) || (((25 <= y && x <= 75) && 75 <= x) && y <= 25)) || (8 == y && x == 92)) || (x == 78 && 22 == y)) || (54 == x && 46 == y)) || (x == 49 && y == 49)) || (x == 12 && y == 12)) || (61 == x && 39 == y)) || (x == 37 && y == 37)) || ((x == 44 && 44 <= y) && y <= 44)) || (43 == y && x == 57)) || (y <= 13 && 13 <= y && 87 == x)) || (1 == y && 99 == x)) || (((74 <= x && 26 <= y) && x <= 74) && y <= 26)) || (y == 21 && x == 21)) || (37 == y && x == 63)) || (x == 51 && 49 == y)) || (y == 11 && x == 11)) || (46 == x && y == 46)) || (x == 28 && y == 28)) || ((x == 39 && y <= 39) && 39 <= y)) || ((30 <= y && x == 70) && y <= 30)) || ((y <= 30 && 30 <= y) && 30 == x)) || (((31 <= y && x <= 69) && 69 <= x) && y <= 31)) || (y <= 23 && (77 <= x && x <= 77) && 23 <= y)) || (x == 4 && y == 4)) || (x == 18 && y == 18)) || (y <= 4 && (x <= 96 && 4 <= y) && 96 <= x)) || (y <= 40 && (40 <= y && x <= 60) && 60 <= x)) || (y == 31 && x == 31)) || (y == 10 && 10 == x)) || ((23 <= y && 23 == x) && y <= 23)) || (1 == x && y == 1)) || (41 == x && y == 41)) || (((6 <= y && 94 <= x) && x <= 94) && y <= 6)) || ((2 <= y && 98 == x) && y <= 2)) || ((93 == x && 7 <= y) && y <= 7)) || (y == 25 && 25 == x)) || (y <= 36 && 64 == x && 36 <= y)) || (y <= 29 && (71 <= x && 29 <= y) && x <= 71)) || (y <= 45 && (45 <= y && x <= 55) && 55 <= x)) || (y == 13 && 13 == x)) || (x == 91 && 9 == y)) || (y <= 21 && (21 <= y && x <= 79) && 79 <= x)) || ((32 <= y && y <= 32) && x == 32)) || (20 == x && y == 20)) || (y <= 33 && (33 <= y && 67 <= x) && x <= 67)) || (x == 42 && y == 42)) || ((47 <= y && y <= 47) && x == 47)) || (y <= 3 && (3 <= y && 97 <= x) && x <= 97)) || ((19 <= y && x == 19) && y <= 19)) || (y <= 5 && (x <= 95 && 5 <= y) && 95 <= x)) || (29 == x && y == 29)) || (x == 6 && y == 6)) || (y <= 15 && (x <= 85 && 85 <= x) && 15 <= y)) || (y <= 16 && 84 == x && 16 <= y)) || (y <= 10 && (10 <= y && 90 <= x) && x <= 90)) || (((x <= 73 && 73 <= x) && 27 <= y) && y <= 27) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 124.1s OverallTime, 46 OverallIterations, 102 TraceHistogramMax, 39.6s AutomataDifference, 0.0s DeadEndRemovalTime, 24.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 892 SDtfs, 1155 SDslu, 51532 SDs, 0 SdLazy, 61433 SolverSat, 1155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8420 GetRequests, 6585 SyntacticMatches, 1 SemanticMatches, 1834 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47983 ImplicationChecksByTransitivity, 50.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 46 MinimizatonAttempts, 2996 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 53 PreInvPairs, 155 NumberOfFragments, 968 HoareAnnotationTreeSize, 53 FomulaSimplifications, 5205950 FormulaSimplificationTreeSizeReduction, 7.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 974811 FormulaSimplificationTreeSizeReductionInter, 16.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 51.7s InterpolantComputationTime, 13576 NumberOfCodeBlocks, 13537 NumberOfCodeBlocksAsserted, 1120 NumberOfCheckSat, 13487 ConstructedInterpolants, 0 QuantifiedInterpolants, 7049017 SizeOfPredicates, 45 NumberOfNonLiveVariables, 15708 ConjunctsInSsa, 1783 ConjunctsInUnsatCore, 89 InterpolantComputations, 3 PerfectInterpolantSequences, 272535/437292 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...