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-acceleration/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:48:55,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:48:55,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:48:55,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:48:55,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:48:55,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:48:55,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:48:55,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:48:55,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:48:55,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:48:55,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:48:55,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:48:55,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:48:55,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:48:55,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:48:55,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:48:55,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:48:55,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:48:55,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:48:55,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:48:55,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:48:55,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:48:55,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:48:55,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:48:55,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:48:55,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:48:55,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:48:55,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:48:55,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:48:55,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:48:55,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:48:55,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:48:55,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:48:55,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:48:55,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:48:55,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:48:55,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:48:55,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:48:55,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:48:55,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:48:55,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:48:55,131 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-08 02:48:55,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:48:55,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:48:55,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:48:55,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:48:55,147 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:48:55,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:48:55,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:48:55,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:48:55,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:48:55,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:48:55,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:48:55,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:48:55,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:48:55,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:48:55,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:48:55,149 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:48:55,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:48:55,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:48:55,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:48:55,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:48:55,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:48:55,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:48:55,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:48:55,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:48:55,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:48:55,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:48:55,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:48:55,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:48:55,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:48:55,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:48:55,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:48:55,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:48:55,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:48:55,196 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:48:55,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-08 02:48:55,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e890651/86639dd033f94d6b9e282432fffc66a9/FLAGc2e423ece [2019-09-08 02:48:55,677 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:48:55,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-08 02:48:55,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e890651/86639dd033f94d6b9e282432fffc66a9/FLAGc2e423ece [2019-09-08 02:48:56,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e890651/86639dd033f94d6b9e282432fffc66a9 [2019-09-08 02:48:56,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:48:56,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:48:56,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:48:56,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:48:56,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:48:56,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d452d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56, skipping insertion in model container [2019-09-08 02:48:56,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,099 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:48:56,118 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:48:56,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:48:56,332 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:48:56,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:48:56,363 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:48:56,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56 WrapperNode [2019-09-08 02:48:56,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:48:56,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:48:56,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:48:56,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:48:56,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (1/1) ... [2019-09-08 02:48:56,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:48:56,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:48:56,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:48:56,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:48:56,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (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-08 02:48:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:48:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:48:56,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:48:56,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:48:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:48:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:48:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:48:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:48:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:48:56,715 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:48:56,715 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:48:56,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:48:56 BoogieIcfgContainer [2019-09-08 02:48:56,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:48:56,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:48:56,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:48:56,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:48:56,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:48:56" (1/3) ... [2019-09-08 02:48:56,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d62b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:48:56, skipping insertion in model container [2019-09-08 02:48:56,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:56" (2/3) ... [2019-09-08 02:48:56,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d62b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:48:56, skipping insertion in model container [2019-09-08 02:48:56,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:48:56" (3/3) ... [2019-09-08 02:48:56,728 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2019-09-08 02:48:56,737 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:48:56,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:48:56,777 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:48:56,805 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:48:56,806 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:48:56,806 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:48:56,807 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:48:56,807 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:48:56,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:48:56,807 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:48:56,807 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:48:56,807 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:48:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-08 02:48:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:48:56,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:56,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:56,831 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-08 02:48:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:56,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:57,040 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-08 02:48:57,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:48:57,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:48:57,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:48:57,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:48:57,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:48:57,063 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-08 02:48:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:57,095 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-08 02:48:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:48:57,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 02:48:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:57,106 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:48:57,106 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 02:48:57,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:48:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 02:48:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 02:48:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 02:48:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-08 02:48:57,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-08 02:48:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:57,148 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-08 02:48:57,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:48:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-08 02:48:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 02:48:57,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:57,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:57,150 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-08 02:48:57,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:57,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:57,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:57,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:57,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:57,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:48:57,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:57,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 02:48:57,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:48:57,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:48:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:48:57,410 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-08 02:48:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:57,437 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-08 02:48:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:48:57,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-08 02:48:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:57,439 INFO L225 Difference]: With dead ends: 18 [2019-09-08 02:48:57,439 INFO L226 Difference]: Without dead ends: 13 [2019-09-08 02:48:57,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:48:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-08 02:48:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-08 02:48:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 02:48:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-08 02:48:57,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-08 02:48:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:57,445 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-08 02:48:57,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:48:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-08 02:48:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:48:57,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:57,447 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:57,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-08 02:48:57,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:57,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:57,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:57,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:57,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:48:57,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:57,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:48:57,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:57,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:48:57,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:57,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:48:57,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:48:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:48:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:48:57,640 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-08 02:48:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:57,678 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-08 02:48:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:48:57,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-08 02:48:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:57,679 INFO L225 Difference]: With dead ends: 19 [2019-09-08 02:48:57,680 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 02:48:57,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:48:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 02:48:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-08 02:48:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-08 02:48:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-08 02:48:57,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-08 02:48:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:57,685 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-08 02:48:57,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:48:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-08 02:48:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:48:57,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:57,686 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:57,686 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:57,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-08 02:48:57,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:57,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:57,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:57,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:48:57,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:48:57,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 02:48:57,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:57,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:48:57,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:57,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:57,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:48:57,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:48:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:48:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:48:57,852 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-08 02:48:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:57,903 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-08 02:48:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:48:57,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-08 02:48:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:57,905 INFO L225 Difference]: With dead ends: 20 [2019-09-08 02:48:57,905 INFO L226 Difference]: Without dead ends: 15 [2019-09-08 02:48:57,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:48:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-08 02:48:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-08 02:48:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 02:48:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 02:48:57,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-08 02:48:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:57,916 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 02:48:57,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:48:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 02:48:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:48:57,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:57,918 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:57,918 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:57,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-08 02:48:57,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:57,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:57,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:57,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:58,084 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-08 02:48:58,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:48:58,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:48:58,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:58,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:48:58,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:58,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:48:58,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:48:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:48:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:48:58,164 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-08 02:48:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:58,216 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-08 02:48:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:48:58,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-08 02:48:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:58,219 INFO L225 Difference]: With dead ends: 21 [2019-09-08 02:48:58,219 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 02:48:58,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:48:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 02:48:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-08 02:48:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-08 02:48:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-08 02:48:58,226 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-08 02:48:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:58,226 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-08 02:48:58,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:48:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-08 02:48:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:48:58,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:58,228 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:58,228 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-08 02:48:58,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:58,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:58,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:58,344 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-08 02:48:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:48:58,380 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 02:48:58,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:58,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 02:48:58,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:58,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:48:58,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:48:58,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:48:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:48:58,415 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-08 02:48:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:58,468 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-08 02:48:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:48:58,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-08 02:48:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:58,470 INFO L225 Difference]: With dead ends: 22 [2019-09-08 02:48:58,470 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 02:48:58,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:48:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 02:48:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 02:48:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:48:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 02:48:58,475 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-08 02:48:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:58,475 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 02:48:58,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:48:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 02:48:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:48:58,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:58,476 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:58,476 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-08 02:48:58,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:58,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:58,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:58,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:58,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:58,595 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-08 02:48:58,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:48:58,627 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 02:48:58,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:58,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:48:58,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:58,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 02:48:58,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:48:58,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:48:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:48:58,660 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-08 02:48:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:58,724 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-08 02:48:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:48:58,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-08 02:48:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:58,725 INFO L225 Difference]: With dead ends: 23 [2019-09-08 02:48:58,725 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:48:58,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:48:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:48:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 02:48:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 02:48:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-08 02:48:58,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-08 02:48:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:58,730 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-08 02:48:58,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:48:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-08 02:48:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:48:58,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:58,731 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:58,732 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-08 02:48:58,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:58,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:58,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:58,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:48:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:58,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:48:58,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:58,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:58,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 02:48:58,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:48:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:48:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:48:58,922 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-08 02:48:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:58,999 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-08 02:48:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:48:59,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-08 02:48:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:59,000 INFO L225 Difference]: With dead ends: 24 [2019-09-08 02:48:59,000 INFO L226 Difference]: Without dead ends: 19 [2019-09-08 02:48:59,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:48:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-08 02:48:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-08 02:48:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 02:48:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 02:48:59,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-08 02:48:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:59,007 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 02:48:59,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:48:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 02:48:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:48:59,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:59,008 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:59,009 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-08 02:48:59,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:59,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:59,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:59,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:59,161 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-08 02:48:59,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:48:59,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:48:59,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:59,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:48:59,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:59,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:59,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 02:48:59,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:48:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:48:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:48:59,231 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-08 02:48:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:59,337 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-08 02:48:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:48:59,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-08 02:48:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:59,338 INFO L225 Difference]: With dead ends: 25 [2019-09-08 02:48:59,339 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 02:48:59,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:48:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 02:48:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 02:48:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 02:48:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-08 02:48:59,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-08 02:48:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:59,344 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-08 02:48:59,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:48:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-08 02:48:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:48:59,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:59,345 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:59,345 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-08 02:48:59,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:59,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:59,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:59,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:59,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:59,496 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) [2019-09-08 02:48:59,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:59,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:48:59,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:59,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:48:59,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:59,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:59,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 02:48:59,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:48:59,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:48:59,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:48:59,594 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-08 02:48:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:59,691 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-08 02:48:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:48:59,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-08 02:48:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:59,692 INFO L225 Difference]: With dead ends: 26 [2019-09-08 02:48:59,692 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 02:48:59,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:48:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 02:48:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 02:48:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 02:48:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-08 02:48:59,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-08 02:48:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:59,697 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-08 02:48:59,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:48:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-08 02:48:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:48:59,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:59,698 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:59,698 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-08 02:48:59,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:59,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:59,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:59,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:59,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:48:59,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:48:59,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:59,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:48:59,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:59,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:59,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:48:59,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:48:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:48:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:48:59,932 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-08 02:49:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:00,033 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-08 02:49:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:49:00,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-08 02:49:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:00,035 INFO L225 Difference]: With dead ends: 27 [2019-09-08 02:49:00,036 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:49:00,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:49:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:49:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 02:49:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:49:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-08 02:49:00,042 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-08 02:49:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:00,043 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-08 02:49:00,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:49:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-08 02:49:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:49:00,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:00,044 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:00,044 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-08 02:49:00,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:00,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:00,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:00,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:00,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:00,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:00,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:49:16,796 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:49:16,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:16,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:49:16,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:16,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:16,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 02:49:16,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:49:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:49:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:49:16,892 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-08 02:49:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:16,979 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-08 02:49:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:49:16,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-08 02:49:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:16,981 INFO L225 Difference]: With dead ends: 28 [2019-09-08 02:49:16,981 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 02:49:16,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:49:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 02:49:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 02:49:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:49:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 02:49:16,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-08 02:49:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:16,986 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 02:49:16,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:49:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 02:49:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:49:16,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:16,987 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:16,987 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-08 02:49:16,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:16,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:17,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:17,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:49:17,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:29,466 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:49:29,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:29,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:49:29,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:29,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:29,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 02:49:29,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:49:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:49:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:49:29,507 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-08 02:49:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:29,648 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-08 02:49:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:49:29,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-08 02:49:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:29,653 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:49:29,653 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 02:49:29,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:49:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 02:49:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-08 02:49:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:49:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-08 02:49:29,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-08 02:49:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:29,660 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-08 02:49:29,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:49:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-08 02:49:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:49:29,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:29,661 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:29,661 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-08 02:49:29,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:29,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:29,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:29,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:29,869 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-08 02:49:29,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:29,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:49:29,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:29,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:29,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 02:49:29,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:49:29,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:49:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:49:29,963 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-08 02:49:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:30,116 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-08 02:49:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:49:30,117 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-08 02:49:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:30,118 INFO L225 Difference]: With dead ends: 30 [2019-09-08 02:49:30,118 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:49:30,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:49:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:49:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-08 02:49:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:49:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 02:49:30,130 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-08 02:49:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:30,131 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 02:49:30,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:49:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 02:49:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:49:30,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:30,133 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:30,133 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:30,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-08 02:49:30,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:30,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:30,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:30,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:30,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:30,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:30,372 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-08 02:49:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:49:30,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:49:30,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:30,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:49:30,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:30,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:30,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 02:49:30,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:49:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:49:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:49:30,463 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-08 02:49:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:30,637 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-08 02:49:30,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:49:30,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-08 02:49:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:30,638 INFO L225 Difference]: With dead ends: 31 [2019-09-08 02:49:30,638 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:49:30,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:49:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:49:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-08 02:49:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:49:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-08 02:49:30,642 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-08 02:49:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:30,643 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-08 02:49:30,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:49:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-08 02:49:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 02:49:30,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:30,644 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:30,644 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-08 02:49:30,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:30,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:30,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:30,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:30,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:30,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:49:32,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-08 02:49:32,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:32,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:49:32,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:32,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:32,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 02:49:32,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:49:32,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:49:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:49:32,545 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-08 02:49:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:32,773 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-08 02:49:32,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:49:32,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-08 02:49:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:32,774 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:49:32,774 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 02:49:32,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:49:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 02:49:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-08 02:49:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:49:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 02:49:32,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-08 02:49:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:32,780 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 02:49:32,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:49:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 02:49:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 02:49:32,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:32,781 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:32,781 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-08 02:49:32,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:32,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:32,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:33,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:33,083 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-08 02:49:33,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:49:33,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:49:33,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:33,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:49:33,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:33,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:33,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 02:49:33,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:49:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:49:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:49:33,149 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-08 02:49:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:33,388 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-08 02:49:33,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:49:33,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-08 02:49:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:33,389 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:49:33,389 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:49:33,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:49:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:49:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 02:49:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 02:49:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-08 02:49:33,398 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-08 02:49:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:33,398 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-08 02:49:33,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:49:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-08 02:49:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:49:33,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:33,401 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:33,401 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-08 02:49:33,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:33,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:33,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:33,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:33,743 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) [2019-09-08 02:49:33,757 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:50:22,690 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-08 02:50:22,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:23,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:50:23,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:23,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:23,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 02:50:23,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:50:23,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:50:23,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:50:23,254 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-08 02:50:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:23,492 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-08 02:50:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:50:23,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-08 02:50:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:23,493 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:50:23,493 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 02:50:23,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:50:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 02:50:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-08 02:50:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:50:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 02:50:23,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-08 02:50:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:23,498 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 02:50:23,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:50:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 02:50:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:50:23,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:23,499 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:23,499 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-08 02:50:23,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:23,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:23,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:23,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:50:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:50:39,043 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-08 02:50:39,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:39,046 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:50:39,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:39,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:39,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 02:50:39,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:50:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:50:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:50:39,090 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-08 02:50:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:39,359 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-08 02:50:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:50:39,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-08 02:50:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:39,360 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:50:39,360 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:50:39,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:50:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:50:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 02:50:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:50:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-08 02:50:39,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-08 02:50:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:39,365 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-08 02:50:39,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:50:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-08 02:50:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:50:39,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:39,365 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:39,366 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-08 02:50:39,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:39,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:39,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:39,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:50:39,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:50:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:39,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:50:39,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:39,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:39,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 02:50:39,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:50:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:50:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:50:39,780 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-08 02:50:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:40,091 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-08 02:50:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:50:40,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-08 02:50:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:40,093 INFO L225 Difference]: With dead ends: 36 [2019-09-08 02:50:40,093 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:50:40,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:50:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:50:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-08 02:50:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:50:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 02:50:40,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-08 02:50:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:40,098 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 02:50:40,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:50:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 02:50:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:50:40,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:40,098 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:40,099 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-08 02:50:40,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:40,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:50:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:40,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:40,488 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-08 02:50:40,528 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-08 02:50:40,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:50:40,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:40,545 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:50:40,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:40,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:40,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:50:40,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:50:40,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:50:40,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:50:40,627 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-08 02:50:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:40,930 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-08 02:50:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:50:40,937 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-08 02:50:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:40,938 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:50:40,938 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:50:40,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:50:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:50:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-08 02:50:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:50:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-08 02:50:40,946 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-08 02:50:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:40,947 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-08 02:50:40,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:50:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-08 02:50:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 02:50:40,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:40,950 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:40,950 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-08 02:50:40,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:40,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:40,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:41,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:41,350 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-08 02:50:41,367 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-08 02:50:59,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-08 02:50:59,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:59,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:50:59,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:59,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:59,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-08 02:50:59,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:50:59,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:50:59,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:50:59,073 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-08 02:50:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:59,423 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-08 02:50:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:50:59,427 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-08 02:50:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:59,428 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:50:59,428 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:50:59,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:50:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:50:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 02:50:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:50:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 02:50:59,432 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-08 02:50:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:59,433 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 02:50:59,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:50:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 02:50:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:50:59,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:59,434 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:59,434 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:59,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:59,434 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-08 02:50:59,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:59,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:59,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:59,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:59,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:59,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:59,797 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-08 02:50:59,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:50:59,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:50:59,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:59,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:50:59,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:59,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:59,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 02:50:59,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:50:59,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:50:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:50:59,873 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-08 02:51:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:51:00,211 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-08 02:51:00,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:51:00,212 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-08 02:51:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:51:00,213 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:51:00,213 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:51:00,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:51:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:51:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-08 02:51:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 02:51:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-08 02:51:00,227 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-08 02:51:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:51:00,228 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-08 02:51:00,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:51:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-08 02:51:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 02:51:00,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:51:00,231 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:51:00,231 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:51:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:51:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-08 02:51:00,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:51:00,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:51:00,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:51:00,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:51:00,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:51:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:51:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:51:00,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:51:00,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:51:00,688 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:53:01,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-08 02:53:01,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:53:01,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:53:01,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:53:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:53:01,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:53:01,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-08 02:53:01,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:53:01,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:53:01,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:53:01,174 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-08 02:53:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:01,563 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-08 02:53:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:53:01,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-08 02:53:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:01,564 INFO L225 Difference]: With dead ends: 40 [2019-09-08 02:53:01,564 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:53:01,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:53:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:53:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-08 02:53:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:53:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-08 02:53:01,570 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-08 02:53:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:01,570 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-08 02:53:01,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:53:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-08 02:53:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 02:53:01,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:53:01,571 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:53:01,571 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:53:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:53:01,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-08 02:53:01,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:53:01,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:53:01,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:01,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:53:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:53:01,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:53:01,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:53:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:54:16,235 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:54:16,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:54:16,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 02:54:16,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:54:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:16,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:54:16,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 02:54:16,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:54:16,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:54:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:54:16,582 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-08 02:54:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:16,991 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-08 02:54:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:54:16,991 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-08 02:54:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:16,992 INFO L225 Difference]: With dead ends: 41 [2019-09-08 02:54:16,992 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 02:54:16,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:54:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 02:54:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-08 02:54:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-08 02:54:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-08 02:54:16,997 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-08 02:54:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:16,998 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-08 02:54:16,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:54:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-08 02:54:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 02:54:16,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:16,999 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:16,999 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:16,999 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-08 02:54:16,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:16,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:17,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:17,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:54:17,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:17,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:54:17,443 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-08 02:54:17,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:17,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 02:54:17,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:54:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:54:17,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:54:17,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-08 02:54:17,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:54:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:54:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:54:17,523 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-08 02:54:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:18,010 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-08 02:54:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:54:18,010 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-08 02:54:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:18,011 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:54:18,011 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 02:54:18,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:54:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 02:54:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-08 02:54:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:54:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-08 02:54:18,015 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-08 02:54:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:18,015 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-08 02:54:18,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:54:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-08 02:54:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:54:18,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:18,016 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:18,017 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-08 02:54:18,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:18,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:54:18,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:54:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:54:18,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:54:18,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:54:18,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:54:18,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:54:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:18,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:54:18,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 02:54:18,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:54:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:54:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:54:18,571 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-08 02:54:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:19,099 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-08 02:54:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:54:19,099 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-08 02:54:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:19,100 INFO L225 Difference]: With dead ends: 43 [2019-09-08 02:54:19,100 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:54:19,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:54:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:54:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-08 02:54:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 02:54:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-08 02:54:19,105 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-08 02:54:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:19,106 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-08 02:54:19,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:54:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-08 02:54:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:54:19,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:19,106 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:19,107 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-08 02:54:19,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:19,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:54:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:19,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:54:19,579 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-08 02:54:19,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:55:31,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-08 02:55:31,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:31,737 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 02:55:31,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:31,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:31,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-08 02:55:31,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:55:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:55:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:55:31,794 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-08 02:55:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:32,340 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-08 02:55:32,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:55:32,341 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-08 02:55:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:32,341 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:55:32,342 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 02:55:32,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:55:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 02:55:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 02:55:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:55:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-08 02:55:32,346 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-08 02:55:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:32,347 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-08 02:55:32,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:55:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-08 02:55:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 02:55:32,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:32,347 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:32,347 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-08 02:55:32,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:32,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:32,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:32,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:32,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:55:32,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:55:32,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:32,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 02:55:32,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:32,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:32,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 02:55:32,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:55:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:55:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:55:32,956 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-08 02:55:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:33,551 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-08 02:55:33,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:55:33,552 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-08 02:55:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:33,553 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:55:33,553 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:55:33,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:55:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:55:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 02:55:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:55:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-08 02:55:33,557 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-08 02:55:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:33,558 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-08 02:55:33,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:55:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-08 02:55:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:55:33,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:33,558 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:33,559 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-08 02:55:33,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:33,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:34,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:34,097 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-08 02:55:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:58:53,783 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-08 02:58:53,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:54,232 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 02:58:54,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:58:54,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:54,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-08 02:58:54,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:58:54,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:58:54,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:58:54,276 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-08 02:58:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:54,900 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-08 02:58:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:58:54,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-08 02:58:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:54,902 INFO L225 Difference]: With dead ends: 46 [2019-09-08 02:58:54,902 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 02:58:54,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:58:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 02:58:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-08 02:58:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:58:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-08 02:58:54,908 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-08 02:58:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:54,908 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-08 02:58:54,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:58:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-08 02:58:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:58:54,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:54,909 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:54,910 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-08 02:58:54,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:54,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:54,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:58:55,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:55,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:58:55,518 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:00:21,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-08 03:00:21,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:22,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 03:00:22,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:22,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:22,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 03:00:22,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 03:00:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 03:00:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:00:22,396 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-08 03:00:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:23,065 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-08 03:00:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 03:00:23,066 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-08 03:00:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:23,067 INFO L225 Difference]: With dead ends: 47 [2019-09-08 03:00:23,067 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 03:00:23,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:00:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 03:00:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-08 03:00:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 03:00:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-08 03:00:23,071 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-08 03:00:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:23,072 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-08 03:00:23,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 03:00:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-08 03:00:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 03:00:23,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:23,073 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:23,073 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-08 03:00:23,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:23,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:23,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:23,739 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:00:23,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:23,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 03:00:23,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:23,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:23,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-08 03:00:23,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 03:00:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 03:00:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:00:23,874 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-08 03:00:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:24,559 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-08 03:00:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 03:00:24,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-08 03:00:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:24,562 INFO L225 Difference]: With dead ends: 48 [2019-09-08 03:00:24,562 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 03:00:24,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:00:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 03:00:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-08 03:00:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 03:00:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-08 03:00:24,566 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-08 03:00:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:24,566 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-08 03:00:24,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 03:00:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-08 03:00:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 03:00:24,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:24,567 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:24,567 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-08 03:00:24,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:24,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:24,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:25,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:25,189 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-08 03:00:25,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:00:25,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:00:25,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:25,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 03:00:25,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:25,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:25,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 03:00:25,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 03:00:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 03:00:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:00:25,283 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-08 03:00:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:26,033 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-08 03:00:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 03:00:26,036 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-08 03:00:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:26,037 INFO L225 Difference]: With dead ends: 49 [2019-09-08 03:00:26,037 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 03:00:26,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:00:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 03:00:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 03:00:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 03:00:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-08 03:00:26,040 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-08 03:00:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:26,041 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-08 03:00:26,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 03:00:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-08 03:00:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 03:00:26,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:26,042 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:26,042 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-08 03:00:26,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:26,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:26,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:26,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:26,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:26,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:26,803 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-08 03:00:26,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:00:59,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-08 03:00:59,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:59,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 03:00:59,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:59,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-08 03:00:59,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 03:00:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 03:00:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:00:59,597 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-08 03:01:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:00,396 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-08 03:01:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 03:01:00,396 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-08 03:01:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:00,397 INFO L225 Difference]: With dead ends: 50 [2019-09-08 03:01:00,397 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 03:01:00,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:01:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 03:01:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-08 03:01:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 03:01:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-08 03:01:00,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-08 03:01:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:00,401 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-08 03:01:00,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 03:01:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-08 03:01:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 03:01:00,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:00,402 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:00,402 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-08 03:01:00,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:00,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:01:01,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:01,111 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-08 03:01:01,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:01:01,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:01:01,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:01,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 03:01:01,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:01:01,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:01,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 03:01:01,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 03:01:01,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 03:01:01,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:01:01,190 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-08 03:01:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:02,004 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-08 03:01:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 03:01:02,005 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-08 03:01:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:02,006 INFO L225 Difference]: With dead ends: 51 [2019-09-08 03:01:02,006 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 03:01:02,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:01:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 03:01:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-08 03:01:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 03:01:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-08 03:01:02,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-08 03:01:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:02,010 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-08 03:01:02,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 03:01:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-08 03:01:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 03:01:02,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:02,011 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:02,011 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-08 03:01:02,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:02,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:01:02,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:02,769 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-08 03:01:02,779 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1