java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:57:06,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:57:06,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:57:06,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:57:06,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:57:06,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:57:06,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:57:06,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:57:06,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:57:06,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:57:06,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:57:06,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:57:06,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:57:06,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:57:06,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:57:06,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:57:06,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:57:06,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:57:06,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:57:06,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:57:06,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:57:06,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:57:06,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:57:06,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:57:06,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:57:06,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:57:06,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:57:06,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:57:06,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:57:06,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:57:06,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:57:06,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:57:06,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:57:06,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:57:06,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:57:06,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:57:06,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:57:06,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:57:06,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:57:06,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:57:06,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:57:06,162 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-10-01 22:57:06,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:57:06,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:57:06,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:57:06,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:57:06,179 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:57:06,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:57:06,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:57:06,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:57:06,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:57:06,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:57:06,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:57:06,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:57:06,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:57:06,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:57:06,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:57:06,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:57:06,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:57:06,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:57:06,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:57:06,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:57:06,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:57:06,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:06,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:57:06,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:57:06,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:57:06,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:57:06,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:57:06,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:57:06,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:57:06,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:57:06,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:57:06,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:57:06,230 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:57:06,231 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:57:06,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_ground-1.i [2019-10-01 22:57:06,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d256de10/0796516b8694445c91ec78e48e199494/FLAG146440d62 [2019-10-01 22:57:06,806 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:57:06,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_ground-1.i [2019-10-01 22:57:06,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d256de10/0796516b8694445c91ec78e48e199494/FLAG146440d62 [2019-10-01 22:57:07,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d256de10/0796516b8694445c91ec78e48e199494 [2019-10-01 22:57:07,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:57:07,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:57:07,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:07,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:57:07,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:57:07,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409c6ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07, skipping insertion in model container [2019-10-01 22:57:07,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,258 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:57:07,273 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:57:07,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:07,462 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:57:07,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:07,500 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:57:07,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07 WrapperNode [2019-10-01 22:57:07,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:07,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:57:07,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:57:07,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:57:07,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (1/1) ... [2019-10-01 22:57:07,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:57:07,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:57:07,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:57:07,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:57:07,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (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-10-01 22:57:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:57:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:57:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:57:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:57:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:57:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:57:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:57:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:57:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:57:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:57:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:57:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:57:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:57:08,003 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:57:08,003 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-01 22:57:08,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:08 BoogieIcfgContainer [2019-10-01 22:57:08,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:57:08,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:57:08,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:57:08,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:57:08,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:57:07" (1/3) ... [2019-10-01 22:57:08,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9e02d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:08, skipping insertion in model container [2019-10-01 22:57:08,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:07" (2/3) ... [2019-10-01 22:57:08,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9e02d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:08, skipping insertion in model container [2019-10-01 22:57:08,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:08" (3/3) ... [2019-10-01 22:57:08,014 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_ground-1.i [2019-10-01 22:57:08,028 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:57:08,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:57:08,081 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:57:08,112 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:57:08,112 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:57:08,112 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:57:08,113 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:57:08,113 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:57:08,113 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:57:08,113 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:57:08,113 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:57:08,113 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:57:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-01 22:57:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:08,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:08,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:08,138 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2019-10-01 22:57:08,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:08,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:08,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:08,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:57:08,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:57:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:57:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:08,313 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-01 22:57:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:08,340 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2019-10-01 22:57:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:57:08,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-01 22:57:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:08,351 INFO L225 Difference]: With dead ends: 51 [2019-10-01 22:57:08,352 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:57:08,356 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:57:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 22:57:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:57:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-01 22:57:08,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2019-10-01 22:57:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:08,401 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-01 22:57:08,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:57:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-01 22:57:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:08,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:08,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:08,403 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2019-10-01 22:57:08,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:08,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:08,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:08,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:57:08,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:57:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:57:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:08,464 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-10-01 22:57:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:08,512 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:57:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:57:08,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-01 22:57:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:08,514 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:57:08,514 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:57:08,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:57:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-01 22:57:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:57:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-01 22:57:08,524 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-10-01 22:57:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:08,524 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-01 22:57:08,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:57:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-01 22:57:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 22:57:08,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:08,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:08,526 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2019-10-01 22:57:08,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:08,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:08,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:08,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:57:08,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:08,621 INFO L224 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-10-01 22:57:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:08,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:57:08,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:57:08,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:08,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:57:08,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:57:08,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:57:08,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:08,746 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-10-01 22:57:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:08,854 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-10-01 22:57:08,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:57:08,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-01 22:57:08,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:08,858 INFO L225 Difference]: With dead ends: 53 [2019-10-01 22:57:08,858 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:57:08,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:57:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-01 22:57:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:57:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-01 22:57:08,875 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2019-10-01 22:57:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:08,875 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-01 22:57:08,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:57:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-01 22:57:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:57:08,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:08,878 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:08,879 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1868122094, now seen corresponding path program 2 times [2019-10-01 22:57:08,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:08,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:08,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:08,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:57:08,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:08,970 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:08,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:09,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:09,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:09,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:57:09,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 22:57:09,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:09,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:57:09,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:57:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:57:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:09,078 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2019-10-01 22:57:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:09,199 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:57:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:57:09,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-01 22:57:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:09,201 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:57:09,201 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:57:09,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:57:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:57:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:57:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-01 22:57:09,217 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2019-10-01 22:57:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:09,217 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-01 22:57:09,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:57:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-01 22:57:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:57:09,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:09,220 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:09,221 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash 150752210, now seen corresponding path program 3 times [2019-10-01 22:57:09,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:09,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:09,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:57:09,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:09,352 INFO L224 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-10-01 22:57:09,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:09,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:57:09,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:09,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:57:09,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 22:57:09,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:09,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:57:09,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:57:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:57:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:09,458 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2019-10-01 22:57:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:09,542 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-10-01 22:57:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:57:09,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-01 22:57:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:09,544 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:57:09,544 INFO L226 Difference]: Without dead ends: 44 [2019-10-01 22:57:09,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-01 22:57:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-01 22:57:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:57:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-01 22:57:09,552 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2019-10-01 22:57:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:09,553 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-01 22:57:09,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:57:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-01 22:57:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:57:09,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:09,554 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:09,555 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:09,555 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 4 times [2019-10-01 22:57:09,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:09,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-01 22:57:09,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:09,652 INFO L224 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-10-01 22:57:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:09,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:09,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:09,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:57:09,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:57:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:57:09,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:57:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:57:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:09,732 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2019-10-01 22:57:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:09,839 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2019-10-01 22:57:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:57:09,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-10-01 22:57:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:09,841 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:57:09,841 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:57:09,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:57:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:57:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:57:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-10-01 22:57:09,851 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2019-10-01 22:57:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:09,852 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-10-01 22:57:09,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:57:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-10-01 22:57:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:57:09,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:09,855 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:09,856 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1558523702, now seen corresponding path program 5 times [2019-10-01 22:57:09,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:09,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:09,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-01 22:57:10,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:10,005 INFO L224 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-10-01 22:57:10,031 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:10,393 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:57:10,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:10,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:10,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:10,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:10,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:57:10,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:57:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:57:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:10,430 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2019-10-01 22:57:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:10,542 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-01 22:57:10,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:57:10,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-01 22:57:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:10,544 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:57:10,544 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:57:10,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:57:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-10-01 22:57:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:57:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-10-01 22:57:10,560 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2019-10-01 22:57:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:10,562 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-10-01 22:57:10,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:57:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-10-01 22:57:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:57:10,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:10,566 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:10,571 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1349350398, now seen corresponding path program 6 times [2019-10-01 22:57:10,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:10,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 22:57:10,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:10,753 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:11,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:57:11,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:11,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:57:11,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:57:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:11,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:57:11,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:57:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:57:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:11,062 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-10-01 22:57:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:11,184 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-10-01 22:57:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:57:11,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-01 22:57:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:11,187 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:57:11,187 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:57:11,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:57:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-01 22:57:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 22:57:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-10-01 22:57:11,202 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 47 [2019-10-01 22:57:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:11,205 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-10-01 22:57:11,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:57:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-10-01 22:57:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 22:57:11,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:11,206 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:11,207 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1128841790, now seen corresponding path program 7 times [2019-10-01 22:57:11,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:11,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-01 22:57:11,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:11,330 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:11,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:11,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:57:11,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:11,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:11,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:57:11,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:57:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:57:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:11,448 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2019-10-01 22:57:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:11,570 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-10-01 22:57:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:57:11,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-10-01 22:57:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:11,572 INFO L225 Difference]: With dead ends: 107 [2019-10-01 22:57:11,572 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:57:11,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:57:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-10-01 22:57:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 22:57:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-01 22:57:11,592 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2019-10-01 22:57:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:11,593 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-01 22:57:11,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:57:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-01 22:57:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:57:11,597 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:11,597 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:11,597 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -612503046, now seen corresponding path program 8 times [2019-10-01 22:57:11,598 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:11,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:11,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-01 22:57:11,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:11,752 INFO L224 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-10-01 22:57:11,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:11,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:11,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:11,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:57:11,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-01 22:57:11,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:11,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:57:11,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:57:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:57:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:11,850 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2019-10-01 22:57:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:11,965 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-10-01 22:57:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:57:11,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-10-01 22:57:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:11,967 INFO L225 Difference]: With dead ends: 116 [2019-10-01 22:57:11,967 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:57:11,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:57:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:57:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:57:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-01 22:57:11,986 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 57 [2019-10-01 22:57:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:11,986 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-01 22:57:11,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:57:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-01 22:57:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 22:57:11,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:11,991 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:11,991 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -490630470, now seen corresponding path program 9 times [2019-10-01 22:57:11,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:11,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:11,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:57:12,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:12,168 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:12,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:57:12,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:12,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:57:12,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:57:12,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:12,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:57:12,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:57:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:57:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:12,495 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 13 states. [2019-10-01 22:57:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:12,629 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-10-01 22:57:12,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:57:12,631 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-01 22:57:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:12,631 INFO L225 Difference]: With dead ends: 125 [2019-10-01 22:57:12,632 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 22:57:12,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 22:57:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-01 22:57:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:57:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-10-01 22:57:12,640 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2019-10-01 22:57:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:12,640 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-10-01 22:57:12,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:57:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-10-01 22:57:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:57:12,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:12,642 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:12,642 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 10 times [2019-10-01 22:57:12,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:12,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:12,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:12,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:12,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 22:57:12,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:12,769 INFO L224 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-10-01 22:57:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:12,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:12,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:12,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:57:12,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 22:57:12,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:12,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:57:12,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:57:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:57:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:12,878 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 14 states. [2019-10-01 22:57:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:12,995 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-10-01 22:57:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:57:12,995 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-10-01 22:57:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:12,996 INFO L225 Difference]: With dead ends: 134 [2019-10-01 22:57:12,996 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 22:57:12,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 22:57:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-10-01 22:57:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:57:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-10-01 22:57:13,004 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2019-10-01 22:57:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:13,004 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-10-01 22:57:13,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:57:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-10-01 22:57:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:57:13,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:13,006 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:13,006 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2083114930, now seen corresponding path program 11 times [2019-10-01 22:57:13,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:13,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:13,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-10-01 22:57:13,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:13,150 INFO L224 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-10-01 22:57:13,179 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:43,316 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:57:43,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-01 22:57:43,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:57:43,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:57:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:57:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:43,382 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 15 states. [2019-10-01 22:57:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,537 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-10-01 22:57:43,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:57:43,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:57:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,538 INFO L225 Difference]: With dead ends: 143 [2019-10-01 22:57:43,539 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:57:43,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:57:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-01 22:57:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 22:57:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-10-01 22:57:43,554 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 72 [2019-10-01 22:57:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,554 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-10-01 22:57:43,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:57:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-10-01 22:57:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 22:57:43,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,556 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,556 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 385857002, now seen corresponding path program 12 times [2019-10-01 22:57:43,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:57:43,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,713 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:43,734 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:55,699 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:57:55,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:55,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:57:55,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 35 proven. 144 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-01 22:57:55,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:55,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 18 [2019-10-01 22:57:55,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:57:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:57:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:55,797 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 18 states. [2019-10-01 22:57:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:55,960 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2019-10-01 22:57:55,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:57:55,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2019-10-01 22:57:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:55,962 INFO L225 Difference]: With dead ends: 155 [2019-10-01 22:57:55,962 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 22:57:55,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 22:57:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-01 22:57:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-01 22:57:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-10-01 22:57:55,969 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 77 [2019-10-01 22:57:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:55,970 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-10-01 22:57:55,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:57:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-10-01 22:57:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 22:57:55,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:55,972 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:55,972 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash -535424030, now seen corresponding path program 13 times [2019-10-01 22:57:55,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:55,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:55,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:56,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:56,159 INFO L224 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-10-01 22:57:56,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:56,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:57:56,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:56,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:56,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:57:56,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:57:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:57:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:56,258 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 18 states. [2019-10-01 22:57:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:56,480 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2019-10-01 22:57:56,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:57:56,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-10-01 22:57:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:56,481 INFO L225 Difference]: With dead ends: 170 [2019-10-01 22:57:56,481 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:57:56,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:57:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-10-01 22:57:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 22:57:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2019-10-01 22:57:56,487 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 87 [2019-10-01 22:57:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:56,488 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2019-10-01 22:57:56,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:57:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2019-10-01 22:57:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:57:56,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:56,489 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:56,490 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:56,490 INFO L82 PathProgramCache]: Analyzing trace with hash -422313566, now seen corresponding path program 14 times [2019-10-01 22:57:56,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:56,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:56,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:56,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:56,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 22:57:56,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:56,688 INFO L224 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-10-01 22:57:56,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:56,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:56,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:56,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:57:56,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 22:57:56,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:56,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:57:56,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:57:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:57:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:56,806 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 19 states. [2019-10-01 22:57:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:56,961 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2019-10-01 22:57:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:57:56,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:57:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:56,962 INFO L225 Difference]: With dead ends: 179 [2019-10-01 22:57:56,962 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 22:57:56,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 22:57:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-10-01 22:57:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 22:57:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-10-01 22:57:56,969 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 92 [2019-10-01 22:57:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:56,969 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-10-01 22:57:56,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:57:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-10-01 22:57:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:57:56,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:56,971 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:56,971 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1861215782, now seen corresponding path program 15 times [2019-10-01 22:57:56,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:56,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:56,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 22:57:57,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:57,201 INFO L224 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-10-01 22:57:57,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:59,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:57:59,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:59,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:57:59,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 22:57:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:59,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:57:59,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:57:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:57:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:57:59,935 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 20 states. [2019-10-01 22:58:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:00,103 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2019-10-01 22:58:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:58:00,104 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-10-01 22:58:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:00,105 INFO L225 Difference]: With dead ends: 188 [2019-10-01 22:58:00,105 INFO L226 Difference]: Without dead ends: 109 [2019-10-01 22:58:00,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:58:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-01 22:58:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-10-01 22:58:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:58:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-10-01 22:58:00,113 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 97 [2019-10-01 22:58:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:00,113 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-10-01 22:58:00,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:58:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-10-01 22:58:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 22:58:00,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:00,115 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:00,115 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1207301786, now seen corresponding path program 16 times [2019-10-01 22:58:00,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:00,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:00,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:58:00,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:00,336 INFO L224 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-10-01 22:58:00,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:58:00,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:00,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:00,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:58:00,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:58:00,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:00,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:58:00,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:58:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:58:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:00,462 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 21 states. [2019-10-01 22:58:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:00,626 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2019-10-01 22:58:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:58:00,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2019-10-01 22:58:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:00,630 INFO L225 Difference]: With dead ends: 197 [2019-10-01 22:58:00,630 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 22:58:00,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 22:58:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-01 22:58:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:58:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2019-10-01 22:58:00,637 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 102 [2019-10-01 22:58:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:00,637 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2019-10-01 22:58:00,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:58:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2019-10-01 22:58:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 22:58:00,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:00,639 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:00,639 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1112684590, now seen corresponding path program 17 times [2019-10-01 22:58:00,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:00,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-01 22:58:00,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:00,916 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:00,937 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:24,234 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 22:59:24,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:24,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:59:24,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-01 22:59:24,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:24,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:59:24,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:59:24,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:59:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:59:24,348 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 22 states. [2019-10-01 22:59:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:24,551 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2019-10-01 22:59:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:59:24,554 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-10-01 22:59:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:24,555 INFO L225 Difference]: With dead ends: 206 [2019-10-01 22:59:24,555 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 22:59:24,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:59:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 22:59:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-10-01 22:59:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 22:59:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2019-10-01 22:59:24,561 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 107 [2019-10-01 22:59:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:24,561 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2019-10-01 22:59:24,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:59:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2019-10-01 22:59:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-01 22:59:24,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:24,563 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:24,563 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1010160530, now seen corresponding path program 18 times [2019-10-01 22:59:24,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:24,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:24,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:24,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:24,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-10-01 22:59:24,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:24,850 INFO L224 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-10-01 22:59:24,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:00:59,256 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-10-01 23:00:59,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:59,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:00:59,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-01 23:00:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:59,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:00:59,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:00:59,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:00:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:59,335 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 23 states. [2019-10-01 23:00:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:59,561 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2019-10-01 23:00:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:00:59,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 112 [2019-10-01 23:00:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:59,563 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:00:59,563 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:00:59,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:00:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-01 23:00:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-01 23:00:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2019-10-01 23:00:59,569 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 112 [2019-10-01 23:00:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:59,571 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2019-10-01 23:00:59,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:00:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2019-10-01 23:00:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:00:59,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:59,573 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:59,573 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1884348982, now seen corresponding path program 19 times [2019-10-01 23:00:59,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:59,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:59,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 23:00:59,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:59,866 INFO L224 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-10-01 23:00:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:59,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:00:59,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 23:01:00,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:00,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:01:00,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:01:00,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:01:00,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:01:00,020 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 24 states. [2019-10-01 23:01:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:00,231 INFO L93 Difference]: Finished difference Result 224 states and 232 transitions. [2019-10-01 23:01:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:01:00,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2019-10-01 23:01:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:00,234 INFO L225 Difference]: With dead ends: 224 [2019-10-01 23:01:00,234 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:01:00,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:01:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:01:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-10-01 23:01:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 23:01:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2019-10-01 23:01:00,240 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 117 [2019-10-01 23:01:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:00,241 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2019-10-01 23:01:00,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:01:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2019-10-01 23:01:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 23:01:00,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:00,242 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:00,242 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash -326920054, now seen corresponding path program 20 times [2019-10-01 23:01:00,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:00,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:01:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:01:00,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:00,692 INFO L224 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:00,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:01:00,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:01:00,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:00,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:01:00,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:01:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:01:00,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:01:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:01:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:01:00,857 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 25 states. [2019-10-01 23:01:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:01,084 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2019-10-01 23:01:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:01:01,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2019-10-01 23:01:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:01,090 INFO L225 Difference]: With dead ends: 233 [2019-10-01 23:01:01,090 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 23:01:01,091 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:01:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 23:01:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-10-01 23:01:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-01 23:01:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-10-01 23:01:01,098 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 122 [2019-10-01 23:01:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:01,098 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-10-01 23:01:01,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:01:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-10-01 23:01:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-01 23:01:01,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:01,100 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:01,100 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1188305858, now seen corresponding path program 21 times [2019-10-01 23:01:01,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:01,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 23:01:01,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:01,420 INFO L224 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:01,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:01:29,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:01:29,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:29,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:01:29,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 23:01:29,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:29,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:01:29,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:01:29,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:01:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:29,161 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 26 states. [2019-10-01 23:01:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:29,467 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 23:01:29,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:01:29,469 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 127 [2019-10-01 23:01:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:29,469 INFO L225 Difference]: With dead ends: 242 [2019-10-01 23:01:29,469 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 23:01:29,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 23:01:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 23:01:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 23:01:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2019-10-01 23:01:29,476 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 127 [2019-10-01 23:01:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:29,477 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2019-10-01 23:01:29,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:01:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2019-10-01 23:01:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 23:01:29,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:29,478 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:29,478 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1540310402, now seen corresponding path program 22 times [2019-10-01 23:01:29,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:29,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:29,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-01 23:01:30,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:30,009 INFO L224 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-10-01 23:01:30,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:01:30,116 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:01:30,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:30,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:01:30,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-10-01 23:01:30,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:30,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:01:30,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:01:30,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:01:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:01:30,173 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 27 states. [2019-10-01 23:01:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:30,407 INFO L93 Difference]: Finished difference Result 251 states and 259 transitions. [2019-10-01 23:01:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:01:30,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-10-01 23:01:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:30,409 INFO L225 Difference]: With dead ends: 251 [2019-10-01 23:01:30,409 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 23:01:30,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:01:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 23:01:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-10-01 23:01:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 23:01:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-10-01 23:01:30,416 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 132 [2019-10-01 23:01:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:30,416 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-10-01 23:01:30,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:01:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-10-01 23:01:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:01:30,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:30,417 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:30,418 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1193492038, now seen corresponding path program 23 times [2019-10-01 23:01:30,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:30,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:30,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:30,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 23:01:30,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:30,941 INFO L224 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-10-01 23:01:31,006 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:03:55,093 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-10-01 23:03:55,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:55,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:03:55,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-10-01 23:03:55,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:55,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:03:55,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:03:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:03:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:03:55,209 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 28 states. [2019-10-01 23:03:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:55,474 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 23:03:55,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:03:55,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 137 [2019-10-01 23:03:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:55,475 INFO L225 Difference]: With dead ends: 260 [2019-10-01 23:03:55,476 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 23:03:55,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:03:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 23:03:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-10-01 23:03:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 23:03:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2019-10-01 23:03:55,483 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 137 [2019-10-01 23:03:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:55,483 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2019-10-01 23:03:55,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:03:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2019-10-01 23:03:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:03:55,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:55,485 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:55,485 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash -418850182, now seen corresponding path program 24 times [2019-10-01 23:03:55,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:55,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:55,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:55,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:55,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-01 23:03:55,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:55,924 INFO L224 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-10-01 23:03:55,973 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:06:36,217 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-10-01 23:06:36,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:36,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:06:36,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-01 23:06:36,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:36,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:06:36,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:06:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:06:36,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:06:36,356 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 29 states. [2019-10-01 23:06:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:36,665 INFO L93 Difference]: Finished difference Result 269 states and 277 transitions. [2019-10-01 23:06:36,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:06:36,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 142 [2019-10-01 23:06:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:36,667 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:06:36,668 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 23:06:36,670 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:06:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 23:06:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-10-01 23:06:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 23:06:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-10-01 23:06:36,684 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 142 [2019-10-01 23:06:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:36,685 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-10-01 23:06:36,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:06:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-10-01 23:06:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:06:36,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:36,687 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:36,687 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash -779546702, now seen corresponding path program 25 times [2019-10-01 23:06:36,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:36,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:36,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-10-01 23:06:37,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:37,364 INFO L224 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-10-01 23:06:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:37,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:06:37,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-10-01 23:06:37,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:37,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:06:37,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:06:37,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:06:37,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:06:37,521 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 30 states. [2019-10-01 23:06:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:37,857 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2019-10-01 23:06:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:06:37,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-10-01 23:06:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:37,862 INFO L225 Difference]: With dead ends: 278 [2019-10-01 23:06:37,862 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 23:06:37,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:06:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 23:06:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 23:06:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:06:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-10-01 23:06:37,870 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 147 [2019-10-01 23:06:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:37,871 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-10-01 23:06:37,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:06:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-10-01 23:06:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 23:06:37,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:37,873 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:37,873 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash -987736206, now seen corresponding path program 26 times [2019-10-01 23:06:37,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:37,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:37,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-10-01 23:06:38,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:38,359 INFO L224 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-10-01 23:06:38,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:06:38,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:06:38,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:38,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:06:38,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-10-01 23:06:38,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:38,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:06:38,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:06:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:06:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:06:38,582 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 31 states. [2019-10-01 23:06:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:38,908 INFO L93 Difference]: Finished difference Result 287 states and 295 transitions. [2019-10-01 23:06:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:06:38,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 152 [2019-10-01 23:06:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:38,910 INFO L225 Difference]: With dead ends: 287 [2019-10-01 23:06:38,910 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 23:06:38,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:06:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 23:06:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-01 23:06:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 23:06:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 165 transitions. [2019-10-01 23:06:38,917 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 165 transitions. Word has length 152 [2019-10-01 23:06:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:38,918 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 165 transitions. [2019-10-01 23:06:38,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:06:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2019-10-01 23:06:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 23:06:38,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:38,919 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:38,919 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash 312018346, now seen corresponding path program 27 times [2019-10-01 23:06:38,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:38,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:38,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2019-10-01 23:06:39,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:39,509 INFO L224 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-10-01 23:06:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:34,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:07:34,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:34,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:07:34,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2019-10-01 23:07:34,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:34,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:07:34,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:07:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:07:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:07:34,684 INFO L87 Difference]: Start difference. First operand 162 states and 165 transitions. Second operand 32 states. [2019-10-01 23:07:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:35,012 INFO L93 Difference]: Finished difference Result 296 states and 304 transitions. [2019-10-01 23:07:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:07:35,012 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2019-10-01 23:07:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:35,013 INFO L225 Difference]: With dead ends: 296 [2019-10-01 23:07:35,013 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:07:35,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:07:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:07:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-10-01 23:07:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 23:07:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-10-01 23:07:35,022 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 157 [2019-10-01 23:07:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:35,022 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-10-01 23:07:35,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:07:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-10-01 23:07:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:07:35,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:35,023 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:35,024 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2029667222, now seen corresponding path program 28 times [2019-10-01 23:07:35,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:35,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:35,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-10-01 23:07:35,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:35,486 INFO L224 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-10-01 23:07:35,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:35,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:35,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:35,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:07:35,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-10-01 23:07:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:35,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:07:35,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:07:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:07:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:07:35,676 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 33 states. [2019-10-01 23:07:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:36,013 INFO L93 Difference]: Finished difference Result 305 states and 313 transitions. [2019-10-01 23:07:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:07:36,013 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 162 [2019-10-01 23:07:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:36,014 INFO L225 Difference]: With dead ends: 305 [2019-10-01 23:07:36,014 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 23:07:36,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:07:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 23:07:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-01 23:07:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 23:07:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2019-10-01 23:07:36,023 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 162 [2019-10-01 23:07:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:36,023 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2019-10-01 23:07:36,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:07:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2019-10-01 23:07:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 23:07:36,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:36,025 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:36,025 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash 332178338, now seen corresponding path program 29 times [2019-10-01 23:07:36,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:36,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:36,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:36,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:36,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 23:07:36,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:36,524 INFO L224 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-10-01 23:07:36,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:10:48,206 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-10-01 23:10:48,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:48,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:10:48,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2019-10-01 23:10:48,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:48,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:10:48,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:10:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:10:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:10:48,378 INFO L87 Difference]: Start difference. First operand 172 states and 175 transitions. Second operand 34 states. [2019-10-01 23:10:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:48,652 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 23:10:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:10:48,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 167 [2019-10-01 23:10:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:48,654 INFO L225 Difference]: With dead ends: 314 [2019-10-01 23:10:48,654 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 23:10:48,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:10:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 23:10:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 23:10:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 23:10:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2019-10-01 23:10:48,661 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 167 [2019-10-01 23:10:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:48,661 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2019-10-01 23:10:48,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:10:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2019-10-01 23:10:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 23:10:48,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:48,663 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:48,663 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1750529694, now seen corresponding path program 30 times [2019-10-01 23:10:48,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:48,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:48,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:48,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2019-10-01 23:10:49,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:49,160 INFO L224 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-10-01 23:10:49,202 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE