java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:03:46,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:03:46,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:03:46,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:03:46,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:03:46,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:03:46,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:03:46,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:03:46,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:03:46,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:03:46,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:03:46,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:03:46,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:03:46,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:03:46,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:03:46,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:03:46,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:03:46,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:03:46,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:03:46,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:03:46,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:03:46,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:03:46,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:03:46,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:03:46,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:03:46,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:03:46,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:03:46,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:03:46,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:03:46,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:03:46,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:03:46,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:03:46,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:03:46,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:03:46,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:03:46,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:03:46,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:03:46,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:03:46,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:03:46,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:03:46,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:03:46,537 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:03:46,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:03:46,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:03:46,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:03:46,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:03:46,553 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:03:46,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:03:46,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:03:46,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:03:46,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:03:46,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:03:46,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:03:46,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:03:46,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:03:46,555 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:03:46,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:03:46,555 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:03:46,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:03:46,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:03:46,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:03:46,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:03:46,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:03:46,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:03:46,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:03:46,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:03:46,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:03:46,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:03:46,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:03:46,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:03:46,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:03:46,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:03:46,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:03:46,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:03:46,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:03:46,603 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:03:46,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-08 03:03:46,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9465a6a5e/fcf6df8b2e084215abf4498788611f9e/FLAG0a2e03865 [2019-09-08 03:03:47,090 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:03:47,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-08 03:03:47,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9465a6a5e/fcf6df8b2e084215abf4498788611f9e/FLAG0a2e03865 [2019-09-08 03:03:47,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9465a6a5e/fcf6df8b2e084215abf4498788611f9e [2019-09-08 03:03:47,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:03:47,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:03:47,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:03:47,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:03:47,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:03:47,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fa6ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47, skipping insertion in model container [2019-09-08 03:03:47,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:03:47,531 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:03:47,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:03:47,707 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:03:47,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:03:47,731 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:03:47,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47 WrapperNode [2019-09-08 03:03:47,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:03:47,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:03:47,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:03:47,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:03:47,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... [2019-09-08 03:03:47,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:03:47,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:03:47,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:03:47,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:03:47,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:03:47,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:03:47,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:03:47,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 03:03:47,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:03:47,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:03:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 03:03:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 03:03:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:03:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:03:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:03:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:03:48,073 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:03:48,073 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 03:03:48,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:03:48 BoogieIcfgContainer [2019-09-08 03:03:48,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:03:48,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:03:48,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:03:48,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:03:48,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:03:47" (1/3) ... [2019-09-08 03:03:48,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ef8ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:03:48, skipping insertion in model container [2019-09-08 03:03:48,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:47" (2/3) ... [2019-09-08 03:03:48,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ef8ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:03:48, skipping insertion in model container [2019-09-08 03:03:48,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:03:48" (3/3) ... [2019-09-08 03:03:48,096 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-09-08 03:03:48,125 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:03:48,143 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:03:48,182 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:03:48,214 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:03:48,215 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:03:48,215 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:03:48,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:03:48,216 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:03:48,216 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:03:48,216 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:03:48,216 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:03:48,216 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:03:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-08 03:03:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 03:03:48,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:48,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:48,240 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-08 03:03:48,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:48,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:03:48,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:03:48,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 03:03:48,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 03:03:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 03:03:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 03:03:48,359 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-08 03:03:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:48,378 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-08 03:03:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 03:03:48,379 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 03:03:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:48,388 INFO L225 Difference]: With dead ends: 32 [2019-09-08 03:03:48,388 INFO L226 Difference]: Without dead ends: 13 [2019-09-08 03:03:48,391 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-08 03:03:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-08 03:03:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-08 03:03:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 03:03:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-08 03:03:48,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-08 03:03:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:48,430 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-08 03:03:48,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 03:03:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-08 03:03:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 03:03:48,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:48,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:48,432 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-09-08 03:03:48,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:03:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:03:48,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:03:48,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:03:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:03:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:03:48,519 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-09-08 03:03:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:48,576 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-09-08 03:03:48,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:03:48,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 03:03:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:48,578 INFO L225 Difference]: With dead ends: 22 [2019-09-08 03:03:48,578 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 03:03:48,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:03:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 03:03:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 03:03:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 03:03:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-08 03:03:48,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-08 03:03:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:48,586 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-08 03:03:48,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:03:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-08 03:03:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 03:03:48,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:48,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:48,588 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-09-08 03:03:48,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:03:48,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:03:48,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:03:48,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:03:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:03:48,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:03:48,611 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-08 03:03:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:48,635 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-08 03:03:48,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:03:48,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-08 03:03:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:48,636 INFO L225 Difference]: With dead ends: 32 [2019-09-08 03:03:48,637 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 03:03:48,637 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-08 03:03:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 03:03:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-08 03:03:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 03:03:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-08 03:03:48,642 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-09-08 03:03:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:48,643 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-08 03:03:48,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:03:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-08 03:03:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 03:03:48,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:48,644 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:48,644 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-09-08 03:03:48,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 03:03:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:48,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:48,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:48,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:03:48,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 03:03:48,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:48,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 03:03:48,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:03:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:03:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:03:48,775 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-09-08 03:03:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:48,801 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-08 03:03:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:03:48,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-08 03:03:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:48,803 INFO L225 Difference]: With dead ends: 35 [2019-09-08 03:03:48,803 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 03:03:48,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:03:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 03:03:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-08 03:03:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 03:03:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-08 03:03:48,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-09-08 03:03:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:48,810 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-08 03:03:48,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:03:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-08 03:03:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 03:03:48,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:48,812 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:48,812 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-09-08 03:03:48,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 03:03:48,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:48,861 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-08 03:03:48,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:03:48,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:03:48,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:48,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:03:48,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 03:03:48,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:48,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 03:03:48,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:03:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:03:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:03:48,916 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-08 03:03:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:48,948 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-08 03:03:48,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:03:48,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-08 03:03:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:48,949 INFO L225 Difference]: With dead ends: 38 [2019-09-08 03:03:48,949 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 03:03:48,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:03:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 03:03:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 03:03:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 03:03:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-08 03:03:48,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-09-08 03:03:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:48,956 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-08 03:03:48,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:03:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-08 03:03:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 03:03:48,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:48,957 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:48,957 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1243468678, now seen corresponding path program 3 times [2019-09-08 03:03:48,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:48,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 03:03:49,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:49,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:49,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:49,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 03:03:49,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:49,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:03:49,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:03:49,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:49,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-08 03:03:49,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:03:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:03:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:03:49,129 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2019-09-08 03:03:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:49,311 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2019-09-08 03:03:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:03:49,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-08 03:03:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:49,314 INFO L225 Difference]: With dead ends: 55 [2019-09-08 03:03:49,314 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 03:03:49,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:03:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 03:03:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-09-08 03:03:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 03:03:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-08 03:03:49,331 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2019-09-08 03:03:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:49,332 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-08 03:03:49,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:03:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-08 03:03:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 03:03:49,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:49,338 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:49,339 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash 546656573, now seen corresponding path program 4 times [2019-09-08 03:03:49,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:49,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:49,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:03:49,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:49,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:03:49,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:03:49,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:49,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 03:03:49,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:03:49,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:49,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 03:03:49,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:03:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:03:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:03:49,478 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-09-08 03:03:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:49,511 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-08 03:03:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:03:49,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-09-08 03:03:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:49,512 INFO L225 Difference]: With dead ends: 56 [2019-09-08 03:03:49,512 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 03:03:49,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:03:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 03:03:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-08 03:03:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 03:03:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-08 03:03:49,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 33 [2019-09-08 03:03:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:49,519 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-08 03:03:49,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:03:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-08 03:03:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 03:03:49,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:49,521 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:49,521 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash 508995066, now seen corresponding path program 5 times [2019-09-08 03:03:49,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:49,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:49,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:49,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:03:49,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:49,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:49,619 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:03:49,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-08 03:03:49,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:49,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:03:49,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:03:49,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:49,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 03:03:49,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:03:49,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:03:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:03:49,673 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-09-08 03:03:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:49,711 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-08 03:03:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:03:49,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-08 03:03:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:49,713 INFO L225 Difference]: With dead ends: 59 [2019-09-08 03:03:49,713 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 03:03:49,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:03:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 03:03:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-08 03:03:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 03:03:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-08 03:03:49,720 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 36 [2019-09-08 03:03:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:49,720 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-08 03:03:49,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:03:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-08 03:03:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 03:03:49,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:49,722 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:49,722 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:49,722 INFO L82 PathProgramCache]: Analyzing trace with hash -478495715, now seen corresponding path program 6 times [2019-09-08 03:03:49,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:49,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:49,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:49,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:49,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:03:49,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:49,798 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-08 03:03:49,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:49,837 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-08 03:03:49,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:49,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 03:03:49,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:03:49,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:49,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-09-08 03:03:49,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:03:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:03:49,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:03:49,912 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 14 states. [2019-09-08 03:03:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:50,111 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2019-09-08 03:03:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 03:03:50,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-09-08 03:03:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:50,113 INFO L225 Difference]: With dead ends: 75 [2019-09-08 03:03:50,114 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 03:03:50,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-09-08 03:03:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 03:03:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-09-08 03:03:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 03:03:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-09-08 03:03:50,129 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 39 [2019-09-08 03:03:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:50,130 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-09-08 03:03:50,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:03:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-09-08 03:03:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 03:03:50,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:50,132 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:50,132 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1304445755, now seen corresponding path program 7 times [2019-09-08 03:03:50,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:03:50,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:50,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:50,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:03:50,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:03:50,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:50,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 03:03:50,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:03:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:03:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:03:50,339 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 10 states. [2019-09-08 03:03:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:50,371 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-08 03:03:50,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:03:50,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-08 03:03:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:50,374 INFO L225 Difference]: With dead ends: 71 [2019-09-08 03:03:50,374 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 03:03:50,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:03:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 03:03:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-08 03:03:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 03:03:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-08 03:03:50,382 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 45 [2019-09-08 03:03:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:50,392 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-08 03:03:50,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:03:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-08 03:03:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 03:03:50,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:50,394 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:50,394 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash -958438280, now seen corresponding path program 8 times [2019-09-08 03:03:50,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:50,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:03:50,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:50,505 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-08 03:03:50,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:50,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:03:50,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:50,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 03:03:50,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:03:50,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:50,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 03:03:50,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:03:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:03:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:03:50,572 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 11 states. [2019-09-08 03:03:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:50,623 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-09-08 03:03:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:03:50,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-08 03:03:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:50,627 INFO L225 Difference]: With dead ends: 74 [2019-09-08 03:03:50,627 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 03:03:50,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:03:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 03:03:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-08 03:03:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 03:03:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-09-08 03:03:50,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 48 [2019-09-08 03:03:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:50,634 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-09-08 03:03:50,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:03:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-09-08 03:03:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 03:03:50,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:50,636 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:50,636 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash -730046949, now seen corresponding path program 9 times [2019-09-08 03:03:50,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:50,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:50,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:50,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 125 proven. 126 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:03:50,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:50,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:50,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:50,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-08 03:03:50,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:50,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:03:50,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 203 proven. 57 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 03:03:50,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:50,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-08 03:03:50,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 03:03:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 03:03:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-09-08 03:03:50,955 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 22 states. [2019-09-08 03:03:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:51,316 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2019-09-08 03:03:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:03:51,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-09-08 03:03:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:51,319 INFO L225 Difference]: With dead ends: 157 [2019-09-08 03:03:51,319 INFO L226 Difference]: Without dead ends: 136 [2019-09-08 03:03:51,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=1235, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 03:03:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-08 03:03:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 70. [2019-09-08 03:03:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-08 03:03:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-08 03:03:51,331 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 51 [2019-09-08 03:03:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:51,331 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-08 03:03:51,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 03:03:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-08 03:03:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 03:03:51,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:51,333 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:51,333 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash -346376131, now seen corresponding path program 10 times [2019-09-08 03:03:51,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:51,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:51,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:51,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:51,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:51,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:03:51,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:51,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 03:03:51,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:03:51,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:51,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 03:03:51,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:03:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:03:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:03:51,545 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 13 states. [2019-09-08 03:03:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:51,600 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-09-08 03:03:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:03:51,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-09-08 03:03:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:51,602 INFO L225 Difference]: With dead ends: 110 [2019-09-08 03:03:51,602 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 03:03:51,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:03:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 03:03:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-08 03:03:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 03:03:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-09-08 03:03:51,610 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 69 [2019-09-08 03:03:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:51,611 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-09-08 03:03:51,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:03:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-09-08 03:03:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 03:03:51,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:51,612 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:51,612 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1894331002, now seen corresponding path program 11 times [2019-09-08 03:03:51,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:51,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:51,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:51,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:51,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:51,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:51,734 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:03:51,772 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-08 03:03:51,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:51,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:03:51,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:51,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:51,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 03:03:51,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:03:51,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:03:51,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:03:51,802 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 14 states. [2019-09-08 03:03:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:51,848 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-09-08 03:03:51,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:03:51,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-09-08 03:03:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:51,850 INFO L225 Difference]: With dead ends: 113 [2019-09-08 03:03:51,850 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 03:03:51,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:03:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 03:03:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-08 03:03:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 03:03:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-09-08 03:03:51,858 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 72 [2019-09-08 03:03:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:51,858 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-09-08 03:03:51,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:03:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-09-08 03:03:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 03:03:51,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:51,860 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:51,860 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1876151523, now seen corresponding path program 12 times [2019-09-08 03:03:51,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:51,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:51,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:52,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 03:03:52,028 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:03:52,067 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-08 03:03:52,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:52,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:03:52,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:52,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 03:03:52,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:03:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:03:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:03:52,106 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 15 states. [2019-09-08 03:03:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:52,160 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-08 03:03:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:03:52,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2019-09-08 03:03:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:52,161 INFO L225 Difference]: With dead ends: 116 [2019-09-08 03:03:52,161 INFO L226 Difference]: Without dead ends: 80 [2019-09-08 03:03:52,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:03:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-08 03:03:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-08 03:03:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 03:03:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-08 03:03:52,169 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 75 [2019-09-08 03:03:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:52,169 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-08 03:03:52,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:03:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-08 03:03:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 03:03:52,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:52,170 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:52,170 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2041361510, now seen corresponding path program 13 times [2019-09-08 03:03:52,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:52,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:52,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:52,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:52,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:52,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 03:03:52,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:52,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:52,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 03:03:52,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 03:03:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 03:03:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:03:52,373 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 16 states. [2019-09-08 03:03:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:52,435 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-09-08 03:03:52,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:03:52,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-09-08 03:03:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:52,436 INFO L225 Difference]: With dead ends: 119 [2019-09-08 03:03:52,436 INFO L226 Difference]: Without dead ends: 83 [2019-09-08 03:03:52,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:03:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-08 03:03:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-08 03:03:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 03:03:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-09-08 03:03:52,448 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 78 [2019-09-08 03:03:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:52,448 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-09-08 03:03:52,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 03:03:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-09-08 03:03:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 03:03:52,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:52,450 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 14, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:52,450 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1779563011, now seen corresponding path program 14 times [2019-09-08 03:03:52,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:52,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:52,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:52,639 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) [2019-09-08 03:03:52,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:52,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:03:52,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:52,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:03:52,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:52,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:52,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 03:03:52,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 03:03:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 03:03:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:03:52,740 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 17 states. [2019-09-08 03:03:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:52,790 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2019-09-08 03:03:52,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:03:52,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-08 03:03:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:52,792 INFO L225 Difference]: With dead ends: 122 [2019-09-08 03:03:52,792 INFO L226 Difference]: Without dead ends: 86 [2019-09-08 03:03:52,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:03:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-08 03:03:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-08 03:03:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 03:03:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2019-09-08 03:03:52,805 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 81 [2019-09-08 03:03:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:52,806 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2019-09-08 03:03:52,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 03:03:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2019-09-08 03:03:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 03:03:52,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:52,807 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 15, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:52,807 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2093878458, now seen corresponding path program 15 times [2019-09-08 03:03:52,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:52,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:52,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:52,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:52,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 438 proven. 345 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:53,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:53,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:03:53,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-08 03:03:53,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:53,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 03:03:53,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 24 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:03:53,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:53,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 27 [2019-09-08 03:03:53,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 03:03:53,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 03:03:53,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:03:53,294 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 27 states. [2019-09-08 03:03:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:53,365 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2019-09-08 03:03:53,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 03:03:53,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2019-09-08 03:03:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:53,366 INFO L225 Difference]: With dead ends: 152 [2019-09-08 03:03:53,366 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 03:03:53,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:03:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 03:03:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-08 03:03:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 03:03:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-09-08 03:03:53,373 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 84 [2019-09-08 03:03:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:53,373 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-09-08 03:03:53,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 03:03:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-09-08 03:03:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 03:03:53,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:53,375 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:53,375 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -711742886, now seen corresponding path program 16 times [2019-09-08 03:03:53,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:53,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 718 proven. 950 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:53,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:53,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:53,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:03:53,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:03:53,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:53,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 03:03:53,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 718 proven. 950 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:53,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:53,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 03:03:53,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 03:03:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 03:03:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:03:53,834 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 28 states. [2019-09-08 03:03:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:53,923 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2019-09-08 03:03:53,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 03:03:53,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2019-09-08 03:03:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:53,924 INFO L225 Difference]: With dead ends: 155 [2019-09-08 03:03:53,924 INFO L226 Difference]: Without dead ends: 119 [2019-09-08 03:03:53,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:03:53,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-08 03:03:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-08 03:03:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 03:03:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-09-08 03:03:53,931 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 114 [2019-09-08 03:03:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:53,931 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-09-08 03:03:53,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 03:03:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-09-08 03:03:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 03:03:53,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:53,932 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:53,933 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 700460861, now seen corresponding path program 17 times [2019-09-08 03:03:53,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:53,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:53,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:53,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:53,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 746 proven. 1027 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:54,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:54,294 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-08 03:03:54,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:03:54,378 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 03:03:54,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:54,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 03:03:54,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 746 proven. 1027 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:54,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:54,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 03:03:54,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 03:03:54,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 03:03:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:03:54,409 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 29 states. [2019-09-08 03:03:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:54,504 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2019-09-08 03:03:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 03:03:54,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 117 [2019-09-08 03:03:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:54,509 INFO L225 Difference]: With dead ends: 158 [2019-09-08 03:03:54,509 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 03:03:54,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:03:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 03:03:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-08 03:03:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-08 03:03:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2019-09-08 03:03:54,515 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 117 [2019-09-08 03:03:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:54,516 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2019-09-08 03:03:54,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 03:03:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2019-09-08 03:03:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:03:54,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:54,517 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:54,518 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:54,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1837343878, now seen corresponding path program 18 times [2019-09-08 03:03:54,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:54,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:54,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:54,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:54,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:54,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:54,977 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) [2019-09-08 03:03:54,997 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:55,065 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 03:03:55,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:55,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:03:55,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 774 proven. 1107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:55,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:55,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 03:03:55,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 03:03:55,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 03:03:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:03:55,102 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 30 states. [2019-09-08 03:03:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:55,190 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2019-09-08 03:03:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 03:03:55,191 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 120 [2019-09-08 03:03:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:55,192 INFO L225 Difference]: With dead ends: 161 [2019-09-08 03:03:55,192 INFO L226 Difference]: Without dead ends: 125 [2019-09-08 03:03:55,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:03:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-08 03:03:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-08 03:03:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-08 03:03:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-09-08 03:03:55,199 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 120 [2019-09-08 03:03:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:55,199 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-09-08 03:03:55,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 03:03:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-09-08 03:03:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 03:03:55,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:55,201 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:55,201 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1269011939, now seen corresponding path program 19 times [2019-09-08 03:03:55,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:55,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:55,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:55,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:55,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:03:55,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:55,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:55,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 03:03:55,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 03:03:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 03:03:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:03:55,795 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 31 states. [2019-09-08 03:03:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:55,896 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2019-09-08 03:03:55,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:03:55,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-09-08 03:03:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:55,898 INFO L225 Difference]: With dead ends: 164 [2019-09-08 03:03:55,898 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 03:03:55,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:03:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 03:03:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-08 03:03:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 03:03:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2019-09-08 03:03:55,905 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 123 [2019-09-08 03:03:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:55,905 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2019-09-08 03:03:55,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 03:03:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2019-09-08 03:03:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:03:55,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:55,907 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:55,907 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash -853298022, now seen corresponding path program 20 times [2019-09-08 03:03:55,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:55,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:56,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:56,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:56,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:56,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:03:56,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:56,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 03:03:56,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:56,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:56,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 03:03:56,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 03:03:56,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 03:03:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:03:56,510 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 32 states. [2019-09-08 03:03:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:56,618 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2019-09-08 03:03:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:03:56,619 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-09-08 03:03:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:56,620 INFO L225 Difference]: With dead ends: 167 [2019-09-08 03:03:56,620 INFO L226 Difference]: Without dead ends: 131 [2019-09-08 03:03:56,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:03:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-08 03:03:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-08 03:03:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-08 03:03:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-09-08 03:03:56,627 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 126 [2019-09-08 03:03:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:56,628 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-09-08 03:03:56,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 03:03:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-09-08 03:03:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 03:03:56,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:56,629 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:56,630 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288957, now seen corresponding path program 21 times [2019-09-08 03:03:56,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:56,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 858 proven. 1365 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:03:57,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:57,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:57,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:57,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-08 03:03:57,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:57,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 03:03:57,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1481 proven. 262 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-08 03:03:57,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:57,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13] total 44 [2019-09-08 03:03:57,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 03:03:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 03:03:57,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=1287, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 03:03:57,535 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 44 states. [2019-09-08 03:03:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:58,328 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2019-09-08 03:03:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 03:03:58,329 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 129 [2019-09-08 03:03:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:58,330 INFO L225 Difference]: With dead ends: 201 [2019-09-08 03:03:58,330 INFO L226 Difference]: Without dead ends: 165 [2019-09-08 03:03:58,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2049, Invalid=5091, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 03:03:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-08 03:03:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2019-09-08 03:03:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-08 03:03:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-09-08 03:03:58,340 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 129 [2019-09-08 03:03:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:58,340 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-09-08 03:03:58,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 03:03:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-09-08 03:03:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:03:58,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:58,342 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 31, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:58,342 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash 403855515, now seen corresponding path program 22 times [2019-09-08 03:03:58,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:58,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:58,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-08 03:03:58,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:58,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:58,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:03:58,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:03:58,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:58,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 03:03:58,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:03:58,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:58,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 03:03:58,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 03:03:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 03:03:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:03:58,905 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 34 states. [2019-09-08 03:03:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:59,005 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2019-09-08 03:03:59,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 03:03:59,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-08 03:03:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:59,007 INFO L225 Difference]: With dead ends: 179 [2019-09-08 03:03:59,007 INFO L226 Difference]: Without dead ends: 140 [2019-09-08 03:03:59,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:03:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-08 03:03:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-08 03:03:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 03:03:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2019-09-08 03:03:59,014 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 135 [2019-09-08 03:03:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:59,015 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2019-09-08 03:03:59,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 03:03:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2019-09-08 03:03:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:03:59,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:59,016 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 32, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:59,016 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1808478312, now seen corresponding path program 23 times [2019-09-08 03:03:59,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:59,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:59,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-08 03:03:59,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:59,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:03:59,582 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:03:59,685 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-08 03:03:59,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:59,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 03:03:59,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-08 03:03:59,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:59,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 03:03:59,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 03:03:59,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 03:03:59,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:03:59,722 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 35 states. [2019-09-08 03:03:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:59,819 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2019-09-08 03:03:59,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 03:03:59,819 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-09-08 03:03:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:59,821 INFO L225 Difference]: With dead ends: 182 [2019-09-08 03:03:59,821 INFO L226 Difference]: Without dead ends: 143 [2019-09-08 03:03:59,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:03:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-08 03:03:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-08 03:03:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-08 03:03:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2019-09-08 03:03:59,828 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 138 [2019-09-08 03:03:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:59,828 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2019-09-08 03:03:59,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 03:03:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2019-09-08 03:03:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:03:59,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:59,830 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 33, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:59,830 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1122605947, now seen corresponding path program 24 times [2019-09-08 03:03:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:59,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:59,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1043 proven. 1650 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-08 03:04:00,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:00,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:04:00,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:00,595 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2019-09-08 03:04:00,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:00,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 03:04:00,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 2486 proven. 321 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 03:04:01,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:01,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2019-09-08 03:04:01,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 03:04:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 03:04:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 03:04:01,501 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 70 states. [2019-09-08 03:04:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:03,340 INFO L93 Difference]: Finished difference Result 967 states and 1266 transitions. [2019-09-08 03:04:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 03:04:03,340 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 141 [2019-09-08 03:04:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:03,345 INFO L225 Difference]: With dead ends: 967 [2019-09-08 03:04:03,345 INFO L226 Difference]: Without dead ends: 928 [2019-09-08 03:04:03,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3837, Invalid=14795, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 03:04:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-08 03:04:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 214. [2019-09-08 03:04:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 03:04:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2019-09-08 03:04:03,372 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 248 transitions. Word has length 141 [2019-09-08 03:04:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:03,372 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 248 transitions. [2019-09-08 03:04:03,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 03:04:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 248 transitions. [2019-09-08 03:04:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 03:04:03,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:03,375 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:03,375 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1937984451, now seen corresponding path program 25 times [2019-09-08 03:04:03,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:03,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:03,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:03,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:03,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 3466 proven. 1751 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:03,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:03,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:03,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:04,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 03:04:04,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 3466 proven. 1751 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:04:04,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:04,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 03:04:04,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 03:04:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 03:04:04,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:04:04,089 INFO L87 Difference]: Start difference. First operand 214 states and 248 transitions. Second operand 37 states. [2019-09-08 03:04:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:04,208 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2019-09-08 03:04:04,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 03:04:04,208 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 213 [2019-09-08 03:04:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:04,210 INFO L225 Difference]: With dead ends: 326 [2019-09-08 03:04:04,210 INFO L226 Difference]: Without dead ends: 218 [2019-09-08 03:04:04,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:04:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-08 03:04:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-08 03:04:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-08 03:04:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2019-09-08 03:04:04,226 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 213 [2019-09-08 03:04:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:04,226 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2019-09-08 03:04:04,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 03:04:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2019-09-08 03:04:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 03:04:04,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:04,229 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:04,229 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash 13649018, now seen corresponding path program 26 times [2019-09-08 03:04:04,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:04,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:04,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:04,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3566 proven. 1855 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:04,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:04,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:04:04,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:04:04,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:04,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 03:04:04,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3566 proven. 1855 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:04,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:04,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 03:04:04,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 03:04:04,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 03:04:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:04:04,955 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand 38 states. [2019-09-08 03:04:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:05,072 INFO L93 Difference]: Finished difference Result 329 states and 398 transitions. [2019-09-08 03:04:05,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 03:04:05,072 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 216 [2019-09-08 03:04:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:05,074 INFO L225 Difference]: With dead ends: 329 [2019-09-08 03:04:05,074 INFO L226 Difference]: Without dead ends: 221 [2019-09-08 03:04:05,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:04:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-08 03:04:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-09-08 03:04:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-08 03:04:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2019-09-08 03:04:05,090 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 216 [2019-09-08 03:04:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:05,090 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2019-09-08 03:04:05,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 03:04:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2019-09-08 03:04:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 03:04:05,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:05,093 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 36, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:05,093 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash 154038045, now seen corresponding path program 27 times [2019-09-08 03:04:05,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:05,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:05,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:05,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:05,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 3666 proven. 1962 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:05,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:05,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:05,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:04:06,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-08 03:04:06,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:06,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 03:04:06,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 3666 proven. 1962 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:06,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:06,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 03:04:06,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 03:04:06,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 03:04:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 03:04:06,081 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand 39 states. [2019-09-08 03:04:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:06,199 INFO L93 Difference]: Finished difference Result 332 states and 401 transitions. [2019-09-08 03:04:06,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:04:06,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 219 [2019-09-08 03:04:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:06,200 INFO L225 Difference]: With dead ends: 332 [2019-09-08 03:04:06,200 INFO L226 Difference]: Without dead ends: 224 [2019-09-08 03:04:06,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 03:04:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-08 03:04:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-08 03:04:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 03:04:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 257 transitions. [2019-09-08 03:04:06,215 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 257 transitions. Word has length 219 [2019-09-08 03:04:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:06,215 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 257 transitions. [2019-09-08 03:04:06,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 03:04:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 257 transitions. [2019-09-08 03:04:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 03:04:06,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:06,217 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 37, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:06,217 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash -814604902, now seen corresponding path program 28 times [2019-09-08 03:04:06,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:06,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:06,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 3766 proven. 2072 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:06,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:06,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:04:06,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:06,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:04:06,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:06,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 03:04:06,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 3766 proven. 2072 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:06,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 03:04:06,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 03:04:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 03:04:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 03:04:06,961 INFO L87 Difference]: Start difference. First operand 223 states and 257 transitions. Second operand 40 states. [2019-09-08 03:04:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:07,059 INFO L93 Difference]: Finished difference Result 335 states and 404 transitions. [2019-09-08 03:04:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 03:04:07,059 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 222 [2019-09-08 03:04:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:07,061 INFO L225 Difference]: With dead ends: 335 [2019-09-08 03:04:07,061 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 03:04:07,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 03:04:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 03:04:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-09-08 03:04:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 03:04:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 260 transitions. [2019-09-08 03:04:07,078 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 260 transitions. Word has length 222 [2019-09-08 03:04:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:07,078 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 260 transitions. [2019-09-08 03:04:07,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 03:04:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 260 transitions. [2019-09-08 03:04:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 03:04:07,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:07,080 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 38, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:07,081 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash 228622845, now seen corresponding path program 29 times [2019-09-08 03:04:07,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:07,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:07,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:07,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3866 proven. 2185 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:07,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:07,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:07,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:04:07,930 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-08 03:04:07,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:07,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 03:04:07,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3866 proven. 2185 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:04:07,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:07,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 03:04:07,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 03:04:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 03:04:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 03:04:07,996 INFO L87 Difference]: Start difference. First operand 226 states and 260 transitions. Second operand 41 states. [2019-09-08 03:04:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:08,138 INFO L93 Difference]: Finished difference Result 338 states and 407 transitions. [2019-09-08 03:04:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 03:04:08,139 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2019-09-08 03:04:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:08,140 INFO L225 Difference]: With dead ends: 338 [2019-09-08 03:04:08,140 INFO L226 Difference]: Without dead ends: 230 [2019-09-08 03:04:08,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 03:04:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-08 03:04:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-08 03:04:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-08 03:04:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 263 transitions. [2019-09-08 03:04:08,167 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 263 transitions. Word has length 225 [2019-09-08 03:04:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:08,169 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 263 transitions. [2019-09-08 03:04:08,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 03:04:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 263 transitions. [2019-09-08 03:04:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 03:04:08,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:08,171 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 39, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:08,171 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:08,172 INFO L82 PathProgramCache]: Analyzing trace with hash 643079866, now seen corresponding path program 30 times [2019-09-08 03:04:08,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:08,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:08,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 3966 proven. 2301 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-08 03:04:09,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:09,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:09,215 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:04:09,374 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-08 03:04:09,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:09,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 03:04:09,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 4450 proven. 3334 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:04:10,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:10,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 82 [2019-09-08 03:04:10,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 03:04:10,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 03:04:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 03:04:10,706 INFO L87 Difference]: Start difference. First operand 229 states and 263 transitions. Second operand 82 states. [2019-09-08 03:04:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:13,143 INFO L93 Difference]: Finished difference Result 959 states and 1238 transitions. [2019-09-08 03:04:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-08 03:04:13,144 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 228 [2019-09-08 03:04:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:13,150 INFO L225 Difference]: With dead ends: 959 [2019-09-08 03:04:13,151 INFO L226 Difference]: Without dead ends: 851 [2019-09-08 03:04:13,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6046 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5235, Invalid=20525, Unknown=0, NotChecked=0, Total=25760 [2019-09-08 03:04:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-09-08 03:04:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 250. [2019-09-08 03:04:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-08 03:04:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2019-09-08 03:04:13,194 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 228 [2019-09-08 03:04:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:13,194 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2019-09-08 03:04:13,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 03:04:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2019-09-08 03:04:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 03:04:13,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:13,198 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:13,199 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash -974894275, now seen corresponding path program 31 times [2019-09-08 03:04:13,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:13,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:13,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:13,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 4798 proven. 2420 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:14,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:14,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:14,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 03:04:14,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 4798 proven. 2420 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:14,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:14,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 03:04:14,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 03:04:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 03:04:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 03:04:14,353 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand 43 states. [2019-09-08 03:04:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:14,497 INFO L93 Difference]: Finished difference Result 380 states and 461 transitions. [2019-09-08 03:04:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 03:04:14,498 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2019-09-08 03:04:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:14,499 INFO L225 Difference]: With dead ends: 380 [2019-09-08 03:04:14,499 INFO L226 Difference]: Without dead ends: 254 [2019-09-08 03:04:14,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 03:04:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-08 03:04:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-08 03:04:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 03:04:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 293 transitions. [2019-09-08 03:04:14,521 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 293 transitions. Word has length 249 [2019-09-08 03:04:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:14,521 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 293 transitions. [2019-09-08 03:04:14,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 03:04:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 293 transitions. [2019-09-08 03:04:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 03:04:14,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:14,523 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:14,523 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash -491962118, now seen corresponding path program 32 times [2019-09-08 03:04:14,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:14,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:14,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:14,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:14,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 4916 proven. 2542 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:15,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:15,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:15,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:04:15,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:04:15,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:15,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 03:04:15,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 4916 proven. 2542 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:15,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:15,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 03:04:15,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 03:04:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 03:04:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 03:04:15,490 INFO L87 Difference]: Start difference. First operand 253 states and 293 transitions. Second operand 44 states. [2019-09-08 03:04:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:15,629 INFO L93 Difference]: Finished difference Result 383 states and 464 transitions. [2019-09-08 03:04:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 03:04:15,629 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 252 [2019-09-08 03:04:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:15,631 INFO L225 Difference]: With dead ends: 383 [2019-09-08 03:04:15,631 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 03:04:15,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 03:04:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 03:04:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-09-08 03:04:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-08 03:04:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2019-09-08 03:04:15,654 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 252 [2019-09-08 03:04:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:15,655 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2019-09-08 03:04:15,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 03:04:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2019-09-08 03:04:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 03:04:15,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:15,657 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 42, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:15,657 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1600514531, now seen corresponding path program 33 times [2019-09-08 03:04:15,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:15,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 5034 proven. 2667 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:16,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:16,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:04:16,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-08 03:04:16,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:16,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 03:04:16,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 5034 proven. 2667 refuted. 0 times theorem prover too weak. 2262 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-08 03:04:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 03:04:16,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 03:04:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 03:04:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:04:16,696 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand 45 states. [2019-09-08 03:04:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:16,860 INFO L93 Difference]: Finished difference Result 386 states and 467 transitions. [2019-09-08 03:04:16,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 03:04:16,861 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 255 [2019-09-08 03:04:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:16,863 INFO L225 Difference]: With dead ends: 386 [2019-09-08 03:04:16,863 INFO L226 Difference]: Without dead ends: 260 [2019-09-08 03:04:16,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:04:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-08 03:04:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-09-08 03:04:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-08 03:04:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2019-09-08 03:04:16,896 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 255 [2019-09-08 03:04:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:16,896 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2019-09-08 03:04:16,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 03:04:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2019-09-08 03:04:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 03:04:16,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:16,899 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 43, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:16,899 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1813056026, now seen corresponding path program 34 times [2019-09-08 03:04:16,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:16,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5152 proven. 2795 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:17,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:17,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:17,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:04:17,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:04:17,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:17,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 03:04:17,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5152 proven. 2795 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:04:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:18,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 03:04:18,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 03:04:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 03:04:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 03:04:18,033 INFO L87 Difference]: Start difference. First operand 259 states and 299 transitions. Second operand 46 states. [2019-09-08 03:04:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:18,169 INFO L93 Difference]: Finished difference Result 389 states and 470 transitions. [2019-09-08 03:04:18,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 03:04:18,170 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 258 [2019-09-08 03:04:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:18,172 INFO L225 Difference]: With dead ends: 389 [2019-09-08 03:04:18,173 INFO L226 Difference]: Without dead ends: 263 [2019-09-08 03:04:18,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 03:04:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-08 03:04:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-09-08 03:04:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 03:04:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 302 transitions. [2019-09-08 03:04:18,196 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 302 transitions. Word has length 258 [2019-09-08 03:04:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:18,196 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 302 transitions. [2019-09-08 03:04:18,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 03:04:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 302 transitions. [2019-09-08 03:04:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 03:04:18,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:18,198 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 44, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:18,198 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash -742115075, now seen corresponding path program 35 times [2019-09-08 03:04:18,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:18,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:18,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 5270 proven. 2926 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:19,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:19,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:19,295 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:04:19,475 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-08 03:04:19,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:19,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 03:04:19,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 5270 proven. 2926 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:19,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 03:04:19,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 03:04:19,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 03:04:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 03:04:19,540 INFO L87 Difference]: Start difference. First operand 262 states and 302 transitions. Second operand 47 states. [2019-09-08 03:04:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:19,695 INFO L93 Difference]: Finished difference Result 392 states and 473 transitions. [2019-09-08 03:04:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 03:04:19,695 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 261 [2019-09-08 03:04:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:19,697 INFO L225 Difference]: With dead ends: 392 [2019-09-08 03:04:19,697 INFO L226 Difference]: Without dead ends: 266 [2019-09-08 03:04:19,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 03:04:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-08 03:04:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-09-08 03:04:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-08 03:04:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 305 transitions. [2019-09-08 03:04:19,719 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 305 transitions. Word has length 261 [2019-09-08 03:04:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:19,719 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 305 transitions. [2019-09-08 03:04:19,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 03:04:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 305 transitions. [2019-09-08 03:04:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 03:04:19,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:19,721 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 45, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:19,721 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2138997958, now seen corresponding path program 36 times [2019-09-08 03:04:19,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:19,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 5388 proven. 3060 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:20,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:20,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:20,756 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:04:20,925 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-08 03:04:20,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:20,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 03:04:20,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 5388 proven. 3060 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:20,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:20,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 03:04:20,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 03:04:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 03:04:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 03:04:20,993 INFO L87 Difference]: Start difference. First operand 265 states and 305 transitions. Second operand 48 states. [2019-09-08 03:04:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:21,139 INFO L93 Difference]: Finished difference Result 395 states and 476 transitions. [2019-09-08 03:04:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 03:04:21,140 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 264 [2019-09-08 03:04:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:21,141 INFO L225 Difference]: With dead ends: 395 [2019-09-08 03:04:21,141 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 03:04:21,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 03:04:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 03:04:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-09-08 03:04:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 03:04:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2019-09-08 03:04:21,163 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 264 [2019-09-08 03:04:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:21,163 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2019-09-08 03:04:21,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 03:04:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2019-09-08 03:04:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 03:04:21,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:21,165 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 46, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:21,165 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1556132829, now seen corresponding path program 37 times [2019-09-08 03:04:21,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:21,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:21,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 5506 proven. 3197 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:22,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:22,078 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-08 03:04:22,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:22,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 03:04:22,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 5506 proven. 3197 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:22,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 03:04:22,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 03:04:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 03:04:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:04:22,217 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand 49 states. [2019-09-08 03:04:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:22,369 INFO L93 Difference]: Finished difference Result 398 states and 479 transitions. [2019-09-08 03:04:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 03:04:22,369 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 267 [2019-09-08 03:04:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:22,371 INFO L225 Difference]: With dead ends: 398 [2019-09-08 03:04:22,371 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 03:04:22,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:04:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 03:04:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-09-08 03:04:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-08 03:04:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 311 transitions. [2019-09-08 03:04:22,393 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 311 transitions. Word has length 267 [2019-09-08 03:04:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:22,393 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 311 transitions. [2019-09-08 03:04:22,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 03:04:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 311 transitions. [2019-09-08 03:04:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-08 03:04:22,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:22,395 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 47, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:22,395 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:22,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1109355430, now seen corresponding path program 38 times [2019-09-08 03:04:22,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:22,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:22,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 5624 proven. 3337 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:23,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:23,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 03:04:23,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:04:23,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:04:23,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:23,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 03:04:23,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 5624 proven. 3337 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:23,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:23,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 03:04:23,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 03:04:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 03:04:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 03:04:23,525 INFO L87 Difference]: Start difference. First operand 271 states and 311 transitions. Second operand 50 states. [2019-09-08 03:04:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:23,707 INFO L93 Difference]: Finished difference Result 401 states and 482 transitions. [2019-09-08 03:04:23,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 03:04:23,708 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 270 [2019-09-08 03:04:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:23,709 INFO L225 Difference]: With dead ends: 401 [2019-09-08 03:04:23,709 INFO L226 Difference]: Without dead ends: 275 [2019-09-08 03:04:23,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 03:04:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-08 03:04:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-09-08 03:04:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-08 03:04:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2019-09-08 03:04:23,732 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 270 [2019-09-08 03:04:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:23,733 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2019-09-08 03:04:23,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 03:04:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2019-09-08 03:04:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 03:04:23,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:23,735 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 48, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:23,735 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:23,735 INFO L82 PathProgramCache]: Analyzing trace with hash 980256445, now seen corresponding path program 39 times [2019-09-08 03:04:23,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:23,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:23,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 5742 proven. 3480 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:24,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:24,697 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-08 03:04:24,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:04:24,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-08 03:04:24,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:24,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 03:04:24,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 5742 proven. 3480 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:24,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:24,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 03:04:24,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 03:04:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 03:04:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 03:04:24,973 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand 51 states. [2019-09-08 03:04:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:25,154 INFO L93 Difference]: Finished difference Result 404 states and 485 transitions. [2019-09-08 03:04:25,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 03:04:25,155 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 273 [2019-09-08 03:04:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:25,156 INFO L225 Difference]: With dead ends: 404 [2019-09-08 03:04:25,156 INFO L226 Difference]: Without dead ends: 278 [2019-09-08 03:04:25,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 03:04:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-08 03:04:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-09-08 03:04:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-08 03:04:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2019-09-08 03:04:25,179 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 273 [2019-09-08 03:04:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:25,179 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2019-09-08 03:04:25,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 03:04:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2019-09-08 03:04:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 03:04:25,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:25,181 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 49, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:25,181 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1351636346, now seen corresponding path program 40 times [2019-09-08 03:04:25,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:25,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:25,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 5860 proven. 3626 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:26,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:26,177 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-08 03:04:26,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:04:26,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:04:26,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:26,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 03:04:26,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 5860 proven. 3626 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-08 03:04:26,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 03:04:26,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 03:04:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 03:04:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 03:04:26,331 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand 52 states. [2019-09-08 03:04:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:26,501 INFO L93 Difference]: Finished difference Result 444 states and 525 transitions. [2019-09-08 03:04:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 03:04:26,501 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 276 [2019-09-08 03:04:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:26,503 INFO L225 Difference]: With dead ends: 444 [2019-09-08 03:04:26,503 INFO L226 Difference]: Without dead ends: 318 [2019-09-08 03:04:26,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 03:04:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-08 03:04:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2019-09-08 03:04:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-08 03:04:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2019-09-08 03:04:26,527 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 276 [2019-09-08 03:04:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:26,527 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2019-09-08 03:04:26,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 03:04:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2019-09-08 03:04:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 03:04:26,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:26,529 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 50, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:26,530 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1294512541, now seen corresponding path program 41 times [2019-09-08 03:04:26,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:26,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:26,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:26,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 7121 proven. 4642 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-08 03:04:27,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:27,502 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-08 03:04:27,520 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:04:27,712 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-08 03:04:27,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:27,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 03:04:27,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 7255 proven. 4642 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 03:04:28,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:28,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 53] total 53 [2019-09-08 03:04:28,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 03:04:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 03:04:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 03:04:28,113 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand 53 states. [2019-09-08 03:04:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:28,529 INFO L93 Difference]: Finished difference Result 1616 states and 2106 transitions. [2019-09-08 03:04:28,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 03:04:28,530 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2019-09-08 03:04:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:28,538 INFO L225 Difference]: With dead ends: 1616 [2019-09-08 03:04:28,538 INFO L226 Difference]: Without dead ends: 1611 [2019-09-08 03:04:28,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 03:04:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2019-09-08 03:04:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 313. [2019-09-08 03:04:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-08 03:04:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2019-09-08 03:04:28,593 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 279 [2019-09-08 03:04:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:28,594 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2019-09-08 03:04:28,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 03:04:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2019-09-08 03:04:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 03:04:28,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:28,597 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:28,597 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -644776136, now seen corresponding path program 42 times [2019-09-08 03:04:28,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:28,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:32,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:32,351 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-08 03:04:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:04:32,598 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2019-09-08 03:04:32,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:32,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 410 conjunts are in the unsatisfiable core [2019-09-08 03:04:32,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:53,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:04:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:54,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:54,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 205] total 307 [2019-09-08 03:04:54,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 307 states [2019-09-08 03:04:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 307 interpolants. [2019-09-08 03:04:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4640, Invalid=89302, Unknown=0, NotChecked=0, Total=93942 [2019-09-08 03:04:54,381 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 307 states. [2019-09-08 03:05:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:23,132 INFO L93 Difference]: Finished difference Result 4548 states and 6025 transitions. [2019-09-08 03:05:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2019-09-08 03:05:23,132 INFO L78 Accepts]: Start accepts. Automaton has 307 states. Word has length 312 [2019-09-08 03:05:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:23,151 INFO L225 Difference]: With dead ends: 4548 [2019-09-08 03:05:23,152 INFO L226 Difference]: Without dead ends: 4386 [2019-09-08 03:05:23,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35852 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=4646, Invalid=89910, Unknown=0, NotChecked=0, Total=94556 [2019-09-08 03:05:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2019-09-08 03:05:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4190. [2019-09-08 03:05:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-09-08 03:05:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2019-09-08 03:05:24,235 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 312 [2019-09-08 03:05:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:24,236 INFO L475 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2019-09-08 03:05:24,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 307 states. [2019-09-08 03:05:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2019-09-08 03:05:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 03:05:24,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:24,238 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:24,239 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1847249315, now seen corresponding path program 43 times [2019-09-08 03:05:24,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:24,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:24,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:24,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:24,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-08 03:05:25,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:25,398 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-08 03:05:25,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:05:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:25,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-08 03:05:25,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:05:25,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:25,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 03:05:25,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 03:05:25,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 03:05:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 03:05:25,654 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand 54 states. [2019-09-08 03:05:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:26,513 INFO L93 Difference]: Finished difference Result 4341 states and 4441 transitions. [2019-09-08 03:05:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 03:05:26,513 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2019-09-08 03:05:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:26,514 INFO L225 Difference]: With dead ends: 4341 [2019-09-08 03:05:26,514 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 03:05:26,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 03:05:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 03:05:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 03:05:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 03:05:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 03:05:26,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 315 [2019-09-08 03:05:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:26,521 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 03:05:26,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 03:05:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 03:05:26,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 03:05:26,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 03:05:33,067 WARN L188 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 1950 DAG size of output: 1530 [2019-09-08 03:05:49,924 WARN L188 SmtUtils]: Spent 16.82 s on a formula simplification. DAG size of input: 1526 DAG size of output: 493 [2019-09-08 03:05:49,930 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-08 03:05:49,931 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 03:05:49,931 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 03:05:49,931 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 03:05:49,931 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 03:05:49,931 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 03:05:49,931 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2019-09-08 03:05:49,931 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2019-09-08 03:05:49,932 INFO L443 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-09-08 03:05:49,932 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2019-09-08 03:05:49,932 INFO L443 ceAbstractionStarter]: For program point L15-2(lines 14 22) no Hoare annotation was computed. [2019-09-08 03:05:49,932 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2019-09-08 03:05:49,934 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (let ((.cse4 (<= main_~y~0 14)) (.cse5 (<= 14 main_~y~0)) (.cse10 (<= main_~y~0 17)) (.cse11 (<= 17 main_~y~0)) (.cse2 (<= 0 main_~y~0)) (.cse3 (<= main_~y~0 0)) (.cse0 (<= 44 main_~y~0)) (.cse1 (<= main_~y~0 44)) (.cse15 (<= main_~y~0 30)) (.cse14 (<= 30 main_~y~0)) (.cse17 (<= 23 main_~y~0)) (.cse16 (<= main_~y~0 23)) (.cse12 (<= 32 main_~y~0)) (.cse13 (<= main_~y~0 32)) (.cse8 (<= main_~y~0 3)) (.cse9 (<= 3 main_~y~0)) (.cse6 (<= 19 main_~y~0)) (.cse7 (<= main_~y~0 19))) (or (and (= main_~x~0 50) (= main_~y~0 50)) (and (and (= 56 main_~x~0) .cse0) .cse1) (and (= 18 main_~y~0) (= main_~x~0 82)) (and (= 45 main_~x~0) (= main_~y~0 45)) (and (= 43 main_~x~0) (<= 43 main_~y~0) (<= main_~y~0 43)) (and (<= main_~y~0 34) (and (<= 66 main_~x~0) (<= main_~x~0 66) (<= 34 main_~y~0))) (and (= main_~x~0 48) (= main_~y~0 48)) (and (= main_~x~0 0) .cse2 .cse3) (and (= main_~y~0 24) (= 24 main_~x~0)) (and (= 35 main_~y~0) (= main_~x~0 65)) (and (= main_~x~0 36) (= main_~y~0 36)) (and (<= main_~y~0 35) (<= 35 main_~y~0) (= main_~x~0 35)) (and (<= main_~y~0 28) (and (<= 28 main_~y~0) (<= 72 main_~x~0) (<= main_~x~0 72))) (and (= main_~x~0 34) (= main_~y~0 34)) (and .cse4 (= main_~x~0 14) .cse5) (and (= 89 main_~x~0) (= 11 main_~y~0)) (and (and (= 81 main_~x~0) .cse6) .cse7) (and (= main_~y~0 15) (= main_~x~0 15)) (and (= main_~x~0 52) (= 48 main_~y~0)) (and (= 9 main_~x~0) (= main_~y~0 9)) (and .cse4 (and .cse5 (<= main_~x~0 86) (<= 86 main_~x~0))) (and (= 58 main_~x~0) (= 42 main_~y~0)) (and (= main_~x~0 5) (= main_~y~0 5)) (and (= main_~y~0 40) (= 40 main_~x~0)) (and .cse8 (= 3 main_~x~0) .cse9) (and (= main_~x~0 88) (= 12 main_~y~0)) (and .cse10 .cse11 (= main_~x~0 17)) (and (= main_~x~0 27) (= main_~y~0 27)) (and (= 24 main_~y~0) (= main_~x~0 76)) (and .cse10 (and .cse11 (<= 83 main_~x~0) (<= main_~x~0 83))) (and (= 53 main_~x~0) (= 47 main_~y~0)) (and (= main_~x~0 22) (= main_~y~0 22)) (and (<= main_~x~0 100) .cse2 (<= 100 main_~x~0) .cse3) (and (and (<= 80 main_~x~0) (<= main_~x~0 80) (<= 20 main_~y~0)) (<= main_~y~0 20)) (and (= 26 main_~x~0) (= main_~y~0 26)) (and (= main_~y~0 16) (= 16 main_~x~0)) (and (<= main_~y~0 41) (and (<= 41 main_~y~0) (<= 59 main_~x~0) (<= main_~x~0 59))) (and (= main_~y~0 33) (= 33 main_~x~0)) (and (= 8 main_~x~0) (<= 8 main_~y~0) (<= main_~y~0 8)) (and (and (<= 62 main_~x~0) (<= main_~x~0 62) (<= 38 main_~y~0)) (<= main_~y~0 38)) (and (= main_~x~0 7) (= main_~y~0 7)) (and (= main_~x~0 38) (= main_~y~0 38)) (and (= 2 main_~x~0) (= main_~y~0 2)) (and (and (<= 68 main_~x~0) .cse12 (<= main_~x~0 68)) .cse13) (and (and (<= 25 main_~y~0) (<= main_~x~0 75) (<= 75 main_~x~0)) (<= main_~y~0 25)) (and (= 8 main_~y~0) (= main_~x~0 92)) (and (= main_~x~0 78) (= 22 main_~y~0)) (and (= 54 main_~x~0) (= 46 main_~y~0)) (and (= main_~x~0 49) (= main_~y~0 49)) (and (= main_~x~0 12) (= main_~y~0 12)) (and (= 61 main_~x~0) (= 39 main_~y~0)) (and (= main_~x~0 37) (= main_~y~0 37)) (and (= main_~x~0 44) .cse0 .cse1) (and (= 43 main_~y~0) (= main_~x~0 57)) (and (<= main_~y~0 13) (and (<= 13 main_~y~0) (= 87 main_~x~0))) (and (= 1 main_~y~0) (= 99 main_~x~0)) (and (and (<= 74 main_~x~0) (<= 26 main_~y~0) (<= main_~x~0 74)) (<= main_~y~0 26)) (and (= main_~y~0 21) (= main_~x~0 21)) (and (= 37 main_~y~0) (= main_~x~0 63)) (and (= main_~x~0 51) (= 49 main_~y~0)) (and (= main_~y~0 11) (= main_~x~0 11)) (and (= 46 main_~x~0) (= main_~y~0 46)) (and (= main_~x~0 28) (= main_~y~0 28)) (and (= main_~x~0 39) (<= main_~y~0 39) (<= 39 main_~y~0)) (and (and .cse14 (= main_~x~0 70)) .cse15) (and .cse15 .cse14 (= 30 main_~x~0)) (and (and (<= 31 main_~y~0) (<= main_~x~0 69) (<= 69 main_~x~0)) (<= main_~y~0 31)) (and .cse16 (and (<= 77 main_~x~0) (<= main_~x~0 77) .cse17)) (and (= main_~x~0 4) (= main_~y~0 4)) (and (= main_~x~0 18) (= main_~y~0 18)) (and (<= main_~y~0 4) (and (<= main_~x~0 96) (<= 4 main_~y~0) (<= 96 main_~x~0))) (and (<= main_~y~0 40) (and (<= 40 main_~y~0) (<= main_~x~0 60) (<= 60 main_~x~0))) (and (= main_~y~0 31) (= main_~x~0 31)) (and (= main_~y~0 10) (= 10 main_~x~0)) (and .cse17 (= 23 main_~x~0) .cse16) (and (= 1 main_~x~0) (= main_~y~0 1)) (and (= 41 main_~x~0) (= main_~y~0 41)) (and (and (<= 6 main_~y~0) (<= 94 main_~x~0) (<= main_~x~0 94)) (<= main_~y~0 6)) (and (and (<= 2 main_~y~0) (= 98 main_~x~0)) (<= main_~y~0 2)) (and (and (= 93 main_~x~0) (<= 7 main_~y~0)) (<= main_~y~0 7)) (and (= main_~y~0 25) (= 25 main_~x~0)) (and (<= main_~y~0 36) (and (= 64 main_~x~0) (<= 36 main_~y~0))) (and (<= main_~y~0 29) (and (<= 71 main_~x~0) (<= 29 main_~y~0) (<= main_~x~0 71))) (and (<= main_~y~0 45) (and (<= 45 main_~y~0) (<= main_~x~0 55) (<= 55 main_~x~0))) (and (= main_~y~0 13) (= 13 main_~x~0)) (and (= main_~x~0 91) (= 9 main_~y~0)) (and (<= main_~y~0 21) (and (<= 21 main_~y~0) (<= main_~x~0 79) (<= 79 main_~x~0))) (and .cse12 .cse13 (= main_~x~0 32)) (and (= 20 main_~x~0) (= main_~y~0 20)) (and (<= main_~y~0 33) (and (<= 33 main_~y~0) (<= 67 main_~x~0) (<= main_~x~0 67))) (and (= main_~x~0 42) (= main_~y~0 42)) (and (<= 47 main_~y~0) (<= main_~y~0 47) (= main_~x~0 47)) (and .cse8 (and .cse9 (<= 97 main_~x~0) (<= main_~x~0 97))) (and .cse6 (= main_~x~0 19) .cse7) (and (<= main_~y~0 5) (and (<= main_~x~0 95) (<= 5 main_~y~0) (<= 95 main_~x~0))) (and (= 29 main_~x~0) (= main_~y~0 29)) (and (= main_~x~0 6) (= main_~y~0 6)) (and (<= main_~y~0 15) (and (<= main_~x~0 85) (<= 85 main_~x~0) (<= 15 main_~y~0))) (and (<= main_~y~0 16) (and (= 84 main_~x~0) (<= 16 main_~y~0))) (and (<= main_~y~0 10) (and (<= 10 main_~y~0) (<= 90 main_~x~0) (<= main_~x~0 90))) (and (and (<= main_~x~0 73) (<= 73 main_~x~0) (<= 27 main_~y~0)) (<= main_~y~0 27)))) [2019-09-08 03:05:49,934 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (and (<= main_~x~0 100) (<= 100 main_~x~0)) [2019-09-08 03:05:49,934 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-08 03:05:49,934 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-08 03:05:49,934 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-08 03:05:49,934 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-08 03:05:49,934 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-08 03:05:49,935 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-08 03:05:49,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 03:05:49 BoogieIcfgContainer [2019-09-08 03:05:49,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 03:05:49,970 INFO L168 Benchmark]: Toolchain (without parser) took 122468.23 ms. Allocated memory was 135.3 MB in the beginning and 1.0 GB in the end (delta: 866.6 MB). Free memory was 88.5 MB in the beginning and 197.4 MB in the end (delta: -109.0 MB). Peak memory consumption was 909.2 MB. Max. memory is 7.1 GB. [2019-09-08 03:05:49,970 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 03:05:49,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.39 ms. Allocated memory is still 135.3 MB. Free memory was 88.2 MB in the beginning and 79.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-08 03:05:49,972 INFO L168 Benchmark]: Boogie Preprocessor took 118.18 ms. Allocated memory was 135.3 MB in the beginning and 200.3 MB in the end (delta: 65.0 MB). Free memory was 79.1 MB in the beginning and 178.3 MB in the end (delta: -99.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-09-08 03:05:49,972 INFO L168 Benchmark]: RCFGBuilder took 223.77 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 166.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-09-08 03:05:49,973 INFO L168 Benchmark]: TraceAbstraction took 121887.86 ms. Allocated memory was 200.3 MB in the beginning and 1.0 GB in the end (delta: 801.6 MB). Free memory was 166.3 MB in the beginning and 197.4 MB in the end (delta: -31.1 MB). Peak memory consumption was 922.1 MB. Max. memory is 7.1 GB. [2019-09-08 03:05:49,976 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 229.39 ms. Allocated memory is still 135.3 MB. Free memory was 88.2 MB in the beginning and 79.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.18 ms. Allocated memory was 135.3 MB in the beginning and 200.3 MB in the end (delta: 65.0 MB). Free memory was 79.1 MB in the beginning and 178.3 MB in the end (delta: -99.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 223.77 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 166.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121887.86 ms. Allocated memory was 200.3 MB in the beginning and 1.0 GB in the end (delta: 801.6 MB). Free memory was 166.3 MB in the beginning and 197.4 MB in the end (delta: -31.1 MB). Peak memory consumption was 922.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x == 50 && y == 50) || ((56 == x && 44 <= y) && y <= 44)) || (18 == y && x == 82)) || (45 == x && y == 45)) || ((43 == x && 43 <= y) && y <= 43)) || (y <= 34 && (66 <= x && x <= 66) && 34 <= y)) || (x == 48 && y == 48)) || ((x == 0 && 0 <= y) && y <= 0)) || (y == 24 && 24 == x)) || (35 == y && x == 65)) || (x == 36 && y == 36)) || ((y <= 35 && 35 <= y) && x == 35)) || (y <= 28 && (28 <= y && 72 <= x) && x <= 72)) || (x == 34 && y == 34)) || ((y <= 14 && x == 14) && 14 <= y)) || (89 == x && 11 == y)) || ((81 == x && 19 <= y) && y <= 19)) || (y == 15 && x == 15)) || (x == 52 && 48 == y)) || (9 == x && y == 9)) || (y <= 14 && (14 <= y && x <= 86) && 86 <= x)) || (58 == x && 42 == y)) || (x == 5 && y == 5)) || (y == 40 && 40 == x)) || ((y <= 3 && 3 == x) && 3 <= y)) || (x == 88 && 12 == y)) || ((y <= 17 && 17 <= y) && x == 17)) || (x == 27 && y == 27)) || (24 == y && x == 76)) || (y <= 17 && (17 <= y && 83 <= x) && x <= 83)) || (53 == x && 47 == y)) || (x == 22 && y == 22)) || (((x <= 100 && 0 <= y) && 100 <= x) && y <= 0)) || (((80 <= x && x <= 80) && 20 <= y) && y <= 20)) || (26 == x && y == 26)) || (y == 16 && 16 == x)) || (y <= 41 && (41 <= y && 59 <= x) && x <= 59)) || (y == 33 && 33 == x)) || ((8 == x && 8 <= y) && y <= 8)) || (((62 <= x && x <= 62) && 38 <= y) && y <= 38)) || (x == 7 && y == 7)) || (x == 38 && y == 38)) || (2 == x && y == 2)) || (((68 <= x && 32 <= y) && x <= 68) && y <= 32)) || (((25 <= y && x <= 75) && 75 <= x) && y <= 25)) || (8 == y && x == 92)) || (x == 78 && 22 == y)) || (54 == x && 46 == y)) || (x == 49 && y == 49)) || (x == 12 && y == 12)) || (61 == x && 39 == y)) || (x == 37 && y == 37)) || ((x == 44 && 44 <= y) && y <= 44)) || (43 == y && x == 57)) || (y <= 13 && 13 <= y && 87 == x)) || (1 == y && 99 == x)) || (((74 <= x && 26 <= y) && x <= 74) && y <= 26)) || (y == 21 && x == 21)) || (37 == y && x == 63)) || (x == 51 && 49 == y)) || (y == 11 && x == 11)) || (46 == x && y == 46)) || (x == 28 && y == 28)) || ((x == 39 && y <= 39) && 39 <= y)) || ((30 <= y && x == 70) && y <= 30)) || ((y <= 30 && 30 <= y) && 30 == x)) || (((31 <= y && x <= 69) && 69 <= x) && y <= 31)) || (y <= 23 && (77 <= x && x <= 77) && 23 <= y)) || (x == 4 && y == 4)) || (x == 18 && y == 18)) || (y <= 4 && (x <= 96 && 4 <= y) && 96 <= x)) || (y <= 40 && (40 <= y && x <= 60) && 60 <= x)) || (y == 31 && x == 31)) || (y == 10 && 10 == x)) || ((23 <= y && 23 == x) && y <= 23)) || (1 == x && y == 1)) || (41 == x && y == 41)) || (((6 <= y && 94 <= x) && x <= 94) && y <= 6)) || ((2 <= y && 98 == x) && y <= 2)) || ((93 == x && 7 <= y) && y <= 7)) || (y == 25 && 25 == x)) || (y <= 36 && 64 == x && 36 <= y)) || (y <= 29 && (71 <= x && 29 <= y) && x <= 71)) || (y <= 45 && (45 <= y && x <= 55) && 55 <= x)) || (y == 13 && 13 == x)) || (x == 91 && 9 == y)) || (y <= 21 && (21 <= y && x <= 79) && 79 <= x)) || ((32 <= y && y <= 32) && x == 32)) || (20 == x && y == 20)) || (y <= 33 && (33 <= y && 67 <= x) && x <= 67)) || (x == 42 && y == 42)) || ((47 <= y && y <= 47) && x == 47)) || (y <= 3 && (3 <= y && 97 <= x) && x <= 97)) || ((19 <= y && x == 19) && y <= 19)) || (y <= 5 && (x <= 95 && 5 <= y) && 95 <= x)) || (29 == x && y == 29)) || (x == 6 && y == 6)) || (y <= 15 && (x <= 85 && 85 <= x) && 15 <= y)) || (y <= 16 && 84 == x && 16 <= y)) || (y <= 10 && (10 <= y && 90 <= x) && x <= 90)) || (((x <= 73 && 73 <= x) && 27 <= y) && y <= 27) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 121.7s OverallTime, 46 OverallIterations, 102 TraceHistogramMax, 39.5s AutomataDifference, 0.0s DeadEndRemovalTime, 23.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 892 SDtfs, 1155 SDslu, 51532 SDs, 0 SdLazy, 61433 SolverSat, 1155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8420 GetRequests, 6585 SyntacticMatches, 1 SemanticMatches, 1834 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47983 ImplicationChecksByTransitivity, 49.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 46 MinimizatonAttempts, 2996 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 53 PreInvPairs, 155 NumberOfFragments, 968 HoareAnnotationTreeSize, 53 FomulaSimplifications, 5205950 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 974811 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 50.4s InterpolantComputationTime, 13576 NumberOfCodeBlocks, 13537 NumberOfCodeBlocksAsserted, 1120 NumberOfCheckSat, 13487 ConstructedInterpolants, 0 QuantifiedInterpolants, 7049017 SizeOfPredicates, 45 NumberOfNonLiveVariables, 15708 ConjunctsInSsa, 1783 ConjunctsInUnsatCore, 89 InterpolantComputations, 3 PerfectInterpolantSequences, 272535/437292 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...