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/Mono4_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:04:30,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:04:30,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:04:30,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:04:30,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:04:30,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:04:30,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:04:30,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:04:30,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:04:30,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:04:30,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:04:30,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:04:30,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:04:30,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:04:30,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:04:30,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:04:30,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:04:30,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:04:30,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:04:30,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:04:30,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:04:30,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:04:30,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:04:30,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:04:30,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:04:30,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:04:30,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:04:30,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:04:30,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:04:30,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:04:30,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:04:30,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:04:30,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:04:30,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:04:30,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:04:30,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:04:30,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:04:30,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:04:30,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:04:30,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:04:30,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:04:30,446 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:04:30,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:04:30,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:04:30,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:04:30,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:04:30,479 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:04:30,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:04:30,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:04:30,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:04:30,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:04:30,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:04:30,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:04:30,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:04:30,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:04:30,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:04:30,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:04:30,481 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:04:30,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:04:30,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:04:30,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:04:30,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:04:30,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:04:30,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:04:30,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:04:30,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:04:30,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:04:30,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:04:30,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:04:30,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:04:30,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:04:30,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:04:30,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:04:30,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:04:30,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:04:30,528 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:04:30,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono4_1.c [2019-09-03 20:04:30,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7e980b9/332d1f26f7454f2a84440facec503442/FLAGb01fbe6d3 [2019-09-03 20:04:31,023 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:04:31,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono4_1.c [2019-09-03 20:04:31,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7e980b9/332d1f26f7454f2a84440facec503442/FLAGb01fbe6d3 [2019-09-03 20:04:31,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7e980b9/332d1f26f7454f2a84440facec503442 [2019-09-03 20:04:31,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:04:31,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:04:31,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:04:31,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:04:31,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:04:31,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6b4f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31, skipping insertion in model container [2019-09-03 20:04:31,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:04:31,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:04:31,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:04:31,647 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:04:31,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:04:31,670 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:04:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31 WrapperNode [2019-09-03 20:04:31,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:04:31,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:04:31,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:04:31,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:04:31,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (1/1) ... [2019-09-03 20:04:31,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:04:31,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:04:31,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:04:31,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:04:31,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (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:04:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:04:31,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:04:31,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:04:31,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:04:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:04:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:04:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:04:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:04:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:04:31,986 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:04:31,986 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:04:31,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:04:31 BoogieIcfgContainer [2019-09-03 20:04:31,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:04:31,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:04:31,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:04:31,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:04:31,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:04:31" (1/3) ... [2019-09-03 20:04:31,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7755cb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:04:31, skipping insertion in model container [2019-09-03 20:04:31,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:04:31" (2/3) ... [2019-09-03 20:04:31,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7755cb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:04:31, skipping insertion in model container [2019-09-03 20:04:31,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:04:31" (3/3) ... [2019-09-03 20:04:31,995 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono4_1.c [2019-09-03 20:04:32,005 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:04:32,014 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:04:32,030 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:04:32,059 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:04:32,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:04:32,060 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:04:32,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:04:32,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:04:32,060 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:04:32,061 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:04:32,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:04:32,061 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:04:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:04:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:04:32,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:32,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:32,085 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:32,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:32,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-09-03 20:04:32,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:32,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:32,182 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:04:32,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:04:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:04:32,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:04:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:04:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:04:32,201 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 20:04:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:32,219 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-03 20:04:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:04:32,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:04:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:32,226 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:04:32,227 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:04:32,229 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:04:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:04:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:04:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:04:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 20:04:32,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 20:04:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:32,264 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 20:04:32,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:04:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 20:04:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:04:32,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:32,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:32,265 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-03 20:04:32,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:32,322 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:04:32,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:04:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:04:32,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:04:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:04:32,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:04:32,325 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 20:04:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:32,372 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-09-03 20:04:32,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:04:32,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:04:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:32,375 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:04:32,375 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:04:32,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:04:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:04:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:04:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:04:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 20:04:32,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 20:04:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:32,386 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 20:04:32,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:04:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 20:04:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:04:32,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:32,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:32,390 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-09-03 20:04:32,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:32,438 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:04:32,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:32,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:32,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:32,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:04:32,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:32,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:04:32,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-03 20:04:32,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:04:32,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:04:32,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:04:32,533 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-03 20:04:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:32,578 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-09-03 20:04:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:04:32,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:04:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:32,581 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:04:32,581 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:04:32,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:04:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:04:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 20:04:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:04:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:04:32,588 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 20:04:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:32,588 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:04:32,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:04:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:04:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:04:32,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:32,590 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:32,590 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 1 times [2019-09-03 20:04:32,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:04:32,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:32,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:32,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:04:32,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:32,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:32,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-03 20:04:32,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:04:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:04:32,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:04:32,802 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-09-03 20:04:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:32,959 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-03 20:04:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:04:32,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 20:04:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:32,961 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:04:32,961 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:04:32,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:04:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:04:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-03 20:04:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:04:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-03 20:04:32,974 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-03 20:04:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:32,975 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-03 20:04:32,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:04:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-03 20:04:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:04:32,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:32,977 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:32,978 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1126739492, now seen corresponding path program 2 times [2019-09-03 20:04:32,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:32,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:32,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:04:33,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:33,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:33,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:33,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:33,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:33,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:04:33,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:04:33,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:33,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-03 20:04:33,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:04:33,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:04:33,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:04:33,201 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 12 states. [2019-09-03 20:04:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:33,371 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-09-03 20:04:33,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:04:33,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 20:04:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:33,372 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:04:33,372 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:04:33,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:04:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:04:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-03 20:04:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:04:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-03 20:04:33,380 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-09-03 20:04:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:33,380 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-03 20:04:33,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:04:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-03 20:04:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:04:33,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:33,381 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:33,382 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:33,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash 92956828, now seen corresponding path program 3 times [2019-09-03 20:04:33,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:33,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 20:04:33,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:33,478 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:04:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:33,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:04:33,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:33,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:04:33,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:33,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 20:04:33,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:33,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-09-03 20:04:33,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:04:33,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:04:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:04:33,579 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2019-09-03 20:04:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:33,634 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-03 20:04:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:04:33,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-09-03 20:04:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:33,635 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:04:33,635 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:04:33,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:04:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:04:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-09-03 20:04:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:04:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-03 20:04:33,651 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2019-09-03 20:04:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:33,652 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-03 20:04:33,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:04:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-03 20:04:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:04:33,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:33,653 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:33,654 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash 240236183, now seen corresponding path program 4 times [2019-09-03 20:04:33,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:33,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:33,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 20:04:33,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:33,799 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) [2019-09-03 20:04:33,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:33,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:33,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:33,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:04:33,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:04:33,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:33,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-09-03 20:04:33,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:04:33,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:04:33,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:04:33,920 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 15 states. [2019-09-03 20:04:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:34,051 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-09-03 20:04:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:04:34,051 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-03 20:04:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:34,052 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:04:34,052 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:04:34,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:04:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:04:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-09-03 20:04:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:04:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-03 20:04:34,059 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 26 [2019-09-03 20:04:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:34,060 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-03 20:04:34,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:04:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-03 20:04:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:04:34,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:34,062 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:34,062 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash -679244145, now seen corresponding path program 5 times [2019-09-03 20:04:34,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:34,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:34,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:04:34,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:34,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:34,213 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:34,232 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-03 20:04:34,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:34,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:04:34,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:04:34,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:34,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-03 20:04:34,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:04:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:04:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:04:34,334 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 17 states. [2019-09-03 20:04:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:34,521 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-09-03 20:04:34,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:04:34,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-09-03 20:04:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:34,523 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:04:34,523 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:04:34,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:04:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:04:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-09-03 20:04:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:04:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-09-03 20:04:34,537 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 30 [2019-09-03 20:04:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:34,538 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-09-03 20:04:34,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:04:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-09-03 20:04:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:04:34,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:34,540 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:34,540 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1114070521, now seen corresponding path program 6 times [2019-09-03 20:04:34,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:34,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:34,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:34,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-03 20:04:34,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:34,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:34,731 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-03 20:04:34,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:34,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:04:34,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:04:34,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:34,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-03 20:04:34,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:04:34,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:04:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:04:34,845 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2019-09-03 20:04:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:35,397 INFO L93 Difference]: Finished difference Result 99 states and 146 transitions. [2019-09-03 20:04:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:04:35,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-09-03 20:04:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:35,401 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:04:35,401 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:04:35,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=665, Invalid=1497, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:04:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:04:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 37. [2019-09-03 20:04:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:04:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-09-03 20:04:35,411 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 34 [2019-09-03 20:04:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:35,412 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-09-03 20:04:35,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:04:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-09-03 20:04:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:04:35,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:35,413 INFO L399 BasicCegarLoop]: trace histogram [13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:35,414 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:35,414 INFO L82 PathProgramCache]: Analyzing trace with hash -71876286, now seen corresponding path program 7 times [2019-09-03 20:04:35,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:35,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:35,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-03 20:04:35,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:35,546 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:04:35,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:35,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:04:35,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:04:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:35,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-09-03 20:04:35,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:04:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:04:35,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:04:35,719 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 20 states. [2019-09-03 20:04:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:35,884 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-09-03 20:04:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:04:35,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-09-03 20:04:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:35,886 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:04:35,886 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:04:35,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:04:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:04:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 41. [2019-09-03 20:04:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:04:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-03 20:04:35,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 36 [2019-09-03 20:04:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:35,906 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-03 20:04:35,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:04:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-03 20:04:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:04:35,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:35,908 INFO L399 BasicCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:35,909 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -493481414, now seen corresponding path program 8 times [2019-09-03 20:04:35,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:35,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:35,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 20:04:36,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:36,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:36,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:36,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:36,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:36,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:04:36,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:04:36,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:36,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2019-09-03 20:04:36,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:04:36,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:04:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:04:36,186 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 22 states. [2019-09-03 20:04:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:36,385 INFO L93 Difference]: Finished difference Result 137 states and 189 transitions. [2019-09-03 20:04:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:04:36,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-03 20:04:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:36,386 INFO L225 Difference]: With dead ends: 137 [2019-09-03 20:04:36,387 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:04:36,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:04:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:04:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 45. [2019-09-03 20:04:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:04:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-09-03 20:04:36,397 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 40 [2019-09-03 20:04:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:36,397 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-09-03 20:04:36,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:04:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-09-03 20:04:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:04:36,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:36,398 INFO L399 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:36,399 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:36,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1069809998, now seen corresponding path program 9 times [2019-09-03 20:04:36,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:36,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:36,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:36,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:36,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 20:04:36,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:36,509 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:04:36,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:36,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:04:36,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:36,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:04:36,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:04:36,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:36,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-03 20:04:36,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:04:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:04:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:04:36,684 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 24 states. [2019-09-03 20:04:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:36,902 INFO L93 Difference]: Finished difference Result 143 states and 197 transitions. [2019-09-03 20:04:36,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:04:36,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-09-03 20:04:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:36,904 INFO L225 Difference]: With dead ends: 143 [2019-09-03 20:04:36,904 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:04:36,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:04:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:04:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 49. [2019-09-03 20:04:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:04:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-09-03 20:04:36,914 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 44 [2019-09-03 20:04:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:36,914 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-09-03 20:04:36,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:04:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-09-03 20:04:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:04:36,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:36,916 INFO L399 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:36,916 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1006069418, now seen corresponding path program 10 times [2019-09-03 20:04:36,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:36,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:36,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:36,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-03 20:04:37,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:37,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:37,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:37,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:37,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:37,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:04:37,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:04:37,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:37,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2019-09-03 20:04:37,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:04:37,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:04:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:04:37,308 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 26 states. [2019-09-03 20:04:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:37,517 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. [2019-09-03 20:04:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:04:37,517 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-03 20:04:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:37,519 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:04:37,519 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 20:04:37,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=387, Invalid=1019, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:04:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 20:04:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 53. [2019-09-03 20:04:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:04:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-09-03 20:04:37,531 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 48 [2019-09-03 20:04:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:37,531 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-09-03 20:04:37,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:04:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-09-03 20:04:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:04:37,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:37,533 INFO L399 BasicCegarLoop]: trace histogram [21, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:37,533 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1029614114, now seen corresponding path program 11 times [2019-09-03 20:04:37,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:37,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:37,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 20:04:37,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:37,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:37,695 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:37,723 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 20:04:37,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:37,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:04:37,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 110 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:04:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2019-09-03 20:04:37,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:04:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:04:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:04:37,955 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 28 states. [2019-09-03 20:04:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:38,225 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2019-09-03 20:04:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:04:38,225 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-09-03 20:04:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:38,227 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:04:38,227 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 20:04:38,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:04:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 20:04:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 57. [2019-09-03 20:04:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:04:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-09-03 20:04:38,242 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 52 [2019-09-03 20:04:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:38,245 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-09-03 20:04:38,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:04:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-09-03 20:04:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:04:38,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:38,248 INFO L399 BasicCegarLoop]: trace histogram [23, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:38,248 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:38,248 INFO L82 PathProgramCache]: Analyzing trace with hash -900716262, now seen corresponding path program 12 times [2019-09-03 20:04:38,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:38,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:38,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:38,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:38,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 20:04:38,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:38,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:38,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:38,478 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-03 20:04:38,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:38,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:04:38,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 275 proven. 144 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 20:04:38,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:38,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-09-03 20:04:38,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:04:38,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:04:38,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:04:38,706 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 31 states. [2019-09-03 20:04:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:41,039 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2019-09-03 20:04:41,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 20:04:41,040 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-09-03 20:04:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:41,042 INFO L225 Difference]: With dead ends: 247 [2019-09-03 20:04:41,043 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 20:04:41,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5925 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4765, Invalid=9997, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:04:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 20:04:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 59. [2019-09-03 20:04:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:04:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-09-03 20:04:41,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 56 [2019-09-03 20:04:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:41,070 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-09-03 20:04:41,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:04:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-09-03 20:04:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:04:41,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:41,071 INFO L399 BasicCegarLoop]: trace histogram [24, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:41,071 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1196863595, now seen corresponding path program 13 times [2019-09-03 20:04:41,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:41,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:41,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 20:04:41,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:41,275 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:04:41,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:41,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:04:41,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 132 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:04:41,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:41,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2019-09-03 20:04:41,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:04:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:04:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:04:41,482 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 31 states. [2019-09-03 20:04:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:41,825 INFO L93 Difference]: Finished difference Result 305 states and 437 transitions. [2019-09-03 20:04:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:04:41,825 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-09-03 20:04:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:41,827 INFO L225 Difference]: With dead ends: 305 [2019-09-03 20:04:41,827 INFO L226 Difference]: Without dead ends: 270 [2019-09-03 20:04:41,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=560, Invalid=1420, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:04:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-03 20:04:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 63. [2019-09-03 20:04:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:04:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-09-03 20:04:41,847 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 58 [2019-09-03 20:04:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:41,848 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-09-03 20:04:41,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:04:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-09-03 20:04:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:04:41,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:41,849 INFO L399 BasicCegarLoop]: trace histogram [26, 14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:41,849 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash 858696717, now seen corresponding path program 14 times [2019-09-03 20:04:41,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:41,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:41,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 520 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-03 20:04:42,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:42,026 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:04:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:42,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:42,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:42,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:04:42,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 156 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:04:42,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:42,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 33 [2019-09-03 20:04:42,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:04:42,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:04:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:04:42,247 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 33 states. [2019-09-03 20:04:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:42,649 INFO L93 Difference]: Finished difference Result 309 states and 442 transitions. [2019-09-03 20:04:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:04:42,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-09-03 20:04:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:42,656 INFO L225 Difference]: With dead ends: 309 [2019-09-03 20:04:42,656 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 20:04:42,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=644, Invalid=1612, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:04:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 20:04:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 67. [2019-09-03 20:04:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:04:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-09-03 20:04:42,679 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 62 [2019-09-03 20:04:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:42,680 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-09-03 20:04:42,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:04:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-09-03 20:04:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:04:42,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:42,681 INFO L399 BasicCegarLoop]: trace histogram [28, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:42,681 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1946016763, now seen corresponding path program 15 times [2019-09-03 20:04:42,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:42,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:42,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:42,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:42,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 20:04:42,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:42,852 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:04:42,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:42,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 20:04:42,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:42,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:04:42,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 182 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:04:43,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2019-09-03 20:04:43,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:04:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:04:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:04:43,128 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 35 states. [2019-09-03 20:04:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:43,591 INFO L93 Difference]: Finished difference Result 315 states and 450 transitions. [2019-09-03 20:04:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:04:43,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-09-03 20:04:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:43,594 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:04:43,594 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 20:04:43,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=734, Invalid=1816, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:04:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 20:04:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 71. [2019-09-03 20:04:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:04:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-09-03 20:04:43,621 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 66 [2019-09-03 20:04:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:43,622 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-09-03 20:04:43,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:04:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-09-03 20:04:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:04:43,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:43,623 INFO L399 BasicCegarLoop]: trace histogram [30, 16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:43,623 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:43,623 INFO L82 PathProgramCache]: Analyzing trace with hash 63051645, now seen corresponding path program 16 times [2019-09-03 20:04:43,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:43,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:43,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:43,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:04:43,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:43,819 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:04:43,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:43,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:43,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:43,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:04:43,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 210 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:04:44,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:44,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2019-09-03 20:04:44,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:04:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:04:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:04:44,070 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 37 states. [2019-09-03 20:04:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:44,537 INFO L93 Difference]: Finished difference Result 321 states and 458 transitions. [2019-09-03 20:04:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:04:44,537 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-09-03 20:04:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:44,539 INFO L225 Difference]: With dead ends: 321 [2019-09-03 20:04:44,539 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 20:04:44,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=830, Invalid=2032, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:04:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 20:04:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 75. [2019-09-03 20:04:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:04:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-09-03 20:04:44,571 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 70 [2019-09-03 20:04:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:44,572 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-09-03 20:04:44,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:04:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-09-03 20:04:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:04:44,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:44,573 INFO L399 BasicCegarLoop]: trace histogram [32, 17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:44,573 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -11213195, now seen corresponding path program 17 times [2019-09-03 20:04:44,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:44,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:44,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:44,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-03 20:04:44,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:44,802 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:04:44,813 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:44,846 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-09-03 20:04:44,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:44,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:04:44,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 240 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:04:45,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:45,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2019-09-03 20:04:45,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:04:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:04:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:04:45,101 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 39 states. [2019-09-03 20:04:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:45,672 INFO L93 Difference]: Finished difference Result 327 states and 466 transitions. [2019-09-03 20:04:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:04:45,672 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-09-03 20:04:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:45,674 INFO L225 Difference]: With dead ends: 327 [2019-09-03 20:04:45,674 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 20:04:45,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=932, Invalid=2260, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:04:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 20:04:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 79. [2019-09-03 20:04:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:04:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2019-09-03 20:04:45,719 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 74 [2019-09-03 20:04:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:45,719 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2019-09-03 20:04:45,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:04:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2019-09-03 20:04:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:04:45,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:45,720 INFO L399 BasicCegarLoop]: trace histogram [34, 18, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:45,720 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash -437718803, now seen corresponding path program 18 times [2019-09-03 20:04:45,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:45,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:45,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:45,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:45,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-03 20:04:45,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:45,930 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:04:45,941 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:46,002 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-03 20:04:46,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:46,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:04:46,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 272 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:04:46,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:46,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2019-09-03 20:04:46,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:04:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:04:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1254, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:04:46,277 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 41 states. [2019-09-03 20:04:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:46,858 INFO L93 Difference]: Finished difference Result 333 states and 474 transitions. [2019-09-03 20:04:46,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:04:46,858 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-09-03 20:04:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:46,860 INFO L225 Difference]: With dead ends: 333 [2019-09-03 20:04:46,860 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 20:04:46,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1040, Invalid=2500, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:04:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 20:04:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 83. [2019-09-03 20:04:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:04:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-09-03 20:04:46,902 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 78 [2019-09-03 20:04:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:46,902 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-09-03 20:04:46,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:04:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2019-09-03 20:04:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:04:46,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:46,903 INFO L399 BasicCegarLoop]: trace histogram [36, 19, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:46,904 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2129958629, now seen corresponding path program 19 times [2019-09-03 20:04:46,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:46,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 20:04:47,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:47,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:47,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:47,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:04:47,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 306 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 20:04:47,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:47,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2019-09-03 20:04:47,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:04:47,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:04:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1380, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:04:47,518 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 43 states. [2019-09-03 20:04:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:48,342 INFO L93 Difference]: Finished difference Result 339 states and 482 transitions. [2019-09-03 20:04:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:04:48,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-09-03 20:04:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:48,348 INFO L225 Difference]: With dead ends: 339 [2019-09-03 20:04:48,348 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 20:04:48,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1154, Invalid=2752, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:04:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 20:04:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 87. [2019-09-03 20:04:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:04:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2019-09-03 20:04:48,413 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 82 [2019-09-03 20:04:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:48,413 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2019-09-03 20:04:48,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:04:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2019-09-03 20:04:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 20:04:48,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:48,415 INFO L399 BasicCegarLoop]: trace histogram [38, 20, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:48,415 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash -801752995, now seen corresponding path program 20 times [2019-09-03 20:04:48,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:48,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1102 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-03 20:04:48,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:48,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:48,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:48,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:48,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:04:48,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 20:04:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:49,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 45 [2019-09-03 20:04:49,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:04:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:04:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:04:49,329 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand 45 states. [2019-09-03 20:04:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:49,990 INFO L93 Difference]: Finished difference Result 345 states and 490 transitions. [2019-09-03 20:04:49,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:04:49,990 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-09-03 20:04:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:49,992 INFO L225 Difference]: With dead ends: 345 [2019-09-03 20:04:49,992 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 20:04:49,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1274, Invalid=3016, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:04:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 20:04:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 91. [2019-09-03 20:04:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:04:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-09-03 20:04:50,039 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 86 [2019-09-03 20:04:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:50,039 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-09-03 20:04:50,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:04:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-09-03 20:04:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 20:04:50,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:50,040 INFO L399 BasicCegarLoop]: trace histogram [40, 21, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:50,040 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2075407701, now seen corresponding path program 21 times [2019-09-03 20:04:50,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:50,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:50,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1220 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 20:04:50,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:50,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 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:04:50,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:50,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-03 20:04:50,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:50,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:04:50,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 380 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:04:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2019-09-03 20:04:51,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:04:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:04:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:04:51,062 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 47 states. [2019-09-03 20:04:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:51,847 INFO L93 Difference]: Finished difference Result 351 states and 498 transitions. [2019-09-03 20:04:51,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:04:51,848 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-09-03 20:04:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:51,850 INFO L225 Difference]: With dead ends: 351 [2019-09-03 20:04:51,850 INFO L226 Difference]: Without dead ends: 302 [2019-09-03 20:04:51,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1400, Invalid=3292, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:04:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-03 20:04:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 95. [2019-09-03 20:04:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:04:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2019-09-03 20:04:51,910 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 90 [2019-09-03 20:04:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:51,911 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2019-09-03 20:04:51,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:04:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2019-09-03 20:04:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:04:51,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:51,912 INFO L399 BasicCegarLoop]: trace histogram [42, 22, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:51,912 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1648562739, now seen corresponding path program 22 times [2019-09-03 20:04:51,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:51,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:51,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1344 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:04:52,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:52,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:52,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:52,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:52,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:52,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:04:52,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 420 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-03 20:04:52,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:52,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 49 [2019-09-03 20:04:52,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:04:52,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:04:52,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=558, Invalid=1794, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:04:52,722 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 49 states. [2019-09-03 20:04:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:53,534 INFO L93 Difference]: Finished difference Result 357 states and 506 transitions. [2019-09-03 20:04:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:04:53,539 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-09-03 20:04:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:53,541 INFO L225 Difference]: With dead ends: 357 [2019-09-03 20:04:53,541 INFO L226 Difference]: Without dead ends: 306 [2019-09-03 20:04:53,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1532, Invalid=3580, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:04:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-03 20:04:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 99. [2019-09-03 20:04:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:04:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2019-09-03 20:04:53,615 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 94 [2019-09-03 20:04:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:53,615 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2019-09-03 20:04:53,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:04:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2019-09-03 20:04:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 20:04:53,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:53,617 INFO L399 BasicCegarLoop]: trace histogram [44, 23, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:53,617 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:53,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:53,617 INFO L82 PathProgramCache]: Analyzing trace with hash 719765957, now seen corresponding path program 23 times [2019-09-03 20:04:53,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:53,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:53,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-03 20:04:53,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:53,934 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:04:53,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:53,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-09-03 20:04:53,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:53,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:04:53,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 462 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-03 20:04:54,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:54,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 51 [2019-09-03 20:04:54,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:04:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:04:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=1944, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:04:54,475 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand 51 states. [2019-09-03 20:04:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:55,384 INFO L93 Difference]: Finished difference Result 363 states and 514 transitions. [2019-09-03 20:04:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:04:55,384 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-09-03 20:04:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:55,385 INFO L225 Difference]: With dead ends: 363 [2019-09-03 20:04:55,385 INFO L226 Difference]: Without dead ends: 310 [2019-09-03 20:04:55,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1670, Invalid=3880, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:04:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-03 20:04:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 103. [2019-09-03 20:04:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:04:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2019-09-03 20:04:55,456 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 98 [2019-09-03 20:04:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:55,456 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2019-09-03 20:04:55,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:04:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2019-09-03 20:04:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:04:55,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:55,457 INFO L399 BasicCegarLoop]: trace histogram [46, 24, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:55,457 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -837807811, now seen corresponding path program 24 times [2019-09-03 20:04:55,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:55,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:55,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1610 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-03 20:04:55,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:55,800 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:04:55,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:55,861 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-03 20:04:55,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:55,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:04:55,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 506 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-03 20:04:56,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:56,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 53 [2019-09-03 20:04:56,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:04:56,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:04:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=2100, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:04:56,374 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 53 states. [2019-09-03 20:04:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:57,324 INFO L93 Difference]: Finished difference Result 369 states and 522 transitions. [2019-09-03 20:04:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:04:57,325 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-09-03 20:04:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:57,326 INFO L225 Difference]: With dead ends: 369 [2019-09-03 20:04:57,326 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 20:04:57,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1814, Invalid=4192, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:04:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 20:04:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 107. [2019-09-03 20:04:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:04:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2019-09-03 20:04:57,414 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 102 [2019-09-03 20:04:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:57,415 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2019-09-03 20:04:57,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:04:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2019-09-03 20:04:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:04:57,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:57,415 INFO L399 BasicCegarLoop]: trace histogram [48, 25, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:57,415 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1180646453, now seen corresponding path program 25 times [2019-09-03 20:04:57,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:57,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:57,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1752 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-03 20:04:57,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:57,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:57,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:57,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:04:57,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 552 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-03 20:04:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:58,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 55 [2019-09-03 20:04:58,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:04:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:04:58,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:04:58,424 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand 55 states. [2019-09-03 20:04:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:59,464 INFO L93 Difference]: Finished difference Result 375 states and 530 transitions. [2019-09-03 20:04:59,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:04:59,464 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2019-09-03 20:04:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:59,466 INFO L225 Difference]: With dead ends: 375 [2019-09-03 20:04:59,466 INFO L226 Difference]: Without dead ends: 318 [2019-09-03 20:04:59,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1964, Invalid=4516, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:04:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-03 20:04:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 111. [2019-09-03 20:04:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:04:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2019-09-03 20:04:59,567 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 106 [2019-09-03 20:04:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:59,567 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2019-09-03 20:04:59,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:04:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2019-09-03 20:04:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 20:04:59,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:59,568 INFO L399 BasicCegarLoop]: trace histogram [50, 26, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:59,568 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1161994925, now seen corresponding path program 26 times [2019-09-03 20:04:59,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:59,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:59,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 20:04:59,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:59,946 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:04:59,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:59,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:59,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:59,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:04:59,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 600 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-03 20:05:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 57 [2019-09-03 20:05:00,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:05:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:05:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=2430, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:05:00,540 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 57 states. [2019-09-03 20:05:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:01,734 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2019-09-03 20:05:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:05:01,735 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2019-09-03 20:05:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:01,737 INFO L225 Difference]: With dead ends: 381 [2019-09-03 20:05:01,737 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 20:05:01,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2120, Invalid=4852, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:05:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 20:05:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 115. [2019-09-03 20:05:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:05:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2019-09-03 20:05:01,873 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 110 [2019-09-03 20:05:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:01,874 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2019-09-03 20:05:01,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:05:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2019-09-03 20:05:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:05:01,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:01,875 INFO L399 BasicCegarLoop]: trace histogram [52, 27, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:01,875 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:01,876 INFO L82 PathProgramCache]: Analyzing trace with hash -865033051, now seen corresponding path program 27 times [2019-09-03 20:05:01,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:01,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:01,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:01,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2054 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 20:05:02,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:02,444 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:05:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:05:02,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 20:05:02,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:02,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:05:02,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 650 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-03 20:05:03,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:03,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28] total 59 [2019-09-03 20:05:03,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:05:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:05:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:05:03,281 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand 59 states. [2019-09-03 20:05:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:04,537 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2019-09-03 20:05:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:05:04,537 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2019-09-03 20:05:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:04,539 INFO L225 Difference]: With dead ends: 387 [2019-09-03 20:05:04,539 INFO L226 Difference]: Without dead ends: 326 [2019-09-03 20:05:04,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2282, Invalid=5200, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:05:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-03 20:05:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 119. [2019-09-03 20:05:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:05:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 147 transitions. [2019-09-03 20:05:04,733 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 147 transitions. Word has length 114 [2019-09-03 20:05:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:04,733 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 147 transitions. [2019-09-03 20:05:04,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:05:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2019-09-03 20:05:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:05:04,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:04,734 INFO L399 BasicCegarLoop]: trace histogram [54, 28, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:04,735 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 199729693, now seen corresponding path program 28 times [2019-09-03 20:05:04,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:04,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2214 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-03 20:05:05,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:05,333 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:05:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:05:05,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:05:05,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:05,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:05:05,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 702 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 20:05:06,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:06,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 61 [2019-09-03 20:05:06,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:05:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:05:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=2784, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:05:06,030 INFO L87 Difference]: Start difference. First operand 119 states and 147 transitions. Second operand 61 states. [2019-09-03 20:05:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:07,366 INFO L93 Difference]: Finished difference Result 393 states and 554 transitions. [2019-09-03 20:05:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:05:07,367 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2019-09-03 20:05:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:07,368 INFO L225 Difference]: With dead ends: 393 [2019-09-03 20:05:07,368 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 20:05:07,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2450, Invalid=5560, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:05:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 20:05:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 123. [2019-09-03 20:05:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 20:05:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. [2019-09-03 20:05:07,520 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 152 transitions. Word has length 118 [2019-09-03 20:05:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:07,521 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 152 transitions. [2019-09-03 20:05:07,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:05:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 152 transitions. [2019-09-03 20:05:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 20:05:07,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:07,521 INFO L399 BasicCegarLoop]: trace histogram [56, 29, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:07,522 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:07,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1074922731, now seen corresponding path program 29 times [2019-09-03 20:05:07,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:07,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:07,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:07,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:07,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-03 20:05:07,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:07,995 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:05:08,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:05:08,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-09-03 20:05:08,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:08,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:05:08,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 756 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-03 20:05:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 30] total 63 [2019-09-03 20:05:08,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:05:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:05:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=2970, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:05:08,757 INFO L87 Difference]: Start difference. First operand 123 states and 152 transitions. Second operand 63 states. [2019-09-03 20:05:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:10,251 INFO L93 Difference]: Finished difference Result 399 states and 562 transitions. [2019-09-03 20:05:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:05:10,251 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2019-09-03 20:05:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:10,253 INFO L225 Difference]: With dead ends: 399 [2019-09-03 20:05:10,253 INFO L226 Difference]: Without dead ends: 334 [2019-09-03 20:05:10,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2624, Invalid=5932, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:05:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-03 20:05:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 127. [2019-09-03 20:05:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:05:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-09-03 20:05:10,408 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 122 [2019-09-03 20:05:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:10,408 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-09-03 20:05:10,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:05:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-09-03 20:05:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 20:05:10,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:10,409 INFO L399 BasicCegarLoop]: trace histogram [58, 30, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:10,409 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:10,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash 252841869, now seen corresponding path program 30 times [2019-09-03 20:05:10,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:10,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:10,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 2552 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-03 20:05:10,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:10,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05:10,918 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:05:10,982 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-03 20:05:10,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:10,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:05:10,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 812 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 20:05:11,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:11,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31] total 65 [2019-09-03 20:05:11,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:05:11,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:05:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=998, Invalid=3162, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:05:11,729 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 65 states. [2019-09-03 20:05:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:13,311 INFO L93 Difference]: Finished difference Result 405 states and 570 transitions. [2019-09-03 20:05:13,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:05:13,311 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2019-09-03 20:05:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:13,313 INFO L225 Difference]: With dead ends: 405 [2019-09-03 20:05:13,313 INFO L226 Difference]: Without dead ends: 338 [2019-09-03 20:05:13,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2804, Invalid=6316, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:05:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-03 20:05:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 131. [2019-09-03 20:05:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 20:05:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-09-03 20:05:13,492 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 126 [2019-09-03 20:05:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:13,492 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-09-03 20:05:13,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:05:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-09-03 20:05:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 20:05:13,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:13,493 INFO L399 BasicCegarLoop]: trace histogram [60, 31, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:13,494 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -399884411, now seen corresponding path program 31 times [2019-09-03 20:05:13,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:13,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:13,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-03 20:05:14,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:14,117 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:05:14,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:14,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:05:14,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 870 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 20:05:14,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32] total 67 [2019-09-03 20:05:14,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:05:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:05:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1062, Invalid=3360, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:05:14,911 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 67 states. [2019-09-03 20:05:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:16,619 INFO L93 Difference]: Finished difference Result 411 states and 578 transitions. [2019-09-03 20:05:16,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:05:16,620 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2019-09-03 20:05:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:16,621 INFO L225 Difference]: With dead ends: 411 [2019-09-03 20:05:16,621 INFO L226 Difference]: Without dead ends: 342 [2019-09-03 20:05:16,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2990, Invalid=6712, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:05:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-03 20:05:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 135. [2019-09-03 20:05:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:05:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2019-09-03 20:05:16,825 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 130 [2019-09-03 20:05:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:16,825 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2019-09-03 20:05:16,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:05:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2019-09-03 20:05:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 20:05:16,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:16,826 INFO L399 BasicCegarLoop]: trace histogram [62, 32, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:16,827 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash -531305731, now seen corresponding path program 32 times [2019-09-03 20:05:16,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:16,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:16,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 2914 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-09-03 20:05:17,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:17,335 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:05:17,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:05:17,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:05:17,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:17,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:05:17,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 930 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:05:18,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:18,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 69 [2019-09-03 20:05:18,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:05:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:05:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=3564, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:05:18,186 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand 69 states. [2019-09-03 20:05:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:20,086 INFO L93 Difference]: Finished difference Result 417 states and 586 transitions. [2019-09-03 20:05:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:05:20,091 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2019-09-03 20:05:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:20,094 INFO L225 Difference]: With dead ends: 417 [2019-09-03 20:05:20,094 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 20:05:20,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3182, Invalid=7120, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:05:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 20:05:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 139. [2019-09-03 20:05:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 20:05:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2019-09-03 20:05:20,328 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 134 [2019-09-03 20:05:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:20,328 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2019-09-03 20:05:20,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:05:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2019-09-03 20:05:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 20:05:20,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:20,329 INFO L399 BasicCegarLoop]: trace histogram [64, 33, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:20,329 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1862766091, now seen corresponding path program 33 times [2019-09-03 20:05:20,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:20,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 3104 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-03 20:05:20,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:20,923 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:05:20,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:05:21,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2019-09-03 20:05:21,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:21,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:05:21,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 992 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-03 20:05:21,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:21,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 34] total 71 [2019-09-03 20:05:21,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:05:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:05:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1196, Invalid=3774, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:05:21,888 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand 71 states. [2019-09-03 20:05:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:23,928 INFO L93 Difference]: Finished difference Result 423 states and 594 transitions. [2019-09-03 20:05:23,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:05:23,928 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2019-09-03 20:05:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:23,930 INFO L225 Difference]: With dead ends: 423 [2019-09-03 20:05:23,930 INFO L226 Difference]: Without dead ends: 350 [2019-09-03 20:05:23,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3380, Invalid=7540, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:05:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-03 20:05:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 143. [2019-09-03 20:05:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:05:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2019-09-03 20:05:24,180 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 138 [2019-09-03 20:05:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:24,180 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2019-09-03 20:05:24,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:05:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2019-09-03 20:05:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:05:24,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:24,181 INFO L399 BasicCegarLoop]: trace histogram [66, 34, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:24,181 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1975727213, now seen corresponding path program 34 times [2019-09-03 20:05:24,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:24,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:24,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 3300 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-03 20:05:24,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:24,910 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) [2019-09-03 20:05:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:24,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:05:24,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:24,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:05:24,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 1056 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 20:05:25,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:25,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 73 [2019-09-03 20:05:25,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:05:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:05:25,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1266, Invalid=3990, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:05:25,993 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand 73 states. [2019-09-03 20:05:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:28,225 INFO L93 Difference]: Finished difference Result 429 states and 602 transitions. [2019-09-03 20:05:28,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:05:28,226 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2019-09-03 20:05:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:28,228 INFO L225 Difference]: With dead ends: 429 [2019-09-03 20:05:28,228 INFO L226 Difference]: Without dead ends: 354 [2019-09-03 20:05:28,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3584, Invalid=7972, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:05:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-03 20:05:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 147. [2019-09-03 20:05:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 20:05:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 182 transitions. [2019-09-03 20:05:28,534 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 182 transitions. Word has length 142 [2019-09-03 20:05:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:28,535 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 182 transitions. [2019-09-03 20:05:28,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:05:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 182 transitions. [2019-09-03 20:05:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 20:05:28,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:28,536 INFO L399 BasicCegarLoop]: trace histogram [68, 35, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:28,536 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1252758117, now seen corresponding path program 35 times [2019-09-03 20:05:28,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:28,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 3502 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2019-09-03 20:05:29,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:29,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:05:29,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:29,334 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 69 check-sat command(s) [2019-09-03 20:05:29,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:05:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 1122 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-03 20:05:30,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:30,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 36] total 75 [2019-09-03 20:05:30,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:05:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:05:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1338, Invalid=4212, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:05:30,308 INFO L87 Difference]: Start difference. First operand 147 states and 182 transitions. Second operand 75 states. [2019-09-03 20:05:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:32,659 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2019-09-03 20:05:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:05:32,660 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2019-09-03 20:05:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:32,661 INFO L225 Difference]: With dead ends: 435 [2019-09-03 20:05:32,661 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 20:05:32,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3794, Invalid=8416, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:05:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 20:05:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 151. [2019-09-03 20:05:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:05:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 187 transitions. [2019-09-03 20:05:32,952 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 187 transitions. Word has length 146 [2019-09-03 20:05:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:32,952 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 187 transitions. [2019-09-03 20:05:32,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:05:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions. [2019-09-03 20:05:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:05:32,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:32,953 INFO L399 BasicCegarLoop]: trace histogram [70, 36, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:32,954 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -370152483, now seen corresponding path program 36 times [2019-09-03 20:05:32,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:32,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:32,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 3710 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 20:05:33,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:33,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:33,575 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:05:33,660 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 70 check-sat command(s) [2019-09-03 20:05:33,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:33,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:05:33,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 1190 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 20:05:34,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:34,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 37] total 77 [2019-09-03 20:05:34,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:05:34,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:05:34,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1412, Invalid=4440, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:05:34,671 INFO L87 Difference]: Start difference. First operand 151 states and 187 transitions. Second operand 77 states. [2019-09-03 20:05:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:37,190 INFO L93 Difference]: Finished difference Result 441 states and 618 transitions. [2019-09-03 20:05:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:05:37,191 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2019-09-03 20:05:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:37,192 INFO L225 Difference]: With dead ends: 441 [2019-09-03 20:05:37,192 INFO L226 Difference]: Without dead ends: 362 [2019-09-03 20:05:37,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4010, Invalid=8872, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:05:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-03 20:05:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 155. [2019-09-03 20:05:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 20:05:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2019-09-03 20:05:37,538 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 150 [2019-09-03 20:05:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:37,538 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2019-09-03 20:05:37,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:05:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2019-09-03 20:05:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 20:05:37,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:37,539 INFO L399 BasicCegarLoop]: trace histogram [72, 37, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:37,539 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1441357611, now seen corresponding path program 37 times [2019-09-03 20:05:37,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:37,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:37,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 3924 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-09-03 20:05:38,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:38,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:38,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:05:38,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 1260 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-03 20:05:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38] total 79 [2019-09-03 20:05:39,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:05:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:05:39,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=4674, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:05:39,512 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand 79 states. [2019-09-03 20:05:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:42,940 INFO L93 Difference]: Finished difference Result 447 states and 626 transitions. [2019-09-03 20:05:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:05:42,940 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2019-09-03 20:05:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:42,942 INFO L225 Difference]: With dead ends: 447 [2019-09-03 20:05:42,942 INFO L226 Difference]: Without dead ends: 366 [2019-09-03 20:05:42,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4232, Invalid=9340, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:05:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-03 20:05:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 159. [2019-09-03 20:05:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 20:05:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2019-09-03 20:05:43,346 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 154 [2019-09-03 20:05:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:43,346 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2019-09-03 20:05:43,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:05:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2019-09-03 20:05:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 20:05:43,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:43,347 INFO L399 BasicCegarLoop]: trace histogram [74, 38, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:43,347 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1005457741, now seen corresponding path program 38 times [2019-09-03 20:05:43,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:43,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:43,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 4144 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2019-09-03 20:05:44,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:44,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:44,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:05:44,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:05:44,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:44,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:05:44,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 1332 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-03 20:05:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:45,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39] total 81 [2019-09-03 20:05:45,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:05:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:05:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=4914, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:05:45,678 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand 81 states. [2019-09-03 20:05:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:48,492 INFO L93 Difference]: Finished difference Result 453 states and 634 transitions. [2019-09-03 20:05:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:05:48,492 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2019-09-03 20:05:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:48,494 INFO L225 Difference]: With dead ends: 453 [2019-09-03 20:05:48,494 INFO L226 Difference]: Without dead ends: 370 [2019-09-03 20:05:48,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4460, Invalid=9820, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:05:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-03 20:05:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 163. [2019-09-03 20:05:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 20:05:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2019-09-03 20:05:48,889 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 158 [2019-09-03 20:05:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:48,889 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2019-09-03 20:05:48,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:05:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2019-09-03 20:05:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 20:05:48,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:48,890 INFO L399 BasicCegarLoop]: trace histogram [76, 39, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:48,890 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash 143433029, now seen corresponding path program 39 times [2019-09-03 20:05:48,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:48,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:48,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 4370 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-03 20:05:49,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:49,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:49,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:05:49,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2019-09-03 20:05:49,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:49,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:05:49,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 1406 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2019-09-03 20:05:50,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 40] total 83 [2019-09-03 20:05:50,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:05:50,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:05:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1646, Invalid=5160, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:05:50,916 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand 83 states. [2019-09-03 20:05:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:53,888 INFO L93 Difference]: Finished difference Result 459 states and 642 transitions. [2019-09-03 20:05:53,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:05:53,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2019-09-03 20:05:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:53,892 INFO L225 Difference]: With dead ends: 459 [2019-09-03 20:05:53,892 INFO L226 Difference]: Without dead ends: 374 [2019-09-03 20:05:53,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4694, Invalid=10312, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:05:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-03 20:05:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 167. [2019-09-03 20:05:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 20:05:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 207 transitions. [2019-09-03 20:05:54,307 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 207 transitions. Word has length 162 [2019-09-03 20:05:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:54,307 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 207 transitions. [2019-09-03 20:05:54,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:05:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2019-09-03 20:05:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 20:05:54,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:54,308 INFO L399 BasicCegarLoop]: trace histogram [78, 40, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:54,308 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash 256943293, now seen corresponding path program 40 times [2019-09-03 20:05:54,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:54,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 4602 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-03 20:05:55,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:55,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:55,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:05:55,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:05:55,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:55,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:05:55,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 1482 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-03 20:05:56,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:56,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 41] total 85 [2019-09-03 20:05:56,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:05:56,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:05:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1728, Invalid=5412, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:05:56,482 INFO L87 Difference]: Start difference. First operand 167 states and 207 transitions. Second operand 85 states. [2019-09-03 20:05:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:59,676 INFO L93 Difference]: Finished difference Result 465 states and 650 transitions. [2019-09-03 20:05:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:05:59,676 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2019-09-03 20:05:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:59,679 INFO L225 Difference]: With dead ends: 465 [2019-09-03 20:05:59,679 INFO L226 Difference]: Without dead ends: 378 [2019-09-03 20:05:59,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4934, Invalid=10816, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:05:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-03 20:06:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 171. [2019-09-03 20:06:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 20:06:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2019-09-03 20:06:00,159 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 166 [2019-09-03 20:06:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:00,159 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2019-09-03 20:06:00,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:06:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2019-09-03 20:06:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 20:06:00,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:00,160 INFO L399 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:00,161 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1138788277, now seen corresponding path program 41 times [2019-09-03 20:06:00,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:00,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:00,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 4840 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-03 20:06:00,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:00,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:06:01,048 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 81 check-sat command(s) [2019-09-03 20:06:01,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:01,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:06:01,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 1560 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-03 20:06:02,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 42] total 87 [2019-09-03 20:06:02,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:06:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:06:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1812, Invalid=5670, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:06:02,315 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand 87 states. [2019-09-03 20:06:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:05,749 INFO L93 Difference]: Finished difference Result 471 states and 658 transitions. [2019-09-03 20:06:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:06:05,749 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2019-09-03 20:06:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:05,752 INFO L225 Difference]: With dead ends: 471 [2019-09-03 20:06:05,752 INFO L226 Difference]: Without dead ends: 382 [2019-09-03 20:06:05,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5180, Invalid=11332, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:06:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-03 20:06:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 175. [2019-09-03 20:06:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 20:06:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 217 transitions. [2019-09-03 20:06:06,372 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 217 transitions. Word has length 170 [2019-09-03 20:06:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:06,372 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 217 transitions. [2019-09-03 20:06:06,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:06:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 217 transitions. [2019-09-03 20:06:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 20:06:06,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:06,373 INFO L399 BasicCegarLoop]: trace histogram [82, 42, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:06,373 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1814734381, now seen corresponding path program 42 times [2019-09-03 20:06:06,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:06,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:06,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 5084 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:06:07,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:07,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:07,252 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:06:07,351 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-09-03 20:06:07,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:07,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:06:07,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 1640 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-03 20:06:08,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:08,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 43] total 89 [2019-09-03 20:06:08,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:06:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:06:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1898, Invalid=5934, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:06:08,666 INFO L87 Difference]: Start difference. First operand 175 states and 217 transitions. Second operand 89 states. [2019-09-03 20:06:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:12,265 INFO L93 Difference]: Finished difference Result 477 states and 666 transitions. [2019-09-03 20:06:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:06:12,265 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2019-09-03 20:06:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:12,270 INFO L225 Difference]: With dead ends: 477 [2019-09-03 20:06:12,270 INFO L226 Difference]: Without dead ends: 386 [2019-09-03 20:06:12,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5432, Invalid=11860, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:06:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-03 20:06:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 179. [2019-09-03 20:06:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 20:06:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2019-09-03 20:06:12,802 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 174 [2019-09-03 20:06:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:12,803 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2019-09-03 20:06:12,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:06:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2019-09-03 20:06:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 20:06:12,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:12,804 INFO L399 BasicCegarLoop]: trace histogram [84, 43, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:12,804 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2120572965, now seen corresponding path program 43 times [2019-09-03 20:06:12,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:12,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:12,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 5334 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 20:06:14,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:14,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:14,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:06:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:14,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:06:14,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 1722 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 20:06:15,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 44] total 91 [2019-09-03 20:06:15,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:06:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:06:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1986, Invalid=6204, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:06:15,671 INFO L87 Difference]: Start difference. First operand 179 states and 222 transitions. Second operand 91 states. [2019-09-03 20:06:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:19,472 INFO L93 Difference]: Finished difference Result 483 states and 674 transitions. [2019-09-03 20:06:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:06:19,473 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2019-09-03 20:06:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:19,474 INFO L225 Difference]: With dead ends: 483 [2019-09-03 20:06:19,474 INFO L226 Difference]: Without dead ends: 390 [2019-09-03 20:06:19,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5690, Invalid=12400, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:06:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-03 20:06:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 183. [2019-09-03 20:06:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 20:06:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2019-09-03 20:06:20,084 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 227 transitions. Word has length 178 [2019-09-03 20:06:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:20,085 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 227 transitions. [2019-09-03 20:06:20,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:06:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 227 transitions. [2019-09-03 20:06:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 20:06:20,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:20,086 INFO L399 BasicCegarLoop]: trace histogram [86, 44, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:20,086 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2131695005, now seen corresponding path program 44 times [2019-09-03 20:06:20,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:20,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:20,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:06:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 5590 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2019-09-03 20:06:20,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:20,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:20,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:06:21,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:06:21,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:21,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:06:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 1806 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 20:06:22,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 45] total 93 [2019-09-03 20:06:22,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:06:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:06:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2076, Invalid=6480, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:06:22,534 INFO L87 Difference]: Start difference. First operand 183 states and 227 transitions. Second operand 93 states. [2019-09-03 20:06:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:26,578 INFO L93 Difference]: Finished difference Result 489 states and 682 transitions. [2019-09-03 20:06:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:06:26,578 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2019-09-03 20:06:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:26,580 INFO L225 Difference]: With dead ends: 489 [2019-09-03 20:06:26,580 INFO L226 Difference]: Without dead ends: 394 [2019-09-03 20:06:26,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3014 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5954, Invalid=12952, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:06:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-03 20:06:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 187. [2019-09-03 20:06:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 20:06:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 232 transitions. [2019-09-03 20:06:27,210 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 232 transitions. Word has length 182 [2019-09-03 20:06:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:27,211 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 232 transitions. [2019-09-03 20:06:27,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:06:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2019-09-03 20:06:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 20:06:27,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:27,212 INFO L399 BasicCegarLoop]: trace histogram [88, 45, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:27,212 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash -554817899, now seen corresponding path program 45 times [2019-09-03 20:06:27,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:27,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:27,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-03 20:06:28,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:28,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:28,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:06:28,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 89 check-sat command(s) [2019-09-03 20:06:28,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:28,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:06:28,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 1892 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 20:06:30,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:30,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 46] total 95 [2019-09-03 20:06:30,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:06:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:06:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2168, Invalid=6762, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:06:30,236 INFO L87 Difference]: Start difference. First operand 187 states and 232 transitions. Second operand 95 states. [2019-09-03 20:06:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:34,503 INFO L93 Difference]: Finished difference Result 495 states and 690 transitions. [2019-09-03 20:06:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:06:34,503 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2019-09-03 20:06:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:34,505 INFO L225 Difference]: With dead ends: 495 [2019-09-03 20:06:34,505 INFO L226 Difference]: Without dead ends: 398 [2019-09-03 20:06:34,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6224, Invalid=13516, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:06:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-03 20:06:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 191. [2019-09-03 20:06:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 20:06:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2019-09-03 20:06:35,184 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 186 [2019-09-03 20:06:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:35,185 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2019-09-03 20:06:35,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:06:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2019-09-03 20:06:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 20:06:35,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:35,186 INFO L399 BasicCegarLoop]: trace histogram [90, 46, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:35,186 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1494283021, now seen corresponding path program 46 times [2019-09-03 20:06:35,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:35,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 6120 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2019-09-03 20:06:36,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:36,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:36,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:06:36,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:06:36,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:36,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:06:36,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 20:06:38,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:38,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 47] total 97 [2019-09-03 20:06:38,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:06:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:06:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2262, Invalid=7050, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:06:38,146 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand 97 states. [2019-09-03 20:06:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:42,694 INFO L93 Difference]: Finished difference Result 501 states and 698 transitions. [2019-09-03 20:06:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:06:42,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2019-09-03 20:06:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:42,696 INFO L225 Difference]: With dead ends: 501 [2019-09-03 20:06:42,696 INFO L226 Difference]: Without dead ends: 402 [2019-09-03 20:06:42,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6500, Invalid=14092, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:06:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-03 20:06:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 195. [2019-09-03 20:06:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 20:06:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 242 transitions. [2019-09-03 20:06:43,425 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 242 transitions. Word has length 190 [2019-09-03 20:06:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:43,426 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 242 transitions. [2019-09-03 20:06:43,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:06:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 242 transitions. [2019-09-03 20:06:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 20:06:43,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:43,427 INFO L399 BasicCegarLoop]: trace histogram [92, 47, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:43,427 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1355668229, now seen corresponding path program 47 times [2019-09-03 20:06:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:43,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2019-09-03 20:06:44,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:44,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:44,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:06:44,519 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 93 check-sat command(s) [2019-09-03 20:06:44,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:44,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:06:44,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 2070 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-09-03 20:06:46,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:46,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 48] total 99 [2019-09-03 20:06:46,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:06:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:06:46,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2358, Invalid=7344, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:06:46,223 INFO L87 Difference]: Start difference. First operand 195 states and 242 transitions. Second operand 99 states. [2019-09-03 20:06:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:51,051 INFO L93 Difference]: Finished difference Result 507 states and 706 transitions. [2019-09-03 20:06:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:06:51,051 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2019-09-03 20:06:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:51,053 INFO L225 Difference]: With dead ends: 507 [2019-09-03 20:06:51,053 INFO L226 Difference]: Without dead ends: 406 [2019-09-03 20:06:51,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6782, Invalid=14680, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:06:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-03 20:06:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 199. [2019-09-03 20:06:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:06:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2019-09-03 20:06:51,860 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 194 [2019-09-03 20:06:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:51,861 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2019-09-03 20:06:51,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:06:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2019-09-03 20:06:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 20:06:51,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:51,862 INFO L399 BasicCegarLoop]: trace histogram [94, 48, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:51,862 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:51,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:51,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1346158979, now seen corresponding path program 48 times [2019-09-03 20:06:51,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:51,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:51,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 6674 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-03 20:06:52,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:52,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:52,914 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:06:53,038 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 94 check-sat command(s) [2019-09-03 20:06:53,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:53,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:06:53,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 2162 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-03 20:06:54,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:54,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49] total 101 [2019-09-03 20:06:54,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 20:06:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 20:06:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2456, Invalid=7644, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:06:54,782 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand 101 states. [2019-09-03 20:06:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:59,904 INFO L93 Difference]: Finished difference Result 513 states and 714 transitions. [2019-09-03 20:06:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:06:59,904 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2019-09-03 20:06:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:59,907 INFO L225 Difference]: With dead ends: 513 [2019-09-03 20:06:59,907 INFO L226 Difference]: Without dead ends: 410 [2019-09-03 20:06:59,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3576 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7070, Invalid=15280, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 20:06:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-03 20:07:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 203. [2019-09-03 20:07:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 20:07:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2019-09-03 20:07:00,753 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 198 [2019-09-03 20:07:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:00,753 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2019-09-03 20:07:00,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 20:07:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2019-09-03 20:07:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 20:07:00,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:00,755 INFO L399 BasicCegarLoop]: trace histogram [96, 49, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:00,755 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1138195829, now seen corresponding path program 49 times [2019-09-03 20:07:00,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:00,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:00,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 6960 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2019-09-03 20:07:01,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:01,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:01,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:07:01,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 2256 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-03 20:07:03,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:03,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 50] total 103 [2019-09-03 20:07:03,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 20:07:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 20:07:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=7950, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:07:03,812 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand 103 states. [2019-09-03 20:07:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:09,156 INFO L93 Difference]: Finished difference Result 519 states and 722 transitions. [2019-09-03 20:07:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 20:07:09,156 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2019-09-03 20:07:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:09,158 INFO L225 Difference]: With dead ends: 519 [2019-09-03 20:07:09,158 INFO L226 Difference]: Without dead ends: 414 [2019-09-03 20:07:09,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7364, Invalid=15892, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:07:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-03 20:07:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 207. [2019-09-03 20:07:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 20:07:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2019-09-03 20:07:10,153 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 202 [2019-09-03 20:07:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:10,153 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2019-09-03 20:07:10,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 20:07:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2019-09-03 20:07:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 20:07:10,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:10,155 INFO L399 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:10,155 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1657210899, now seen corresponding path program 50 times [2019-09-03 20:07:10,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:10,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:10,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 7252 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-09-03 20:07:11,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:11,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:11,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:07:11,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:07:11,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:07:11,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 2352 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2019-09-03 20:07:13,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:13,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 51] total 105 [2019-09-03 20:07:13,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 20:07:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 20:07:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2658, Invalid=8262, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:07:13,284 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand 105 states. [2019-09-03 20:07:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:18,941 INFO L93 Difference]: Finished difference Result 525 states and 730 transitions. [2019-09-03 20:07:18,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 20:07:18,942 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2019-09-03 20:07:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:18,945 INFO L225 Difference]: With dead ends: 525 [2019-09-03 20:07:18,945 INFO L226 Difference]: Without dead ends: 418 [2019-09-03 20:07:18,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7664, Invalid=16516, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:07:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-03 20:07:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 211. [2019-09-03 20:07:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 20:07:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 262 transitions. [2019-09-03 20:07:19,939 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 262 transitions. Word has length 206 [2019-09-03 20:07:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:19,939 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 262 transitions. [2019-09-03 20:07:19,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 20:07:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 262 transitions. [2019-09-03 20:07:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 20:07:19,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:19,941 INFO L399 BasicCegarLoop]: trace histogram [100, 51, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:19,942 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1818103269, now seen corresponding path program 51 times [2019-09-03 20:07:19,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:19,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:19,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:19,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:19,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7550 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:07:21,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:21,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:21,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:07:21,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 101 check-sat command(s) [2019-09-03 20:07:21,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:21,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:07:21,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 2450 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2019-09-03 20:07:23,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:23,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 52] total 107 [2019-09-03 20:07:23,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 20:07:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 20:07:23,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2762, Invalid=8580, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 20:07:23,284 INFO L87 Difference]: Start difference. First operand 211 states and 262 transitions. Second operand 107 states. [2019-09-03 20:07:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:29,623 INFO L93 Difference]: Finished difference Result 531 states and 738 transitions. [2019-09-03 20:07:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:07:29,623 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2019-09-03 20:07:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:29,625 INFO L225 Difference]: With dead ends: 531 [2019-09-03 20:07:29,625 INFO L226 Difference]: Without dead ends: 422 [2019-09-03 20:07:29,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4029 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7970, Invalid=17152, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:07:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-03 20:07:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 215. [2019-09-03 20:07:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 20:07:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2019-09-03 20:07:30,695 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 210 [2019-09-03 20:07:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:30,696 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2019-09-03 20:07:30,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 20:07:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2019-09-03 20:07:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 20:07:30,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:30,697 INFO L399 BasicCegarLoop]: trace histogram [102, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:30,697 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1610948445, now seen corresponding path program 52 times [2019-09-03 20:07:30,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:30,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:30,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 7854 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 20:07:32,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:32,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:07:32,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:07:32,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:32,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:07:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 2550 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-03 20:07:34,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 53] total 109 [2019-09-03 20:07:34,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 20:07:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 20:07:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2868, Invalid=8904, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:07:34,514 INFO L87 Difference]: Start difference. First operand 215 states and 267 transitions. Second operand 109 states. [2019-09-03 20:07:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:40,775 INFO L93 Difference]: Finished difference Result 537 states and 746 transitions. [2019-09-03 20:07:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 20:07:40,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2019-09-03 20:07:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:40,777 INFO L225 Difference]: With dead ends: 537 [2019-09-03 20:07:40,777 INFO L226 Difference]: Without dead ends: 426 [2019-09-03 20:07:40,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8282, Invalid=17800, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:07:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-03 20:07:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 219. [2019-09-03 20:07:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 20:07:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 272 transitions. [2019-09-03 20:07:41,922 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 272 transitions. Word has length 214 [2019-09-03 20:07:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:41,922 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 272 transitions. [2019-09-03 20:07:41,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 20:07:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2019-09-03 20:07:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-03 20:07:41,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:41,924 INFO L399 BasicCegarLoop]: trace histogram [104, 53, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:41,924 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2093708203, now seen corresponding path program 53 times [2019-09-03 20:07:41,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:41,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 8164 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2019-09-03 20:07:43,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:43,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:07:43,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 105 check-sat command(s) [2019-09-03 20:07:43,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:43,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:07:43,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 2652 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2019-09-03 20:07:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 54] total 111 [2019-09-03 20:07:45,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 20:07:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 20:07:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2976, Invalid=9234, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:07:45,376 INFO L87 Difference]: Start difference. First operand 219 states and 272 transitions. Second operand 111 states. [2019-09-03 20:07:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:51,895 INFO L93 Difference]: Finished difference Result 543 states and 754 transitions. [2019-09-03 20:07:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:07:51,896 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2019-09-03 20:07:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:51,897 INFO L225 Difference]: With dead ends: 543 [2019-09-03 20:07:51,897 INFO L226 Difference]: Without dead ends: 430 [2019-09-03 20:07:51,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=8600, Invalid=18460, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:07:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-03 20:07:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 223. [2019-09-03 20:07:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 20:07:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 277 transitions. [2019-09-03 20:07:53,106 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 277 transitions. Word has length 218 [2019-09-03 20:07:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:53,106 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 277 transitions. [2019-09-03 20:07:53,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 20:07:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 277 transitions. [2019-09-03 20:07:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 20:07:53,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:53,108 INFO L399 BasicCegarLoop]: trace histogram [106, 54, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:53,108 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash 456832205, now seen corresponding path program 54 times [2019-09-03 20:07:53,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:53,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:53,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 8480 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2019-09-03 20:07:54,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:54,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:54,404 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:07:54,548 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 106 check-sat command(s) [2019-09-03 20:07:54,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:54,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:07:54,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 2756 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-03 20:07:56,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:56,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 55] total 113 [2019-09-03 20:07:56,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 20:07:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 20:07:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=9570, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:07:56,751 INFO L87 Difference]: Start difference. First operand 223 states and 277 transitions. Second operand 113 states. [2019-09-03 20:08:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:03,555 INFO L93 Difference]: Finished difference Result 549 states and 762 transitions. [2019-09-03 20:08:03,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 20:08:03,556 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2019-09-03 20:08:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:03,557 INFO L225 Difference]: With dead ends: 549 [2019-09-03 20:08:03,557 INFO L226 Difference]: Without dead ends: 434 [2019-09-03 20:08:03,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4509 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8924, Invalid=19132, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:08:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-03 20:08:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 227. [2019-09-03 20:08:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 20:08:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 282 transitions. [2019-09-03 20:08:04,893 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 282 transitions. Word has length 222 [2019-09-03 20:08:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:04,893 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 282 transitions. [2019-09-03 20:08:04,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 20:08:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 282 transitions. [2019-09-03 20:08:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-03 20:08:04,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:04,894 INFO L399 BasicCegarLoop]: trace histogram [108, 55, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:04,894 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 95287493, now seen corresponding path program 55 times [2019-09-03 20:08:04,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:04,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:04,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:04,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:04,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 8802 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-09-03 20:08:06,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:06,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:06,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:06,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:08:06,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 2862 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-03 20:08:08,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:08,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 56] total 115 [2019-09-03 20:08:08,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 20:08:08,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 20:08:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3198, Invalid=9912, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 20:08:08,575 INFO L87 Difference]: Start difference. First operand 227 states and 282 transitions. Second operand 115 states. [2019-09-03 20:08:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:15,722 INFO L93 Difference]: Finished difference Result 555 states and 770 transitions. [2019-09-03 20:08:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 20:08:15,723 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2019-09-03 20:08:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:15,724 INFO L225 Difference]: With dead ends: 555 [2019-09-03 20:08:15,724 INFO L226 Difference]: Without dead ends: 438 [2019-09-03 20:08:15,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4675 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9254, Invalid=19816, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:08:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-03 20:08:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 231. [2019-09-03 20:08:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 20:08:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 287 transitions. [2019-09-03 20:08:17,135 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 287 transitions. Word has length 226 [2019-09-03 20:08:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:17,135 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 287 transitions. [2019-09-03 20:08:17,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 20:08:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 287 transitions. [2019-09-03 20:08:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 20:08:17,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:17,137 INFO L399 BasicCegarLoop]: trace histogram [110, 56, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:17,137 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:17,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:17,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1771259843, now seen corresponding path program 56 times [2019-09-03 20:08:17,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:17,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:17,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:17,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 9130 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2019-09-03 20:08:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:18,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:18,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:08:18,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:08:18,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:18,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:08:18,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 2970 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2019-09-03 20:08:20,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:20,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 57] total 117 [2019-09-03 20:08:20,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 20:08:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 20:08:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3312, Invalid=10260, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:08:20,858 INFO L87 Difference]: Start difference. First operand 231 states and 287 transitions. Second operand 117 states. [2019-09-03 20:08:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:28,546 INFO L93 Difference]: Finished difference Result 561 states and 778 transitions. [2019-09-03 20:08:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 20:08:28,547 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2019-09-03 20:08:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:28,548 INFO L225 Difference]: With dead ends: 561 [2019-09-03 20:08:28,548 INFO L226 Difference]: Without dead ends: 442 [2019-09-03 20:08:28,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9590, Invalid=20512, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 20:08:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-03 20:08:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 235. [2019-09-03 20:08:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 20:08:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2019-09-03 20:08:30,003 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 230 [2019-09-03 20:08:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:30,004 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2019-09-03 20:08:30,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 20:08:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2019-09-03 20:08:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 20:08:30,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:30,005 INFO L399 BasicCegarLoop]: trace histogram [112, 57, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:30,005 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash -174238923, now seen corresponding path program 57 times [2019-09-03 20:08:30,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:30,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:30,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 9464 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-09-03 20:08:31,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:31,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:31,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:08:31,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 113 check-sat command(s) [2019-09-03 20:08:31,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:31,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:08:31,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 3080 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2019-09-03 20:08:33,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:33,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 58] total 119 [2019-09-03 20:08:33,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-03 20:08:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-03 20:08:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3428, Invalid=10614, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 20:08:33,971 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand 119 states. [2019-09-03 20:08:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:41,769 INFO L93 Difference]: Finished difference Result 567 states and 786 transitions. [2019-09-03 20:08:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:08:41,769 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 234 [2019-09-03 20:08:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:41,771 INFO L225 Difference]: With dead ends: 567 [2019-09-03 20:08:41,771 INFO L226 Difference]: Without dead ends: 446 [2019-09-03 20:08:41,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9932, Invalid=21220, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 20:08:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-03 20:08:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 239. [2019-09-03 20:08:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 20:08:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 297 transitions. [2019-09-03 20:08:43,317 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 297 transitions. Word has length 234 [2019-09-03 20:08:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:43,318 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 297 transitions. [2019-09-03 20:08:43,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-03 20:08:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 297 transitions. [2019-09-03 20:08:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-03 20:08:43,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:43,319 INFO L399 BasicCegarLoop]: trace histogram [114, 58, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:43,319 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -38917715, now seen corresponding path program 58 times [2019-09-03 20:08:43,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:43,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 9804 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2019-09-03 20:08:44,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:44,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:44,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:08:44,762 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:08:44,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:44,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:08:44,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 3192 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-03 20:08:47,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:47,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 59] total 121 [2019-09-03 20:08:47,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 20:08:47,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 20:08:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3546, Invalid=10974, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:08:47,214 INFO L87 Difference]: Start difference. First operand 239 states and 297 transitions. Second operand 121 states. [2019-09-03 20:08:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:55,468 INFO L93 Difference]: Finished difference Result 573 states and 794 transitions. [2019-09-03 20:08:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 20:08:55,468 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 238 [2019-09-03 20:08:55,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:55,470 INFO L225 Difference]: With dead ends: 573 [2019-09-03 20:08:55,470 INFO L226 Difference]: Without dead ends: 450 [2019-09-03 20:08:55,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5191 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=10280, Invalid=21940, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 20:08:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-03 20:08:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 243. [2019-09-03 20:08:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-03 20:08:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 302 transitions. [2019-09-03 20:08:57,120 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 302 transitions. Word has length 238 [2019-09-03 20:08:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:57,120 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 302 transitions. [2019-09-03 20:08:57,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 20:08:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 302 transitions. [2019-09-03 20:08:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-03 20:08:57,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:57,121 INFO L399 BasicCegarLoop]: trace histogram [116, 59, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:57,121 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1722442843, now seen corresponding path program 59 times [2019-09-03 20:08:57,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:57,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:57,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 10150 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2019-09-03 20:08:58,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:58,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:58,562 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:08:58,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 117 check-sat command(s) [2019-09-03 20:08:58,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:58,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:08:58,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 3306 refuted. 0 times theorem prover too weak. 3364 trivial. 0 not checked. [2019-09-03 20:09:01,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:01,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 60] total 123 [2019-09-03 20:09:01,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 20:09:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 20:09:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3666, Invalid=11340, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:09:01,233 INFO L87 Difference]: Start difference. First operand 243 states and 302 transitions. Second operand 123 states. [2019-09-03 20:09:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:09,762 INFO L93 Difference]: Finished difference Result 579 states and 802 transitions. [2019-09-03 20:09:09,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 20:09:09,763 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 242 [2019-09-03 20:09:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:09,764 INFO L225 Difference]: With dead ends: 579 [2019-09-03 20:09:09,764 INFO L226 Difference]: Without dead ends: 454 [2019-09-03 20:09:09,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5369 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=10634, Invalid=22672, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 20:09:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-03 20:09:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 247. [2019-09-03 20:09:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 20:09:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2019-09-03 20:09:11,524 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 242 [2019-09-03 20:09:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:11,524 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2019-09-03 20:09:11,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 20:09:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2019-09-03 20:09:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-03 20:09:11,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:11,526 INFO L399 BasicCegarLoop]: trace histogram [118, 60, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:11,526 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1584264931, now seen corresponding path program 60 times [2019-09-03 20:09:11,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:11,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:11,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 10502 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2019-09-03 20:09:12,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:09:12,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:09:12,974 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:09:13,142 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 118 check-sat command(s) [2019-09-03 20:09:13,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:13,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:09:13,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 7021 proven. 3422 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2019-09-03 20:09:15,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:15,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 61] total 125 [2019-09-03 20:09:15,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-03 20:09:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-03 20:09:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3788, Invalid=11712, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:09:15,761 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand 125 states. [2019-09-03 20:09:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:24,662 INFO L93 Difference]: Finished difference Result 585 states and 810 transitions. [2019-09-03 20:09:24,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 20:09:24,662 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 246 [2019-09-03 20:09:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:24,664 INFO L225 Difference]: With dead ends: 585 [2019-09-03 20:09:24,665 INFO L226 Difference]: Without dead ends: 458 [2019-09-03 20:09:24,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5550 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10994, Invalid=23416, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:09:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-03 20:09:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 251. [2019-09-03 20:09:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-03 20:09:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 312 transitions. [2019-09-03 20:09:26,524 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 312 transitions. Word has length 246 [2019-09-03 20:09:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:26,524 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 312 transitions. [2019-09-03 20:09:26,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-03 20:09:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 312 transitions. [2019-09-03 20:09:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-03 20:09:26,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:26,526 INFO L399 BasicCegarLoop]: trace histogram [120, 61, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:26,526 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1000985109, now seen corresponding path program 61 times [2019-09-03 20:09:26,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:26,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:26,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:26,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:26,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 10860 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-09-03 20:09:28,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:09:28,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:09:28,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:09:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:28,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:09:28,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 7260 proven. 3540 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-03 20:09:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 62] total 127 [2019-09-03 20:09:30,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 20:09:30,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 20:09:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3912, Invalid=12090, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 20:09:30,814 INFO L87 Difference]: Start difference. First operand 251 states and 312 transitions. Second operand 127 states. [2019-09-03 20:09:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:40,098 INFO L93 Difference]: Finished difference Result 591 states and 818 transitions. [2019-09-03 20:09:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 20:09:40,099 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 250 [2019-09-03 20:09:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:40,101 INFO L225 Difference]: With dead ends: 591 [2019-09-03 20:09:40,101 INFO L226 Difference]: Without dead ends: 462 [2019-09-03 20:09:40,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=11360, Invalid=24172, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 20:09:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-03 20:09:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 255. [2019-09-03 20:09:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 20:09:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 317 transitions. [2019-09-03 20:09:42,067 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 317 transitions. Word has length 250 [2019-09-03 20:09:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:42,067 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 317 transitions. [2019-09-03 20:09:42,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 20:09:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 317 transitions. [2019-09-03 20:09:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-03 20:09:42,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:42,069 INFO L399 BasicCegarLoop]: trace histogram [122, 62, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:42,069 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1221896563, now seen corresponding path program 62 times [2019-09-03 20:09:42,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:42,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:42,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:09:42,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 11224 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2019-09-03 20:09:43,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:09:43,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:09:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:09:43,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:09:43,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:43,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:09:43,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 7503 proven. 3660 refuted. 0 times theorem prover too weak. 3721 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:09:46,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:46,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 63] total 129 [2019-09-03 20:09:46,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 20:09:46,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 20:09:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4038, Invalid=12474, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:09:46,593 INFO L87 Difference]: Start difference. First operand 255 states and 317 transitions. Second operand 129 states. [2019-09-03 20:09:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:56,378 INFO L93 Difference]: Finished difference Result 597 states and 826 transitions. [2019-09-03 20:09:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 20:09:56,378 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 254 [2019-09-03 20:09:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:56,379 INFO L225 Difference]: With dead ends: 597 [2019-09-03 20:09:56,380 INFO L226 Difference]: Without dead ends: 466 [2019-09-03 20:09:56,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5921 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11732, Invalid=24940, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 20:09:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-03 20:09:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 259. [2019-09-03 20:09:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 20:09:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 322 transitions. [2019-09-03 20:09:58,440 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 322 transitions. Word has length 254 [2019-09-03 20:09:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:58,441 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 322 transitions. [2019-09-03 20:09:58,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 20:09:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 322 transitions. [2019-09-03 20:09:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 20:09:58,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:58,442 INFO L399 BasicCegarLoop]: trace histogram [124, 63, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:58,442 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -336791931, now seen corresponding path program 63 times [2019-09-03 20:09:58,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:58,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:58,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2019-09-03 20:10:00,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:00,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:10:00,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:00,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 125 check-sat command(s) [2019-09-03 20:10:00,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:00,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:10:00,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 7750 proven. 3782 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2019-09-03 20:10:03,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:03,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 64] total 131 [2019-09-03 20:10:03,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-03 20:10:03,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-03 20:10:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4166, Invalid=12864, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:10:03,176 INFO L87 Difference]: Start difference. First operand 259 states and 322 transitions. Second operand 131 states. [2019-09-03 20:10:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:13,290 INFO L93 Difference]: Finished difference Result 603 states and 834 transitions. [2019-09-03 20:10:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:10:13,290 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 258 [2019-09-03 20:10:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:13,292 INFO L225 Difference]: With dead ends: 603 [2019-09-03 20:10:13,292 INFO L226 Difference]: Without dead ends: 470 [2019-09-03 20:10:13,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6111 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=12110, Invalid=25720, Unknown=0, NotChecked=0, Total=37830 [2019-09-03 20:10:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-03 20:10:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 263. [2019-09-03 20:10:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 20:10:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 327 transitions. [2019-09-03 20:10:15,494 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 327 transitions. Word has length 258 [2019-09-03 20:10:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:15,494 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 327 transitions. [2019-09-03 20:10:15,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-03 20:10:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 327 transitions. [2019-09-03 20:10:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 20:10:15,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:15,495 INFO L399 BasicCegarLoop]: trace histogram [126, 64, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:15,496 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 403509757, now seen corresponding path program 64 times [2019-09-03 20:10:15,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:15,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 11970 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-03 20:10:17,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:17,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:17,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:10:17,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:10:17,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:17,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:10:17,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 8001 proven. 3906 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-09-03 20:10:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:20,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 65] total 133 [2019-09-03 20:10:20,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 20:10:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 20:10:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4296, Invalid=13260, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:10:20,218 INFO L87 Difference]: Start difference. First operand 263 states and 327 transitions. Second operand 133 states. [2019-09-03 20:10:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:30,887 INFO L93 Difference]: Finished difference Result 609 states and 842 transitions. [2019-09-03 20:10:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 20:10:30,887 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 262 [2019-09-03 20:10:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:30,889 INFO L225 Difference]: With dead ends: 609 [2019-09-03 20:10:30,889 INFO L226 Difference]: Without dead ends: 474 [2019-09-03 20:10:30,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6304 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=12494, Invalid=26512, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 20:10:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-03 20:10:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 267. [2019-09-03 20:10:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-03 20:10:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 332 transitions. [2019-09-03 20:10:33,215 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 332 transitions. Word has length 262 [2019-09-03 20:10:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:33,215 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 332 transitions. [2019-09-03 20:10:33,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 20:10:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 332 transitions. [2019-09-03 20:10:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-03 20:10:33,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:33,216 INFO L399 BasicCegarLoop]: trace histogram [128, 65, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:33,216 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1039272181, now seen corresponding path program 65 times [2019-09-03 20:10:33,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:33,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 12352 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-03 20:10:34,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:34,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:34,998 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:10:35,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 129 check-sat command(s) [2019-09-03 20:10:35,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:35,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:10:35,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 8256 proven. 4032 refuted. 0 times theorem prover too weak. 4096 trivial. 0 not checked. [2019-09-03 20:10:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:38,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 66] total 135 [2019-09-03 20:10:38,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 20:10:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 20:10:38,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4428, Invalid=13662, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:10:38,245 INFO L87 Difference]: Start difference. First operand 267 states and 332 transitions. Second operand 135 states. [2019-09-03 20:10:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:49,420 INFO L93 Difference]: Finished difference Result 615 states and 850 transitions. [2019-09-03 20:10:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 20:10:49,420 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 266 [2019-09-03 20:10:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:49,423 INFO L225 Difference]: With dead ends: 615 [2019-09-03 20:10:49,423 INFO L226 Difference]: Without dead ends: 478 [2019-09-03 20:10:49,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6500 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12884, Invalid=27316, Unknown=0, NotChecked=0, Total=40200 [2019-09-03 20:10:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-03 20:10:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 271. [2019-09-03 20:10:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 20:10:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 337 transitions. [2019-09-03 20:10:51,873 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 337 transitions. Word has length 266 [2019-09-03 20:10:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:51,873 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 337 transitions. [2019-09-03 20:10:51,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 20:10:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 337 transitions. [2019-09-03 20:10:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 20:10:51,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:51,874 INFO L399 BasicCegarLoop]: trace histogram [130, 66, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:51,875 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash 38419309, now seen corresponding path program 66 times [2019-09-03 20:10:51,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:51,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:51,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:51,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 12740 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2019-09-03 20:10:53,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:53,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:10:53,871 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 130 check-sat command(s) [2019-09-03 20:10:53,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:53,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:10:53,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 8515 proven. 4160 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2019-09-03 20:10:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:57,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 67] total 137 [2019-09-03 20:10:57,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-03 20:10:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-03 20:10:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4562, Invalid=14070, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:10:57,029 INFO L87 Difference]: Start difference. First operand 271 states and 337 transitions. Second operand 137 states. [2019-09-03 20:11:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:08,500 INFO L93 Difference]: Finished difference Result 621 states and 858 transitions. [2019-09-03 20:11:08,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 20:11:08,500 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 270 [2019-09-03 20:11:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:08,502 INFO L225 Difference]: With dead ends: 621 [2019-09-03 20:11:08,502 INFO L226 Difference]: Without dead ends: 482 [2019-09-03 20:11:08,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6699 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=13280, Invalid=28132, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 20:11:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-03 20:11:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 275. [2019-09-03 20:11:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-03 20:11:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 342 transitions. [2019-09-03 20:11:11,091 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 342 transitions. Word has length 270 [2019-09-03 20:11:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:11,091 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 342 transitions. [2019-09-03 20:11:11,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-03 20:11:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 342 transitions. [2019-09-03 20:11:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-03 20:11:11,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:11,092 INFO L399 BasicCegarLoop]: trace histogram [132, 67, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:11,093 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 168560997, now seen corresponding path program 67 times [2019-09-03 20:11:11,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:11,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:11,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 13134 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2019-09-03 20:11:12,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:12,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:11:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:13,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:11:13,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 8778 proven. 4290 refuted. 0 times theorem prover too weak. 4356 trivial. 0 not checked. [2019-09-03 20:11:16,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:16,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 68] total 139 [2019-09-03 20:11:16,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 20:11:16,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 20:11:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4698, Invalid=14484, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:11:16,214 INFO L87 Difference]: Start difference. First operand 275 states and 342 transitions. Second operand 139 states. [2019-09-03 20:11:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:28,399 INFO L93 Difference]: Finished difference Result 627 states and 866 transitions. [2019-09-03 20:11:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 20:11:28,399 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 274 [2019-09-03 20:11:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:28,401 INFO L225 Difference]: With dead ends: 627 [2019-09-03 20:11:28,401 INFO L226 Difference]: Without dead ends: 486 [2019-09-03 20:11:28,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6901 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=13682, Invalid=28960, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 20:11:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-03 20:11:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 279. [2019-09-03 20:11:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 20:11:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 347 transitions. [2019-09-03 20:11:31,116 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 347 transitions. Word has length 274 [2019-09-03 20:11:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:31,117 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 347 transitions. [2019-09-03 20:11:31,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 20:11:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 347 transitions. [2019-09-03 20:11:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-03 20:11:31,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:31,118 INFO L399 BasicCegarLoop]: trace histogram [134, 68, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:31,118 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:31,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash -663366947, now seen corresponding path program 68 times [2019-09-03 20:11:31,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:31,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:31,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:11:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 13534 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2019-09-03 20:11:32,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:32,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:11:33,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:11:33,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:33,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:11:33,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 9045 proven. 4422 refuted. 0 times theorem prover too weak. 4489 trivial. 0 not checked. [2019-09-03 20:11:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:36,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 69] total 141 [2019-09-03 20:11:36,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 20:11:36,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 20:11:36,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4836, Invalid=14904, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:11:36,425 INFO L87 Difference]: Start difference. First operand 279 states and 347 transitions. Second operand 141 states. [2019-09-03 20:11:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:49,001 INFO L93 Difference]: Finished difference Result 633 states and 874 transitions. [2019-09-03 20:11:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-03 20:11:49,001 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 278 [2019-09-03 20:11:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:49,003 INFO L225 Difference]: With dead ends: 633 [2019-09-03 20:11:49,004 INFO L226 Difference]: Without dead ends: 490 [2019-09-03 20:11:49,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7106 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=14090, Invalid=29800, Unknown=0, NotChecked=0, Total=43890 [2019-09-03 20:11:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-03 20:11:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 283. [2019-09-03 20:11:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-03 20:11:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 352 transitions. [2019-09-03 20:11:51,888 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 352 transitions. Word has length 278 [2019-09-03 20:11:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:51,888 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 352 transitions. [2019-09-03 20:11:51,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 20:11:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 352 transitions. [2019-09-03 20:11:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-03 20:11:51,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:51,889 INFO L399 BasicCegarLoop]: trace histogram [136, 69, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:51,889 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash 755890133, now seen corresponding path program 69 times [2019-09-03 20:11:51,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:51,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:51,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:51,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:51,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 13940 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2019-09-03 20:11:53,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:53,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:53,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:11:54,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 137 check-sat command(s) [2019-09-03 20:11:54,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:54,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:11:54,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 9316 proven. 4556 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2019-09-03 20:11:57,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:57,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 70] total 143 [2019-09-03 20:11:57,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-03 20:11:57,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-03 20:11:57,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4976, Invalid=15330, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:11:57,473 INFO L87 Difference]: Start difference. First operand 283 states and 352 transitions. Second operand 143 states. [2019-09-03 20:12:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:12:10,310 INFO L93 Difference]: Finished difference Result 639 states and 882 transitions. [2019-09-03 20:12:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 20:12:10,310 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 282 [2019-09-03 20:12:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:12:10,312 INFO L225 Difference]: With dead ends: 639 [2019-09-03 20:12:10,312 INFO L226 Difference]: Without dead ends: 494 [2019-09-03 20:12:10,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=14504, Invalid=30652, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 20:12:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-03 20:12:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 287. [2019-09-03 20:12:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 20:12:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 357 transitions. [2019-09-03 20:12:13,357 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 357 transitions. Word has length 282 [2019-09-03 20:12:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:12:13,358 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 357 transitions. [2019-09-03 20:12:13,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-03 20:12:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 357 transitions. [2019-09-03 20:12:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-03 20:12:13,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:12:13,359 INFO L399 BasicCegarLoop]: trace histogram [138, 70, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:12:13,359 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:12:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:12:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash -509421491, now seen corresponding path program 70 times [2019-09-03 20:12:13,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:12:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:12:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:13,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:12:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:12:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 14352 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2019-09-03 20:12:15,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:12:15,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:12:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:12:15,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:12:15,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:12:15,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:12:15,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:12:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 9591 proven. 4692 refuted. 0 times theorem prover too weak. 4761 trivial. 0 not checked. [2019-09-03 20:12:18,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:12:18,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 71] total 145 [2019-09-03 20:12:18,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 20:12:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 20:12:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5118, Invalid=15762, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:12:18,983 INFO L87 Difference]: Start difference. First operand 287 states and 357 transitions. Second operand 145 states. [2019-09-03 20:12:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:12:33,011 INFO L93 Difference]: Finished difference Result 645 states and 890 transitions. [2019-09-03 20:12:33,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 20:12:33,012 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 286 [2019-09-03 20:12:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:12:33,014 INFO L225 Difference]: With dead ends: 645 [2019-09-03 20:12:33,014 INFO L226 Difference]: Without dead ends: 498 [2019-09-03 20:12:33,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=14924, Invalid=31516, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 20:12:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-03 20:12:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 291. [2019-09-03 20:12:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-03 20:12:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 362 transitions. [2019-09-03 20:12:36,236 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 362 transitions. Word has length 286 [2019-09-03 20:12:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:12:36,236 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 362 transitions. [2019-09-03 20:12:36,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 20:12:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 362 transitions. [2019-09-03 20:12:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-03 20:12:36,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:12:36,238 INFO L399 BasicCegarLoop]: trace histogram [140, 71, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:12:36,238 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:12:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:12:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1212863557, now seen corresponding path program 71 times [2019-09-03 20:12:36,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:12:36,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:12:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:36,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:12:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:12:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 14770 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2019-09-03 20:12:38,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:12:38,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:12:38,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:12:38,554 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 141 check-sat command(s) [2019-09-03 20:12:38,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:12:38,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:12:38,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:12:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 9870 proven. 4830 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:12:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:12:42,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 72] total 147 [2019-09-03 20:12:42,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 20:12:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 20:12:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5262, Invalid=16200, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:12:42,132 INFO L87 Difference]: Start difference. First operand 291 states and 362 transitions. Second operand 147 states. [2019-09-03 20:12:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:12:56,634 INFO L93 Difference]: Finished difference Result 651 states and 898 transitions. [2019-09-03 20:12:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-03 20:12:56,634 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 290 [2019-09-03 20:12:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:12:56,636 INFO L225 Difference]: With dead ends: 651 [2019-09-03 20:12:56,636 INFO L226 Difference]: Without dead ends: 502 [2019-09-03 20:12:56,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7739 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=15350, Invalid=32392, Unknown=0, NotChecked=0, Total=47742 [2019-09-03 20:12:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-03 20:12:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 295. [2019-09-03 20:12:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 20:12:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 367 transitions. [2019-09-03 20:12:59,973 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 367 transitions. Word has length 290 [2019-09-03 20:12:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:12:59,973 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 367 transitions. [2019-09-03 20:12:59,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 20:12:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 367 transitions. [2019-09-03 20:12:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 20:12:59,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:12:59,975 INFO L399 BasicCegarLoop]: trace histogram [142, 72, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:12:59,975 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:12:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:12:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash 157567933, now seen corresponding path program 72 times [2019-09-03 20:12:59,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:12:59,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:12:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:59,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:12:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:13:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 15194 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2019-09-03 20:13:02,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:13:02,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:13:02,020 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:13:02,304 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 142 check-sat command(s) [2019-09-03 20:13:02,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:13:02,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:13:02,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:13:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 10153 proven. 4970 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2019-09-03 20:13:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:13:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 73] total 149 [2019-09-03 20:13:05,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-03 20:13:05,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-03 20:13:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5408, Invalid=16644, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:13:05,985 INFO L87 Difference]: Start difference. First operand 295 states and 367 transitions. Second operand 149 states. [2019-09-03 20:13:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:13:20,478 INFO L93 Difference]: Finished difference Result 657 states and 906 transitions. [2019-09-03 20:13:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 20:13:20,478 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 294 [2019-09-03 20:13:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:13:20,482 INFO L225 Difference]: With dead ends: 657 [2019-09-03 20:13:20,482 INFO L226 Difference]: Without dead ends: 506 [2019-09-03 20:13:20,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7956 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=15782, Invalid=33280, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 20:13:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-03 20:13:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 299. [2019-09-03 20:13:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-03 20:13:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 372 transitions. [2019-09-03 20:13:23,995 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 372 transitions. Word has length 294 [2019-09-03 20:13:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:13:23,996 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 372 transitions. [2019-09-03 20:13:23,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-03 20:13:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 372 transitions. [2019-09-03 20:13:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-03 20:13:23,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:13:23,997 INFO L399 BasicCegarLoop]: trace histogram [144, 73, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:13:23,997 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:13:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:13:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2120900939, now seen corresponding path program 73 times [2019-09-03 20:13:23,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:13:23,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:13:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:13:23,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:13:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:13:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:13:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 15624 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2019-09-03 20:13:26,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:13:26,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:13:26,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:13:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:13:26,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:13:26,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:13:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 10440 proven. 5112 refuted. 0 times theorem prover too weak. 5184 trivial. 0 not checked. [2019-09-03 20:13:30,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:13:30,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 74] total 151 [2019-09-03 20:13:30,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 20:13:30,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 20:13:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5556, Invalid=17094, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:13:30,033 INFO L87 Difference]: Start difference. First operand 299 states and 372 transitions. Second operand 151 states. [2019-09-03 20:13:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:13:45,051 INFO L93 Difference]: Finished difference Result 663 states and 914 transitions. [2019-09-03 20:13:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-03 20:13:45,051 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 298 [2019-09-03 20:13:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:13:45,053 INFO L225 Difference]: With dead ends: 663 [2019-09-03 20:13:45,053 INFO L226 Difference]: Without dead ends: 510 [2019-09-03 20:13:45,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8176 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=16220, Invalid=34180, Unknown=0, NotChecked=0, Total=50400 [2019-09-03 20:13:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-03 20:13:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 303. [2019-09-03 20:13:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 20:13:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 377 transitions. [2019-09-03 20:13:48,728 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 377 transitions. Word has length 298 [2019-09-03 20:13:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:13:48,729 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 377 transitions. [2019-09-03 20:13:48,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 20:13:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 377 transitions. [2019-09-03 20:13:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-03 20:13:48,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:13:48,730 INFO L399 BasicCegarLoop]: trace histogram [146, 74, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:13:48,730 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:13:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:13:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1613943507, now seen corresponding path program 74 times [2019-09-03 20:13:48,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:13:48,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:13:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:13:48,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:13:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:13:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:13:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 16060 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2019-09-03 20:13:50,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:13:50,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:13:50,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:13:50,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:13:50,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:13:50,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:13:50,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:13:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 10731 proven. 5256 refuted. 0 times theorem prover too weak. 5329 trivial. 0 not checked. [2019-09-03 20:13:54,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:13:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 75] total 153 [2019-09-03 20:13:54,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 20:13:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 20:13:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5706, Invalid=17550, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:13:54,876 INFO L87 Difference]: Start difference. First operand 303 states and 377 transitions. Second operand 153 states. [2019-09-03 20:14:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:14:10,573 INFO L93 Difference]: Finished difference Result 669 states and 922 transitions. [2019-09-03 20:14:10,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-03 20:14:10,573 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 302 [2019-09-03 20:14:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:14:10,576 INFO L225 Difference]: With dead ends: 669 [2019-09-03 20:14:10,576 INFO L226 Difference]: Without dead ends: 514 [2019-09-03 20:14:10,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8399 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=16664, Invalid=35092, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 20:14:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-03 20:14:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 307. [2019-09-03 20:14:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-03 20:14:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2019-09-03 20:14:14,431 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 302 [2019-09-03 20:14:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:14:14,431 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2019-09-03 20:14:14,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 20:14:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2019-09-03 20:14:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-03 20:14:14,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:14:14,433 INFO L399 BasicCegarLoop]: trace histogram [148, 75, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:14:14,433 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:14:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:14:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1128355621, now seen corresponding path program 75 times [2019-09-03 20:14:14,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:14:14,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:14:14,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:14,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:14:14,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:14:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 16502 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2019-09-03 20:14:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:14:16,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:14:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:14:16,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 149 check-sat command(s) [2019-09-03 20:14:16,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:14:16,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 20:14:16,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:14:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 11026 proven. 5402 refuted. 0 times theorem prover too weak. 5476 trivial. 0 not checked. [2019-09-03 20:14:20,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:14:20,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 76] total 155 [2019-09-03 20:14:20,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-03 20:14:20,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-03 20:14:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5858, Invalid=18012, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 20:14:20,908 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 155 states. [2019-09-03 20:14:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:14:37,332 INFO L93 Difference]: Finished difference Result 675 states and 930 transitions. [2019-09-03 20:14:37,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 20:14:37,332 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 306 [2019-09-03 20:14:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:14:37,334 INFO L225 Difference]: With dead ends: 675 [2019-09-03 20:14:37,335 INFO L226 Difference]: Without dead ends: 518 [2019-09-03 20:14:37,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=17114, Invalid=36016, Unknown=0, NotChecked=0, Total=53130 [2019-09-03 20:14:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-03 20:14:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 311. [2019-09-03 20:14:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 20:14:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 387 transitions. [2019-09-03 20:14:41,374 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 387 transitions. Word has length 306 [2019-09-03 20:14:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:14:41,374 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 387 transitions. [2019-09-03 20:14:41,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-03 20:14:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 387 transitions. [2019-09-03 20:14:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-03 20:14:41,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:14:41,376 INFO L399 BasicCegarLoop]: trace histogram [150, 76, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:14:41,376 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:14:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:14:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash 426802333, now seen corresponding path program 76 times [2019-09-03 20:14:41,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:14:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:14:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:41,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:14:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:14:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:14:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 16950 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2019-09-03 20:14:43,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:14:43,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:14:43,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:14:43,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:14:43,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:14:43,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:14:43,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:14:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 11325 proven. 5550 refuted. 0 times theorem prover too weak. 5625 trivial. 0 not checked. [2019-09-03 20:14:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:14:47,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 77] total 157 [2019-09-03 20:14:47,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 20:14:47,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 20:14:47,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6012, Invalid=18480, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 20:14:47,919 INFO L87 Difference]: Start difference. First operand 311 states and 387 transitions. Second operand 157 states. [2019-09-03 20:15:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:04,786 INFO L93 Difference]: Finished difference Result 681 states and 938 transitions. [2019-09-03 20:15:04,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-03 20:15:04,786 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 310 [2019-09-03 20:15:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:04,788 INFO L225 Difference]: With dead ends: 681 [2019-09-03 20:15:04,789 INFO L226 Difference]: Without dead ends: 522 [2019-09-03 20:15:04,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8854 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17570, Invalid=36952, Unknown=0, NotChecked=0, Total=54522 [2019-09-03 20:15:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-03 20:15:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 315. [2019-09-03 20:15:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-03 20:15:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 392 transitions. [2019-09-03 20:15:09,049 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 392 transitions. Word has length 310 [2019-09-03 20:15:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:09,049 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 392 transitions. [2019-09-03 20:15:09,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 20:15:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 392 transitions. [2019-09-03 20:15:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-03 20:15:09,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:09,051 INFO L399 BasicCegarLoop]: trace histogram [152, 77, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:09,051 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash -64946795, now seen corresponding path program 77 times [2019-09-03 20:15:09,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:09,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:09,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:09,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:09,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 17404 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2019-09-03 20:15:11,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:15:11,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:15:11,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:15:11,704 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 153 check-sat command(s) [2019-09-03 20:15:11,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:11,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:15:11,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 11628 proven. 5700 refuted. 0 times theorem prover too weak. 5776 trivial. 0 not checked. [2019-09-03 20:15:15,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:15:15,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 78] total 159 [2019-09-03 20:15:15,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 20:15:15,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 20:15:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6168, Invalid=18954, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:15:15,842 INFO L87 Difference]: Start difference. First operand 315 states and 392 transitions. Second operand 159 states. [2019-09-03 20:15:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:33,112 INFO L93 Difference]: Finished difference Result 687 states and 946 transitions. [2019-09-03 20:15:33,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-03 20:15:33,113 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 314 [2019-09-03 20:15:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:33,115 INFO L225 Difference]: With dead ends: 687 [2019-09-03 20:15:33,115 INFO L226 Difference]: Without dead ends: 526 [2019-09-03 20:15:33,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=18032, Invalid=37900, Unknown=0, NotChecked=0, Total=55932 [2019-09-03 20:15:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-03 20:15:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 319. [2019-09-03 20:15:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 20:15:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 397 transitions. [2019-09-03 20:15:37,524 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 397 transitions. Word has length 314 [2019-09-03 20:15:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:37,524 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 397 transitions. [2019-09-03 20:15:37,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 20:15:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 397 transitions. [2019-09-03 20:15:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 20:15:37,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:37,526 INFO L399 BasicCegarLoop]: trace histogram [154, 78, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:37,526 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -815711731, now seen corresponding path program 78 times [2019-09-03 20:15:37,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:37,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 17864 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2019-09-03 20:15:39,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:15:39,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:15:39,923 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:15:40,179 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 154 check-sat command(s) [2019-09-03 20:15:40,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:40,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:15:40,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 11935 proven. 5852 refuted. 0 times theorem prover too weak. 5929 trivial. 0 not checked. [2019-09-03 20:15:44,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:15:44,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 79] total 161 [2019-09-03 20:15:44,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-03 20:15:44,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-03 20:15:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6326, Invalid=19434, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 20:15:44,462 INFO L87 Difference]: Start difference. First operand 319 states and 397 transitions. Second operand 161 states. [2019-09-03 20:16:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:02,337 INFO L93 Difference]: Finished difference Result 693 states and 954 transitions. [2019-09-03 20:16:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-03 20:16:02,337 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 318 [2019-09-03 20:16:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:02,339 INFO L225 Difference]: With dead ends: 693 [2019-09-03 20:16:02,340 INFO L226 Difference]: Without dead ends: 530 [2019-09-03 20:16:02,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9321 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=18500, Invalid=38860, Unknown=0, NotChecked=0, Total=57360 [2019-09-03 20:16:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-03 20:16:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 323. [2019-09-03 20:16:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-03 20:16:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 402 transitions. [2019-09-03 20:16:06,963 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 402 transitions. Word has length 318 [2019-09-03 20:16:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:06,964 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 402 transitions. [2019-09-03 20:16:06,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-03 20:16:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 402 transitions. [2019-09-03 20:16:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-03 20:16:06,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:06,965 INFO L399 BasicCegarLoop]: trace histogram [156, 79, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:06,965 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash -544763387, now seen corresponding path program 79 times [2019-09-03 20:16:06,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:06,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:06,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 18330 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2019-09-03 20:16:09,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:16:09,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:16:09,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:09,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 20:16:09,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 12246 proven. 6006 refuted. 0 times theorem prover too weak. 6084 trivial. 0 not checked. [2019-09-03 20:16:13,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:16:13,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 80] total 163 [2019-09-03 20:16:13,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 20:16:13,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 20:16:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6486, Invalid=19920, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:16:13,855 INFO L87 Difference]: Start difference. First operand 323 states and 402 transitions. Second operand 163 states. [2019-09-03 20:16:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:32,731 INFO L93 Difference]: Finished difference Result 699 states and 962 transitions. [2019-09-03 20:16:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-03 20:16:32,731 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 322 [2019-09-03 20:16:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:32,733 INFO L225 Difference]: With dead ends: 699 [2019-09-03 20:16:32,733 INFO L226 Difference]: Without dead ends: 534 [2019-09-03 20:16:32,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9559 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=18974, Invalid=39832, Unknown=0, NotChecked=0, Total=58806 [2019-09-03 20:16:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-03 20:16:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 327. [2019-09-03 20:16:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 20:16:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 407 transitions. [2019-09-03 20:16:37,549 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 407 transitions. Word has length 322 [2019-09-03 20:16:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:37,550 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 407 transitions. [2019-09-03 20:16:37,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 20:16:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 407 transitions. [2019-09-03 20:16:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-03 20:16:37,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:37,552 INFO L399 BasicCegarLoop]: trace histogram [158, 80, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:37,552 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1087216259, now seen corresponding path program 80 times [2019-09-03 20:16:37,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:37,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:37,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:37,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:37,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 18802 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2019-09-03 20:16:39,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:16:39,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:16:40,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:16:40,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:40,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:40,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:16:40,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 12561 proven. 6162 refuted. 0 times theorem prover too weak. 6241 trivial. 0 not checked. [2019-09-03 20:16:44,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:16:44,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 81] total 165 [2019-09-03 20:16:44,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 20:16:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 20:16:44,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6648, Invalid=20412, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:16:44,567 INFO L87 Difference]: Start difference. First operand 327 states and 407 transitions. Second operand 165 states. [2019-09-03 20:17:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:03,643 INFO L93 Difference]: Finished difference Result 705 states and 970 transitions. [2019-09-03 20:17:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-03 20:17:03,644 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 326 [2019-09-03 20:17:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:03,645 INFO L225 Difference]: With dead ends: 705 [2019-09-03 20:17:03,645 INFO L226 Difference]: Without dead ends: 538 [2019-09-03 20:17:03,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9800 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=19454, Invalid=40816, Unknown=0, NotChecked=0, Total=60270 [2019-09-03 20:17:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-03 20:17:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 331. [2019-09-03 20:17:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-03 20:17:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 412 transitions. [2019-09-03 20:17:08,667 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 412 transitions. Word has length 326 [2019-09-03 20:17:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:08,667 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 412 transitions. [2019-09-03 20:17:08,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 20:17:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 412 transitions. [2019-09-03 20:17:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-03 20:17:08,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:08,669 INFO L399 BasicCegarLoop]: trace histogram [160, 81, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:08,669 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1522002827, now seen corresponding path program 81 times [2019-09-03 20:17:08,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:08,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:08,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:17:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 19280 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2019-09-03 20:17:11,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:17:11,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:17:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:17:11,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 161 check-sat command(s) [2019-09-03 20:17:11,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:11,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:17:11,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 12880 proven. 6320 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2019-09-03 20:17:16,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:17:16,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 82] total 167 [2019-09-03 20:17:16,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-03 20:17:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-03 20:17:16,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6812, Invalid=20910, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:17:16,146 INFO L87 Difference]: Start difference. First operand 331 states and 412 transitions. Second operand 167 states. [2019-09-03 20:17:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:17:36,626 INFO L93 Difference]: Finished difference Result 711 states and 978 transitions. [2019-09-03 20:17:36,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-03 20:17:36,626 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 330 [2019-09-03 20:17:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:17:36,627 INFO L225 Difference]: With dead ends: 711 [2019-09-03 20:17:36,628 INFO L226 Difference]: Without dead ends: 542 [2019-09-03 20:17:36,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10044 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19940, Invalid=41812, Unknown=0, NotChecked=0, Total=61752 [2019-09-03 20:17:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-03 20:17:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 335. [2019-09-03 20:17:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 20:17:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 417 transitions. [2019-09-03 20:17:41,871 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 417 transitions. Word has length 330 [2019-09-03 20:17:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:17:41,871 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 417 transitions. [2019-09-03 20:17:41,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-03 20:17:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 417 transitions. [2019-09-03 20:17:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-03 20:17:41,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:17:41,873 INFO L399 BasicCegarLoop]: trace histogram [162, 82, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:17:41,873 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:17:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:17:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1257701101, now seen corresponding path program 82 times [2019-09-03 20:17:41,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:17:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:17:41,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:41,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:17:41,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:17:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:17:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 19764 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2019-09-03 20:17:44,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:17:44,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:17:44,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:17:44,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:17:44,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:17:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:17:44,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:17:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 13203 proven. 6480 refuted. 0 times theorem prover too weak. 6561 trivial. 0 not checked. [2019-09-03 20:17:49,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:17:49,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 83] total 169 [2019-09-03 20:17:49,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 20:17:49,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 20:17:49,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6978, Invalid=21414, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:17:49,212 INFO L87 Difference]: Start difference. First operand 335 states and 417 transitions. Second operand 169 states.