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/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:08:13,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:08:13,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:08:13,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:08:13,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:08:13,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:08:13,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:08:13,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:08:13,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:08:13,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:08:13,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:08:13,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:08:13,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:08:13,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:08:13,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:08:13,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:08:13,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:08:13,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:08:13,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:08:13,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:08:13,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:08:13,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:08:13,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:08:13,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:08:13,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:08:13,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:08:13,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:08:13,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:08:13,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:08:13,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:08:13,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:08:13,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:08:13,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:08:13,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:08:13,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:08:13,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:08:13,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:08:13,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:08:13,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:08:13,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:08:13,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:08:13,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 20:08:13,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:08:13,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:08:13,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:08:13,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:08:13,624 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:08:13,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:08:13,624 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:08:13,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:08:13,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:08:13,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:08:13,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:08:13,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:08:13,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:08:13,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:08:13,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:08:13,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:08:13,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:08:13,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:08:13,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:08:13,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:08:13,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:08:13,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:08:13,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:08:13,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:08:13,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:08:13,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:08:13,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:08:13,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:08:13,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:08:13,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:08:13,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:08:13,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:08:13,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:08:13,685 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:08:13,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-03 20:08:13,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05beda5f/0e0b3b9369d24902bdbcb84aa5fe95ed/FLAGe2c95d8bf [2019-09-03 20:08:14,165 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:08:14,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-03 20:08:14,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05beda5f/0e0b3b9369d24902bdbcb84aa5fe95ed/FLAGe2c95d8bf [2019-09-03 20:08:14,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05beda5f/0e0b3b9369d24902bdbcb84aa5fe95ed [2019-09-03 20:08:14,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:08:14,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:08:14,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:08:14,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:08:14,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:08:14,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b75b578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14, skipping insertion in model container [2019-09-03 20:08:14,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,599 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:08:14,611 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:08:14,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:08:14,778 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:08:14,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:08:14,808 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:08:14,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14 WrapperNode [2019-09-03 20:08:14,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:08:14,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:08:14,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:08:14,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:08:14,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... [2019-09-03 20:08:14,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:08:14,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:08:14,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:08:14,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:08:14,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:08:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:08:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:08:14,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:08:14,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:08:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:08:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:08:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:08:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:08:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:08:15,155 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:08:15,155 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 20:08:15,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:08:15 BoogieIcfgContainer [2019-09-03 20:08:15,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:08:15,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:08:15,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:08:15,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:08:15,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:08:14" (1/3) ... [2019-09-03 20:08:15,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d30d110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:08:15, skipping insertion in model container [2019-09-03 20:08:15,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:08:14" (2/3) ... [2019-09-03 20:08:15,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d30d110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:08:15, skipping insertion in model container [2019-09-03 20:08:15,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:08:15" (3/3) ... [2019-09-03 20:08:15,164 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2019-09-03 20:08:15,173 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:08:15,180 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:08:15,200 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:08:15,228 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:08:15,229 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:08:15,229 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:08:15,229 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:08:15,229 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:08:15,229 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:08:15,229 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:08:15,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:08:15,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:08:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 20:08:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:08:15,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:15,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:15,252 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-03 20:08:15,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:15,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:08:15,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:08:15,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:08:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:08:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:08:15,368 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-03 20:08:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:15,390 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2019-09-03 20:08:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:08:15,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:08:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:15,401 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:08:15,401 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:08:15,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:08:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:08:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:08:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:08:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-03 20:08:15,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-03 20:08:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:15,446 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-03 20:08:15,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:08:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-03 20:08:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:08:15,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:15,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:15,448 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-03 20:08:15,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:15,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:15,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:15,697 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-09-03 20:08:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:15,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:08:15,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:08:15,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:08:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:08:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:08:15,708 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-03 20:08:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:15,742 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-09-03 20:08:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:08:15,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:08:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:15,746 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:08:15,746 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:08:15,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:08:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:08:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-03 20:08:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:08:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-03 20:08:15,764 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-03 20:08:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:15,764 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-03 20:08:15,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:08:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-03 20:08:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:08:15,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:15,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:15,767 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-03 20:08:15,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:15,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:08:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:08:15,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:08:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:08:15,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:08:15,848 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-03 20:08:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:15,871 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-03 20:08:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:08:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-03 20:08:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:15,873 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:08:15,873 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:08:15,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:08:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:08:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-03 20:08:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:08:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-03 20:08:15,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-03 20:08:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:15,881 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-03 20:08:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:08:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-03 20:08:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:08:15,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:15,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:15,883 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-03 20:08:15,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:15,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:15,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:08:15,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:08:15,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:08:15,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:08:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:08:15,957 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-03 20:08:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:15,971 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-09-03 20:08:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:08:15,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 20:08:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:15,973 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:08:15,973 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:08:15,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:08:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:08:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 20:08:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:08:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-03 20:08:15,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-03 20:08:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:15,981 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-03 20:08:15,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:08:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-03 20:08:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:08:15,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:15,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:15,982 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-03 20:08:15,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:16,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:16,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:08:16,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:16,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 20:08:16,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:08:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:08:16,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:08:16,152 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-03 20:08:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:16,189 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2019-09-03 20:08:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:08:16,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 20:08:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:16,191 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:08:16,191 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:08:16,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:08:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:08:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:08:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:08:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-03 20:08:16,198 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-03 20:08:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:16,198 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-03 20:08:16,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:08:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-03 20:08:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:08:16,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:16,199 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:16,200 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-03 20:08:16,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:16,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:16,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:16,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:16,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:16,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:08:16,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:16,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:08:16,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:16,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 20:08:16,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:08:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:08:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:08:16,386 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-03 20:08:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:16,431 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-03 20:08:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:08:16,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 20:08:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:16,433 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:08:16,433 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:08:16,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:08:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:08:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 20:08:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:08:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-03 20:08:16,440 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-03 20:08:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:16,441 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-03 20:08:16,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:08:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-03 20:08:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:08:16,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:16,442 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:16,443 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-03 20:08:16,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:16,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:16,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:08:16,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:08:16,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:16,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:08:16,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 20:08:16,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:08:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:08:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:08:16,639 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-03 20:08:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:16,682 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-09-03 20:08:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:08:16,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-03 20:08:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:16,684 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:08:16,684 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:08:16,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:08:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:08:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 20:08:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:08:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-03 20:08:16,692 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-03 20:08:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:16,692 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-03 20:08:16,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:08:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-03 20:08:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:08:16,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:16,693 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:16,693 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash 877091307, now seen corresponding path program 4 times [2019-09-03 20:08:16,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:16,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:16,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:16,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:16,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:08:16,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:08:16,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:16,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:08:16,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:08:16,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:16,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 20:08:16,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:08:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:08:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:08:16,879 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-09-03 20:08:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:16,934 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-09-03 20:08:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:08:16,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-03 20:08:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:16,936 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:08:16,936 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:08:16,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:08:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:08:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-03 20:08:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:08:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-03 20:08:16,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-03 20:08:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:16,942 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-03 20:08:16,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:08:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-03 20:08:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:08:16,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:16,943 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:16,944 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1447252822, now seen corresponding path program 5 times [2019-09-03 20:08:16,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:16,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:16,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:17,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:08:17,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 20:08:17,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:17,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:08:17,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:17,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 20:08:17,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:08:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:08:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:08:17,118 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2019-09-03 20:08:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:17,187 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-09-03 20:08:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:08:17,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-09-03 20:08:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:17,189 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:08:17,189 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:08:17,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:08:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:08:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 20:08:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:08:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-03 20:08:17,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-09-03 20:08:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:17,203 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-03 20:08:17,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:08:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-03 20:08:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:08:17,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:17,204 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:17,204 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1942390603, now seen corresponding path program 6 times [2019-09-03 20:08:17,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:17,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:17,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:17,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:17,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:17,335 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-09-03 20:08:17,359 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 20:08:17,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:17,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:08:17,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:17,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 20:08:17,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:08:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:08:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:08:17,387 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 10 states. [2019-09-03 20:08:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:17,469 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-09-03 20:08:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:08:17,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-03 20:08:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:17,470 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:08:17,470 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:08:17,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:08:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:08:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 20:08:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:08:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-03 20:08:17,476 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-09-03 20:08:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:17,476 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-03 20:08:17,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:08:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-03 20:08:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:08:17,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:17,477 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:17,478 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:17,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:17,478 INFO L82 PathProgramCache]: Analyzing trace with hash 111792630, now seen corresponding path program 7 times [2019-09-03 20:08:17,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:17,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:17,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:08:17,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 20:08:17,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:08:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:08:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:08:17,698 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-09-03 20:08:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:17,788 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-09-03 20:08:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:08:17,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-09-03 20:08:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:17,790 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:08:17,790 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:08:17,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:08:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:08:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 20:08:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:08:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-03 20:08:17,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-09-03 20:08:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:17,801 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-03 20:08:17,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:08:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-03 20:08:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:08:17,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:17,804 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:17,804 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash -802169685, now seen corresponding path program 8 times [2019-09-03 20:08:17,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:17,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:17,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:17,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:17,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:08:17,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:17,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:08:17,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:18,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:18,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 20:08:18,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:08:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:08:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:08:18,022 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-09-03 20:08:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:18,122 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-03 20:08:18,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:08:18,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 20:08:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:18,125 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:08:18,125 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:08:18,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:08:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:08:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 20:08:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:08:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-03 20:08:18,131 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-03 20:08:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:18,131 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-03 20:08:18,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:08:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-03 20:08:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:08:18,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:18,135 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:18,135 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash 929769622, now seen corresponding path program 9 times [2019-09-03 20:08:18,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:18,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:18,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:18,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:18,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:22,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:08:22,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:22,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:08:22,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:22,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 20:08:22,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:08:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:08:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:08:22,853 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 13 states. [2019-09-03 20:08:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:22,950 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-03 20:08:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:08:22,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-09-03 20:08:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:22,951 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:08:22,952 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:08:22,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:08:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:08:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 20:08:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:08:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-03 20:08:22,964 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2019-09-03 20:08:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:22,965 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-03 20:08:22,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:08:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-03 20:08:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:08:22,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:22,966 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:22,966 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1214686709, now seen corresponding path program 10 times [2019-09-03 20:08:22,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:22,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:22,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:23,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:23,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:23,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:08:23,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:08:23,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:23,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:08:23,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:23,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:23,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 20:08:23,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:08:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:08:23,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:08:23,218 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2019-09-03 20:08:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:23,317 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-09-03 20:08:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:08:23,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-09-03 20:08:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:23,318 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:08:23,319 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:08:23,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:08:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:08:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-03 20:08:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:08:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-03 20:08:23,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-03 20:08:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:23,327 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-03 20:08:23,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:08:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-03 20:08:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:08:23,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:23,331 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:23,332 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1026643766, now seen corresponding path program 11 times [2019-09-03 20:08:23,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:23,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:23,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:23,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:23,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:23,568 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:23,689 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 20:08:23,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:23,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:08:23,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:23,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:23,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 20:08:23,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:08:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:08:23,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:08:23,737 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2019-09-03 20:08:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:23,868 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-09-03 20:08:23,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:08:23,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-09-03 20:08:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:23,870 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:08:23,870 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:08:23,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:08:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:08:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 20:08:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:08:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 20:08:23,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2019-09-03 20:08:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:23,875 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 20:08:23,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:08:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 20:08:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:08:23,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:23,877 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:23,877 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1788411755, now seen corresponding path program 12 times [2019-09-03 20:08:23,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:23,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:24,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:24,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:24,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:24,286 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 20:08:24,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:24,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:08:24,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:24,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:24,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:24,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:24,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:24,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:24,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:24,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 18 [2019-09-03 20:08:24,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:08:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:08:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:08:24,370 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 18 states. [2019-09-03 20:08:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:24,538 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-09-03 20:08:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:08:24,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-03 20:08:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:24,539 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:08:24,539 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:08:24,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:08:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:08:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-03 20:08:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:08:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-03 20:08:24,544 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2019-09-03 20:08:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:24,545 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-03 20:08:24,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:08:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-03 20:08:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:08:24,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:24,546 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:24,546 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash -366584362, now seen corresponding path program 13 times [2019-09-03 20:08:24,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:24,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:24,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:24,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:24,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:24,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:08:24,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:24,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:24,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 20:08:24,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:08:24,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:08:24,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:08:24,866 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 17 states. [2019-09-03 20:08:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:25,058 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-03 20:08:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:08:25,059 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-09-03 20:08:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:25,060 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:08:25,060 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:08:25,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:08:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:08:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 20:08:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:08:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 20:08:25,066 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2019-09-03 20:08:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:25,066 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 20:08:25,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:08:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 20:08:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:08:25,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:25,067 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:25,067 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:25,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1548012747, now seen corresponding path program 14 times [2019-09-03 20:08:25,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:25,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:25,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:25,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:25,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:25,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:08:25,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:08:25,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:25,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:08:25,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:25,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:25,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 20:08:25,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:08:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:08:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:08:25,369 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 18 states. [2019-09-03 20:08:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:25,562 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2019-09-03 20:08:25,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:08:25,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-09-03 20:08:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:25,563 INFO L225 Difference]: With dead ends: 66 [2019-09-03 20:08:25,563 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:08:25,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:08:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:08:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-03 20:08:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:08:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-03 20:08:25,569 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-09-03 20:08:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:25,569 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-03 20:08:25,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:08:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-03 20:08:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:08:25,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:25,570 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:25,571 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 770980982, now seen corresponding path program 15 times [2019-09-03 20:08:25,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:25,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:25,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:25,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:25,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:09:23,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:09:23,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:23,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:09:23,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:23,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:23,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 20:09:23,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:09:23,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:09:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:09:23,754 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 19 states. [2019-09-03 20:09:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:23,966 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-09-03 20:09:23,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:09:23,966 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-09-03 20:09:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:23,967 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:09:23,967 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:09:23,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:09:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:09:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 20:09:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:09:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 20:09:23,973 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2019-09-03 20:09:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:23,973 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 20:09:23,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:09:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 20:09:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:09:23,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:23,974 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:23,974 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1842167253, now seen corresponding path program 16 times [2019-09-03 20:09:23,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:23,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:24,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:09:24,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:09:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:09:24,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:09:24,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:24,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:09:24,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:24,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:24,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 20:09:24,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:09:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:09:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:09:24,285 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2019-09-03 20:09:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:24,499 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-09-03 20:09:24,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:09:24,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-09-03 20:09:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:24,501 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:09:24,501 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:09:24,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:09:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:09:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-03 20:09:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:09:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-03 20:09:24,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2019-09-03 20:09:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:24,508 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-03 20:09:24,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:09:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-03 20:09:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:09:24,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:24,512 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:24,513 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1245383914, now seen corresponding path program 17 times [2019-09-03 20:09:24,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:24,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:24,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:24,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:09:24,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:09:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:10:09,034 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 20:10:09,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:09,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:10:09,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:10:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:09,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 20:10:09,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:10:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:10:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:10:09,885 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 21 states. [2019-09-03 20:10:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:10,154 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2019-09-03 20:10:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:10:10,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-03 20:10:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:10,156 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:10:10,156 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:10:10,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:10:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:10:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 20:10:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:10:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:10:10,162 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2019-09-03 20:10:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:10,162 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:10:10,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:10:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:10:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:10:10,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:10,163 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:10,163 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash 75030411, now seen corresponding path program 18 times [2019-09-03 20:10:10,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:10,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:10,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:10:10,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:10,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:10,488 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:11:00,959 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 20:11:00,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:01,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:11:01,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:01,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:01,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 20:11:01,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:11:01,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:11:01,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:11:01,065 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 22 states. [2019-09-03 20:11:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:01,319 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-03 20:11:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:11:01,320 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-03 20:11:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:01,321 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:11:01,321 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:11:01,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:11:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:11:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-03 20:11:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:11:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 20:11:01,326 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2019-09-03 20:11:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:01,326 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 20:11:01,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:11:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 20:11:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:11:01,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:01,327 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:01,328 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1941798474, now seen corresponding path program 19 times [2019-09-03 20:11:01,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:01,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:01,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:01,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:01,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:11:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:01,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:11:01,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:01,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:01,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 20:11:01,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:11:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:11:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:11:01,703 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 23 states. [2019-09-03 20:11:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:01,991 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-09-03 20:11:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:11:01,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-09-03 20:11:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:01,992 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:11:01,992 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:11:01,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:11:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:11:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 20:11:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:11:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-03 20:11:01,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2019-09-03 20:11:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:01,997 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-03 20:11:01,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:11:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-03 20:11:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:11:01,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:01,998 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:01,998 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash -38984469, now seen corresponding path program 20 times [2019-09-03 20:11:01,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:01,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:01,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:11:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:02,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:02,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-03 20:11:02,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:11:02,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:11:02,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:02,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:11:02,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:02,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 20:11:02,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:11:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:11:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:11:02,434 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2019-09-03 20:11:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:02,728 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2019-09-03 20:11:02,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:11:02,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-03 20:11:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:02,729 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:11:02,730 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:11:02,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:11:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:11:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 20:11:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:11:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-03 20:11:02,734 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2019-09-03 20:11:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:02,734 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-03 20:11:02,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:11:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-03 20:11:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:11:02,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:02,735 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:02,735 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1181292458, now seen corresponding path program 21 times [2019-09-03 20:11:02,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:02,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:02,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:03,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:03,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:12:04,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:12:04,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:12:04,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:12:04,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:12:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:12:04,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:12:04,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 20:12:04,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:12:04,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:12:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:12:04,942 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 25 states. [2019-09-03 20:12:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:12:05,298 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-09-03 20:12:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:12:05,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-09-03 20:12:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:12:05,299 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:12:05,299 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:12:05,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:12:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:12:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 20:12:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:12:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 20:12:05,309 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 33 [2019-09-03 20:12:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:12:05,310 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 20:12:05,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:12:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 20:12:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:12:05,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:12:05,311 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:12:05,311 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:12:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:12:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2061865547, now seen corresponding path program 22 times [2019-09-03 20:12:05,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:12:05,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:12:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:05,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:12:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:12:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:12:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:12:05,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:12:05,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:12:05,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:12:05,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:12:05,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:12:05,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:12:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:12:05,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:12:05,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 20:12:05,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:12:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:12:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:12:05,764 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 26 states. [2019-09-03 20:12:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:12:06,144 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-09-03 20:12:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:12:06,145 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-09-03 20:12:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:12:06,146 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:12:06,146 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:12:06,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:12:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:12:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-03 20:12:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:12:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-03 20:12:06,150 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2019-09-03 20:12:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:12:06,150 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-03 20:12:06,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:12:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-03 20:12:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:12:06,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:12:06,151 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:12:06,151 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:12:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:12:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash -479451402, now seen corresponding path program 23 times [2019-09-03 20:12:06,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:12:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:12:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:06,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:12:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:12:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:12:06,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:12:06,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:12:06,559 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:13:11,453 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 20:13:11,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:13:11,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:13:11,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:13:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:13:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:13:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 20:13:11,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:13:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:13:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:13:11,538 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 27 states. [2019-09-03 20:13:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:13:11,925 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-03 20:13:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:13:11,926 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-09-03 20:13:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:13:11,927 INFO L225 Difference]: With dead ends: 84 [2019-09-03 20:13:11,927 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:13:11,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:13:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:13:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 20:13:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:13:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-03 20:13:11,932 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2019-09-03 20:13:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:13:11,932 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-03 20:13:11,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:13:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-03 20:13:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:13:11,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:13:11,933 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:13:11,933 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:13:11,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:13:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1950865493, now seen corresponding path program 24 times [2019-09-03 20:13:11,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:13:11,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:13:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:13:11,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:13:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:13:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:13:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:13:12,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:13:12,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:13:12,413 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:14:31,193 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 20:14:31,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:14:31,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:14:31,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:14:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:14:31,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:14:31,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 20:14:31,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:14:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:14:31,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:14:31,266 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 28 states. [2019-09-03 20:14:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:14:31,692 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2019-09-03 20:14:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:14:31,692 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-03 20:14:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:14:31,693 INFO L225 Difference]: With dead ends: 86 [2019-09-03 20:14:31,693 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:14:31,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:14:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:14:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 20:14:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:14:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-03 20:14:31,697 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2019-09-03 20:14:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:14:31,697 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-03 20:14:31,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:14:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-03 20:14:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:14:31,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:14:31,698 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:14:31,698 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:14:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:14:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash -320062058, now seen corresponding path program 25 times [2019-09-03 20:14:31,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:14:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:14:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:31,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:14:31,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:14:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:14:32,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:14:32,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:14:32,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:14:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:14:32,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:14:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:14:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:14:32,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:14:32,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 20:14:32,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:14:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:14:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:14:32,197 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 29 states. [2019-09-03 20:14:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:14:32,666 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-09-03 20:14:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:14:32,671 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-09-03 20:14:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:14:32,672 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:14:32,672 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:14:32,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:14:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:14:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 20:14:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:14:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-03 20:14:32,676 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2019-09-03 20:14:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:14:32,677 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-03 20:14:32,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:14:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-03 20:14:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:14:32,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:14:32,677 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:14:32,678 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:14:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:14:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1304763125, now seen corresponding path program 26 times [2019-09-03 20:14:32,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:14:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:14:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:32,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:14:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:14:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:14:33,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:14:33,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:14:33,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:14:33,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:14:33,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:14:33,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:14:33,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:14:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:14:33,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:14:33,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 20:14:33,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:14:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:14:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:14:33,434 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 30 states. [2019-09-03 20:14:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:14:33,958 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-09-03 20:14:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:14:33,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2019-09-03 20:14:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:14:33,960 INFO L225 Difference]: With dead ends: 90 [2019-09-03 20:14:33,960 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:14:33,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:14:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:14:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-03 20:14:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:14:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-03 20:14:33,972 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 38 [2019-09-03 20:14:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:14:33,972 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-03 20:14:33,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:14:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-03 20:14:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:14:33,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:14:33,973 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:14:33,973 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:14:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:14:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1765725130, now seen corresponding path program 27 times [2019-09-03 20:14:33,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:14:33,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:14:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:33,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:14:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:14:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:14:34,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:14:34,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:14:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:16:35,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:16:35,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:35,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:16:35,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:16:35,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:16:35,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 20:16:35,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:16:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:16:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:16:35,171 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 31 states. [2019-09-03 20:16:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:35,662 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2019-09-03 20:16:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:16:35,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-09-03 20:16:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:35,663 INFO L225 Difference]: With dead ends: 92 [2019-09-03 20:16:35,663 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:16:35,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:16:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:16:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 20:16:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:16:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-03 20:16:35,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2019-09-03 20:16:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:35,668 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-03 20:16:35,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:16:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-03 20:16:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:16:35,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:35,669 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:35,669 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1124321899, now seen corresponding path program 28 times [2019-09-03 20:16:35,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:35,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:16:36,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:16:36,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:16:36,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:16:36,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:16:36,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:36,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:16:36,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:16:36,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:16:36,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 20:16:36,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:16:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:16:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:16:36,328 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 32 states. [2019-09-03 20:16:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:36,885 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-09-03 20:16:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:16:36,886 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-09-03 20:16:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:36,887 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:16:36,887 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:16:36,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:16:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:16:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 20:16:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:16:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-03 20:16:36,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2019-09-03 20:16:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:36,891 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-03 20:16:36,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:16:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-03 20:16:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:16:36,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:36,892 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:36,892 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 521466582, now seen corresponding path program 29 times [2019-09-03 20:16:36,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:36,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:16:37,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:16:37,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:16:37,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:18:46,605 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 20:18:46,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:18:48,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:18:48,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:18:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:18:48,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:18:48,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 20:18:48,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:18:48,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:18:48,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:18:48,438 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 33 states. [2019-09-03 20:18:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:18:49,042 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2019-09-03 20:18:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:18:49,047 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-09-03 20:18:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:18:49,047 INFO L225 Difference]: With dead ends: 96 [2019-09-03 20:18:49,048 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:18:49,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:18:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:18:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 20:18:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:18:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-03 20:18:49,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 41 [2019-09-03 20:18:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:18:49,051 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-03 20:18:49,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:18:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-03 20:18:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:18:49,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:18:49,052 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:18:49,052 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:18:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:18:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash -987179061, now seen corresponding path program 30 times [2019-09-03 20:18:49,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:18:49,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:18:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:18:49,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:18:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:18:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:18:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:18:49,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:18:49,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:18:49,643 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:20:35,999 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 20:20:35,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:36,439 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:20:36,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:20:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:20:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 20:20:36,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:20:36,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:20:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:20:36,526 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 34 states. [2019-09-03 20:20:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:37,174 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2019-09-03 20:20:37,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:20:37,175 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-09-03 20:20:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:37,175 INFO L225 Difference]: With dead ends: 98 [2019-09-03 20:20:37,175 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:20:37,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:20:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:20:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-03 20:20:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:20:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-03 20:20:37,180 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 42 [2019-09-03 20:20:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:37,180 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-03 20:20:37,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:20:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-03 20:20:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:20:37,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:37,181 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:37,182 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash -510553738, now seen corresponding path program 31 times [2019-09-03 20:20:37,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:37,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:37,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:37,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:37,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:20:37,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:20:37,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:20:37,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:37,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:20:37,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:20:37,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:20:37,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 20:20:37,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:20:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:20:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:20:37,859 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 35 states. [2019-09-03 20:20:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:38,526 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-09-03 20:20:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:20:38,527 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-09-03 20:20:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:38,527 INFO L225 Difference]: With dead ends: 100 [2019-09-03 20:20:38,527 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:20:38,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:20:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:20:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 20:20:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:20:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-03 20:20:38,531 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2019-09-03 20:20:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:38,532 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-03 20:20:38,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:20:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-03 20:20:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:20:38,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:38,532 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:38,533 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1379929387, now seen corresponding path program 32 times [2019-09-03 20:20:38,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:38,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:38,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:38,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:38,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:20:39,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:20:39,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:20:39,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:20:39,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:20:39,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:39,190 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:20:39,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:20:39,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:20:39,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 20:20:39,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:20:39,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:20:39,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:20:39,233 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 36 states. [2019-09-03 20:20:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:39,929 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2019-09-03 20:20:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:20:39,930 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 44 [2019-09-03 20:20:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:39,931 INFO L225 Difference]: With dead ends: 102 [2019-09-03 20:20:39,931 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:20:39,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:20:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:20:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 20:20:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:20:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-03 20:20:39,934 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2019-09-03 20:20:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:39,935 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-03 20:20:39,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:20:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-03 20:20:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:20:39,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:39,936 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:39,936 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash -144635882, now seen corresponding path program 33 times [2019-09-03 20:20:39,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:39,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:39,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:20:40,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:20:40,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:20:40,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:21:19,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:21:19,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:19,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:21:19,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:21:19,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:21:19,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-03 20:21:19,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:21:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:21:19,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:21:19,936 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 37 states. [2019-09-03 20:21:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:20,682 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2019-09-03 20:21:20,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:21:20,682 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 45 [2019-09-03 20:21:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:20,683 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:21:20,683 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:21:20,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:21:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:21:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 20:21:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:21:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-03 20:21:20,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2019-09-03 20:21:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:20,687 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-03 20:21:20,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:21:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-03 20:21:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:21:20,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:20,688 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:20,688 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash -161518965, now seen corresponding path program 34 times [2019-09-03 20:21:20,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:20,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:20,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:20,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:20,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:21:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:21:21,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:21:21,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:21:21,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:21:21,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:21:21,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:21,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:21:21,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:21:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:21:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 20:21:21,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:21:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:21:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:21:21,756 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 38 states. [2019-09-03 20:21:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:22,501 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-09-03 20:21:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:21:22,501 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2019-09-03 20:21:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:22,502 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:21:22,502 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:21:22,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:21:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:21:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-03 20:21:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:21:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-03 20:21:22,506 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2019-09-03 20:21:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:22,507 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-03 20:21:22,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:21:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-03 20:21:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:21:22,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:22,508 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:22,508 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -684894538, now seen corresponding path program 35 times [2019-09-03 20:21:22,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:22,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:22,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:21:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:21:23,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:21:23,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:21:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1