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/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:26:58,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:26:58,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:26:58,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:26:58,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:26:58,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:26:58,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:26:58,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:26:58,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:26:58,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:26:58,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:26:58,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:26:58,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:26:58,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:26:58,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:26:58,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:26:58,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:26:58,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:26:58,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:26:58,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:26:58,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:26:58,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:26:58,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:26:58,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:26:58,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:26:58,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:26:58,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:26:58,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:26:58,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:26:58,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:26:58,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:26:58,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:26:58,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:26:58,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:26:58,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:26:58,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:26:58,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:26:58,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:26:58,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:26:58,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:26:58,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:26:58,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:26:58,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:26:58,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:26:58,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:26:58,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:26:58,807 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:26:58,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:26:58,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:26:58,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:26:58,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:26:58,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:26:58,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:26:58,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:26:58,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:26:58,809 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:26:58,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:26:58,810 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:26:58,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:26:58,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:26:58,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:26:58,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:26:58,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:26:58,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:26:58,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:26:58,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:26:58,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:26:58,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:26:58,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:26:58,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:26:58,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:26:58,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:26:58,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:26:58,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:26:58,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:26:58,861 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:26:58,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-02 14:26:58,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d9e03dd/b8c16d62ae0c45868dc9804d049fd271/FLAGa24ea76fc [2019-10-02 14:26:59,490 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:26:59,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-02 14:26:59,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d9e03dd/b8c16d62ae0c45868dc9804d049fd271/FLAGa24ea76fc [2019-10-02 14:26:59,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d9e03dd/b8c16d62ae0c45868dc9804d049fd271 [2019-10-02 14:26:59,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:26:59,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:26:59,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:26:59,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:26:59,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:26:59,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:26:59" (1/1) ... [2019-10-02 14:26:59,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c3d37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:26:59, skipping insertion in model container [2019-10-02 14:26:59,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:26:59" (1/1) ... [2019-10-02 14:26:59,792 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:26:59,841 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:00,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:00,173 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:00,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:00,351 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:00,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00 WrapperNode [2019-10-02 14:27:00,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:00,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:00,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:00,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:00,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... [2019-10-02 14:27:00,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:00,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:00,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:00,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:00,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:01,312 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:01,312 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 14:27:01,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:01 BoogieIcfgContainer [2019-10-02 14:27:01,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:01,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:01,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:01,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:01,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:26:59" (1/3) ... [2019-10-02 14:27:01,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:01, skipping insertion in model container [2019-10-02 14:27:01,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:00" (2/3) ... [2019-10-02 14:27:01,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:01, skipping insertion in model container [2019-10-02 14:27:01,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:01" (3/3) ... [2019-10-02 14:27:01,323 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-10-02 14:27:01,334 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:01,342 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:01,360 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:01,393 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:01,394 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:01,395 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:01,395 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:01,395 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:01,395 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:01,395 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:01,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:01,396 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-02 14:27:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 14:27:01,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:01,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:01,428 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:01,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash 919157391, now seen corresponding path program 1 times [2019-10-02 14:27:01,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:01,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:01,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:01,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:01,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:01,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:01,644 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-10-02 14:27:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:02,012 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2019-10-02 14:27:02,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:02,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 14:27:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:02,029 INFO L225 Difference]: With dead ends: 331 [2019-10-02 14:27:02,029 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 14:27:02,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 14:27:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-10-02 14:27:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-02 14:27:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-10-02 14:27:02,093 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2019-10-02 14:27:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:02,093 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-10-02 14:27:02,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-10-02 14:27:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 14:27:02,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:02,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:02,095 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash 736602936, now seen corresponding path program 1 times [2019-10-02 14:27:02,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:02,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:02,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:02,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:02,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:02,152 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-10-02 14:27:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:02,190 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2019-10-02 14:27:02,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:02,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 14:27:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:02,193 INFO L225 Difference]: With dead ends: 365 [2019-10-02 14:27:02,193 INFO L226 Difference]: Without dead ends: 189 [2019-10-02 14:27:02,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-02 14:27:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-10-02 14:27:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-02 14:27:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-10-02 14:27:02,211 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2019-10-02 14:27:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:02,211 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-10-02 14:27:02,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-10-02 14:27:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 14:27:02,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:02,213 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:02,213 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash 816788357, now seen corresponding path program 1 times [2019-10-02 14:27:02,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:02,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:02,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:02,572 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-10-02 14:27:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:27:02,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:02,578 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 4 states. [2019-10-02 14:27:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:02,875 INFO L93 Difference]: Finished difference Result 292 states and 485 transitions. [2019-10-02 14:27:02,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:27:02,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-02 14:27:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:02,880 INFO L225 Difference]: With dead ends: 292 [2019-10-02 14:27:02,880 INFO L226 Difference]: Without dead ends: 276 [2019-10-02 14:27:02,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-02 14:27:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-10-02 14:27:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-02 14:27:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-10-02 14:27:02,920 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2019-10-02 14:27:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:02,920 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-10-02 14:27:02,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-10-02 14:27:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 14:27:02,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:02,922 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:02,923 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1993084704, now seen corresponding path program 1 times [2019-10-02 14:27:02,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:02,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:02,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:02,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:02,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:02,978 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-10-02 14:27:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:03,034 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2019-10-02 14:27:03,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:03,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 14:27:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:03,037 INFO L225 Difference]: With dead ends: 468 [2019-10-02 14:27:03,037 INFO L226 Difference]: Without dead ends: 216 [2019-10-02 14:27:03,042 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-02 14:27:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-10-02 14:27:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-02 14:27:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-10-02 14:27:03,068 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2019-10-02 14:27:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:03,068 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-10-02 14:27:03,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-10-02 14:27:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 14:27:03,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:03,073 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:03,073 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash -365898165, now seen corresponding path program 1 times [2019-10-02 14:27:03,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:03,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:03,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:03,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:03,157 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:03,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:03,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:27:03,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 14:27:03,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:27:03,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 14:27:03,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:03,326 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 5 states. [2019-10-02 14:27:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:03,598 INFO L93 Difference]: Finished difference Result 498 states and 813 transitions. [2019-10-02 14:27:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 14:27:03,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-02 14:27:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:03,600 INFO L225 Difference]: With dead ends: 498 [2019-10-02 14:27:03,601 INFO L226 Difference]: Without dead ends: 288 [2019-10-02 14:27:03,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:27:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-02 14:27:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 245. [2019-10-02 14:27:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-02 14:27:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 408 transitions. [2019-10-02 14:27:03,612 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 408 transitions. Word has length 28 [2019-10-02 14:27:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:03,612 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 408 transitions. [2019-10-02 14:27:03,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 408 transitions. [2019-10-02 14:27:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 14:27:03,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:03,614 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:03,614 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -944739986, now seen corresponding path program 1 times [2019-10-02 14:27:03,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:03,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:03,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:03,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:03,697 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:03,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:03,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:03,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:27:03,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:03,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:27:03,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:03,806 INFO L87 Difference]: Start difference. First operand 245 states and 408 transitions. Second operand 5 states. [2019-10-02 14:27:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:03,977 INFO L93 Difference]: Finished difference Result 464 states and 780 transitions. [2019-10-02 14:27:03,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:03,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-02 14:27:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:03,980 INFO L225 Difference]: With dead ends: 464 [2019-10-02 14:27:03,981 INFO L226 Difference]: Without dead ends: 452 [2019-10-02 14:27:03,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-02 14:27:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2019-10-02 14:27:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-10-02 14:27:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 730 transitions. [2019-10-02 14:27:03,994 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 730 transitions. Word has length 30 [2019-10-02 14:27:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:03,995 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 730 transitions. [2019-10-02 14:27:03,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 730 transitions. [2019-10-02 14:27:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 14:27:03,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:03,997 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:03,997 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:03,997 INFO L82 PathProgramCache]: Analyzing trace with hash 789275061, now seen corresponding path program 1 times [2019-10-02 14:27:03,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:04,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:04,174 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:04,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:27:04,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:04,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:04,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-02 14:27:04,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:27:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:27:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:04,271 INFO L87 Difference]: Start difference. First operand 438 states and 730 transitions. Second operand 6 states. [2019-10-02 14:27:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:04,411 INFO L93 Difference]: Finished difference Result 495 states and 817 transitions. [2019-10-02 14:27:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:27:04,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-02 14:27:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:04,416 INFO L225 Difference]: With dead ends: 495 [2019-10-02 14:27:04,416 INFO L226 Difference]: Without dead ends: 490 [2019-10-02 14:27:04,417 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-02 14:27:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-10-02 14:27:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-02 14:27:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2019-10-02 14:27:04,458 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 31 [2019-10-02 14:27:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:04,458 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2019-10-02 14:27:04,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:27:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2019-10-02 14:27:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:27:04,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:04,460 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:04,460 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:04,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2038890699, now seen corresponding path program 1 times [2019-10-02 14:27:04,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:04,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:04,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 14:27:04,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:04,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:04,496 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand 3 states. [2019-10-02 14:27:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:04,554 INFO L93 Difference]: Finished difference Result 949 states and 1566 transitions. [2019-10-02 14:27:04,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:04,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:27:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:04,558 INFO L225 Difference]: With dead ends: 949 [2019-10-02 14:27:04,558 INFO L226 Difference]: Without dead ends: 495 [2019-10-02 14:27:04,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-02 14:27:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-10-02 14:27:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-02 14:27:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 794 transitions. [2019-10-02 14:27:04,573 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 794 transitions. Word has length 32 [2019-10-02 14:27:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:04,574 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 794 transitions. [2019-10-02 14:27:04,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 794 transitions. [2019-10-02 14:27:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 14:27:04,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:04,575 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:04,576 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash 820851006, now seen corresponding path program 1 times [2019-10-02 14:27:04,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:04,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 14:27:04,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:04,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:04,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:04,616 INFO L87 Difference]: Start difference. First operand 493 states and 794 transitions. Second operand 3 states. [2019-10-02 14:27:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:04,649 INFO L93 Difference]: Finished difference Result 939 states and 1525 transitions. [2019-10-02 14:27:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:04,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 14:27:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:04,653 INFO L225 Difference]: With dead ends: 939 [2019-10-02 14:27:04,653 INFO L226 Difference]: Without dead ends: 495 [2019-10-02 14:27:04,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-02 14:27:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-10-02 14:27:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-02 14:27:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 788 transitions. [2019-10-02 14:27:04,668 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 788 transitions. Word has length 40 [2019-10-02 14:27:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:04,669 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 788 transitions. [2019-10-02 14:27:04,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 788 transitions. [2019-10-02 14:27:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 14:27:04,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:04,670 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:04,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:04,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:04,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1867136664, now seen corresponding path program 1 times [2019-10-02 14:27:04,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:04,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:04,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:04,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:04,916 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2019-10-02 14:27:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:04,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:04,921 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:04,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:04,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:27:04,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:27:05,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:05,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-10-02 14:27:05,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:05,053 INFO L87 Difference]: Start difference. First operand 493 states and 788 transitions. Second operand 8 states. [2019-10-02 14:27:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:05,717 INFO L93 Difference]: Finished difference Result 1034 states and 1641 transitions. [2019-10-02 14:27:05,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:05,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-02 14:27:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:05,721 INFO L225 Difference]: With dead ends: 1034 [2019-10-02 14:27:05,721 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 14:27:05,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 14:27:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 544. [2019-10-02 14:27:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 14:27:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 867 transitions. [2019-10-02 14:27:05,740 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 867 transitions. Word has length 41 [2019-10-02 14:27:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:05,740 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 867 transitions. [2019-10-02 14:27:05,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 867 transitions. [2019-10-02 14:27:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 14:27:05,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:05,741 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:05,741 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2035215205, now seen corresponding path program 1 times [2019-10-02 14:27:05,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:05,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:05,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:05,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:05,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 14:27:05,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:05,794 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:05,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:27:05,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 14:27:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 14:27:05,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:05,885 INFO L87 Difference]: Start difference. First operand 544 states and 867 transitions. Second operand 4 states. [2019-10-02 14:27:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:05,990 INFO L93 Difference]: Finished difference Result 558 states and 879 transitions. [2019-10-02 14:27:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:27:05,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-02 14:27:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:05,994 INFO L225 Difference]: With dead ends: 558 [2019-10-02 14:27:05,994 INFO L226 Difference]: Without dead ends: 546 [2019-10-02 14:27:05,994 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-02 14:27:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-10-02 14:27:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 14:27:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 841 transitions. [2019-10-02 14:27:06,011 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 841 transitions. Word has length 42 [2019-10-02 14:27:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:06,012 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 841 transitions. [2019-10-02 14:27:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 841 transitions. [2019-10-02 14:27:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 14:27:06,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:06,013 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:06,013 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1265387988, now seen corresponding path program 1 times [2019-10-02 14:27:06,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:06,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:06,180 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:06,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 14:27:06,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:06,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 14:27:06,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:06,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:06,303 INFO L87 Difference]: Start difference. First operand 544 states and 841 transitions. Second operand 5 states. [2019-10-02 14:27:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:06,437 INFO L93 Difference]: Finished difference Result 553 states and 848 transitions. [2019-10-02 14:27:06,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:06,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-02 14:27:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:06,442 INFO L225 Difference]: With dead ends: 553 [2019-10-02 14:27:06,442 INFO L226 Difference]: Without dead ends: 551 [2019-10-02 14:27:06,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-02 14:27:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 545. [2019-10-02 14:27:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-02 14:27:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 842 transitions. [2019-10-02 14:27:06,460 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 842 transitions. Word has length 44 [2019-10-02 14:27:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:06,461 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 842 transitions. [2019-10-02 14:27:06,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 842 transitions. [2019-10-02 14:27:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 14:27:06,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:06,462 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:06,463 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash -447084202, now seen corresponding path program 1 times [2019-10-02 14:27:06,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:06,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 14:27:06,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:06,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:06,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:06,502 INFO L87 Difference]: Start difference. First operand 545 states and 842 transitions. Second operand 3 states. [2019-10-02 14:27:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:06,545 INFO L93 Difference]: Finished difference Result 1053 states and 1621 transitions. [2019-10-02 14:27:06,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:06,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-02 14:27:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:06,549 INFO L225 Difference]: With dead ends: 1053 [2019-10-02 14:27:06,550 INFO L226 Difference]: Without dead ends: 557 [2019-10-02 14:27:06,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-02 14:27:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2019-10-02 14:27:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-02 14:27:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 835 transitions. [2019-10-02 14:27:06,571 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 835 transitions. Word has length 45 [2019-10-02 14:27:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:06,572 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 835 transitions. [2019-10-02 14:27:06,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 835 transitions. [2019-10-02 14:27:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:27:06,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:06,573 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:06,573 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1882634818, now seen corresponding path program 1 times [2019-10-02 14:27:06,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 14:27:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:06,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:06,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:06,645 INFO L87 Difference]: Start difference. First operand 555 states and 835 transitions. Second operand 3 states. [2019-10-02 14:27:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:06,678 INFO L93 Difference]: Finished difference Result 799 states and 1202 transitions. [2019-10-02 14:27:06,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:06,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 14:27:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:06,681 INFO L225 Difference]: With dead ends: 799 [2019-10-02 14:27:06,681 INFO L226 Difference]: Without dead ends: 313 [2019-10-02 14:27:06,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-02 14:27:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2019-10-02 14:27:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-02 14:27:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2019-10-02 14:27:06,696 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 55 [2019-10-02 14:27:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:06,696 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2019-10-02 14:27:06,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2019-10-02 14:27:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:27:06,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:06,711 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:06,712 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1573307774, now seen corresponding path program 1 times [2019-10-02 14:27:06,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:27:06,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:06,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:06,811 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-10-02 14:27:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:06,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:06,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:27:06,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:06,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 14:27:06,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:06,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:06,885 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand 5 states. [2019-10-02 14:27:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:07,034 INFO L93 Difference]: Finished difference Result 660 states and 968 transitions. [2019-10-02 14:27:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:07,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-02 14:27:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:07,037 INFO L225 Difference]: With dead ends: 660 [2019-10-02 14:27:07,038 INFO L226 Difference]: Without dead ends: 418 [2019-10-02 14:27:07,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-02 14:27:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 389. [2019-10-02 14:27:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-02 14:27:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 573 transitions. [2019-10-02 14:27:07,055 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 573 transitions. Word has length 56 [2019-10-02 14:27:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:07,055 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 573 transitions. [2019-10-02 14:27:07,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 573 transitions. [2019-10-02 14:27:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:27:07,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:07,056 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:07,057 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1831473212, now seen corresponding path program 1 times [2019-10-02 14:27:07,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:07,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:27:07,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:07,184 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:07,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:07,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:27:07,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:27:07,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:07,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 14:27:07,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:07,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:07,316 INFO L87 Difference]: Start difference. First operand 389 states and 573 transitions. Second operand 5 states. [2019-10-02 14:27:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:07,416 INFO L93 Difference]: Finished difference Result 436 states and 639 transitions. [2019-10-02 14:27:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:07,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-02 14:27:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:07,421 INFO L225 Difference]: With dead ends: 436 [2019-10-02 14:27:07,421 INFO L226 Difference]: Without dead ends: 430 [2019-10-02 14:27:07,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-02 14:27:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-10-02 14:27:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-02 14:27:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 627 transitions. [2019-10-02 14:27:07,434 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 627 transitions. Word has length 56 [2019-10-02 14:27:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:07,435 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 627 transitions. [2019-10-02 14:27:07,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2019-10-02 14:27:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:27:07,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:07,436 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:07,436 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1104488738, now seen corresponding path program 1 times [2019-10-02 14:27:07,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:07,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:07,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:07,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:27:07,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-10-02 14:27:07,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:27:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:27:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:07,739 INFO L87 Difference]: Start difference. First operand 427 states and 627 transitions. Second operand 9 states. [2019-10-02 14:27:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:07,870 INFO L93 Difference]: Finished difference Result 429 states and 628 transitions. [2019-10-02 14:27:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:27:07,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-02 14:27:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:07,873 INFO L225 Difference]: With dead ends: 429 [2019-10-02 14:27:07,874 INFO L226 Difference]: Without dead ends: 427 [2019-10-02 14:27:07,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-02 14:27:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-10-02 14:27:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-02 14:27:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 626 transitions. [2019-10-02 14:27:07,887 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 626 transitions. Word has length 60 [2019-10-02 14:27:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:07,887 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 626 transitions. [2019-10-02 14:27:07,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:27:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 626 transitions. [2019-10-02 14:27:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:27:07,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:07,888 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:07,888 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 855434068, now seen corresponding path program 1 times [2019-10-02 14:27:07,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:07,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:07,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:07,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:07,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:08,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:08,243 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:08,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:08,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:27:08,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:08,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:08,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-10-02 14:27:08,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:08,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:08,422 INFO L87 Difference]: Start difference. First operand 427 states and 626 transitions. Second operand 11 states. [2019-10-02 14:27:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:08,894 INFO L93 Difference]: Finished difference Result 455 states and 652 transitions. [2019-10-02 14:27:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:27:08,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-10-02 14:27:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:08,897 INFO L225 Difference]: With dead ends: 455 [2019-10-02 14:27:08,898 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 14:27:08,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:27:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 14:27:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 428. [2019-10-02 14:27:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-02 14:27:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-10-02 14:27:08,916 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 67 [2019-10-02 14:27:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:08,917 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-10-02 14:27:08,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-10-02 14:27:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 14:27:08,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:08,923 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:08,924 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1201928326, now seen corresponding path program 1 times [2019-10-02 14:27:08,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:08,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:08,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 14:27:08,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:08,989 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:09,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:27:09,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 14:27:09,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:09,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 14:27:09,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:27:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:27:09,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:09,143 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 6 states. [2019-10-02 14:27:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:09,295 INFO L93 Difference]: Finished difference Result 865 states and 1269 transitions. [2019-10-02 14:27:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:27:09,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-10-02 14:27:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:09,298 INFO L225 Difference]: With dead ends: 865 [2019-10-02 14:27:09,299 INFO L226 Difference]: Without dead ends: 545 [2019-10-02 14:27:09,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-10-02 14:27:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 506. [2019-10-02 14:27:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-02 14:27:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 746 transitions. [2019-10-02 14:27:09,316 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 746 transitions. Word has length 77 [2019-10-02 14:27:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:09,317 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 746 transitions. [2019-10-02 14:27:09,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:27:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 746 transitions. [2019-10-02 14:27:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 14:27:09,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:09,318 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:09,318 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash 808901316, now seen corresponding path program 1 times [2019-10-02 14:27:09,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:09,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:09,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:09,508 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:09,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:09,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:27:09,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:09,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:27:09,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:09,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-02 14:27:09,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:27:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:27:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:27:09,707 INFO L87 Difference]: Start difference. First operand 506 states and 746 transitions. Second operand 13 states. [2019-10-02 14:27:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:10,062 INFO L93 Difference]: Finished difference Result 529 states and 778 transitions. [2019-10-02 14:27:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:10,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-10-02 14:27:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:10,066 INFO L225 Difference]: With dead ends: 529 [2019-10-02 14:27:10,066 INFO L226 Difference]: Without dead ends: 525 [2019-10-02 14:27:10,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:27:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-02 14:27:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-10-02 14:27:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-02 14:27:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2019-10-02 14:27:10,081 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 77 [2019-10-02 14:27:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:10,081 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2019-10-02 14:27:10,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:27:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2019-10-02 14:27:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 14:27:10,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:10,083 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:10,083 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash 704934839, now seen corresponding path program 1 times [2019-10-02 14:27:10,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:10,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:10,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:10,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 26 proven. 99 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 14:27:10,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:10,322 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:10,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:10,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:27:10,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:27:10,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:10,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-02 14:27:10,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:27:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:27:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:10,515 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand 9 states. [2019-10-02 14:27:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:10,735 INFO L93 Difference]: Finished difference Result 555 states and 810 transitions. [2019-10-02 14:27:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:27:10,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-10-02 14:27:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:10,739 INFO L225 Difference]: With dead ends: 555 [2019-10-02 14:27:10,739 INFO L226 Difference]: Without dead ends: 551 [2019-10-02 14:27:10,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-02 14:27:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 544. [2019-10-02 14:27:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 14:27:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2019-10-02 14:27:10,755 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 87 [2019-10-02 14:27:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:10,755 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2019-10-02 14:27:10,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:27:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2019-10-02 14:27:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 14:27:10,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:10,756 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:10,757 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1100197245, now seen corresponding path program 1 times [2019-10-02 14:27:10,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:10,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:11,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:11,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:27:11,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:11,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:11,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-02 14:27:11,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:27:11,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:27:11,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:27:11,461 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand 15 states. [2019-10-02 14:27:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:11,789 INFO L93 Difference]: Finished difference Result 549 states and 802 transitions. [2019-10-02 14:27:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:27:11,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-10-02 14:27:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:11,798 INFO L225 Difference]: With dead ends: 549 [2019-10-02 14:27:11,798 INFO L226 Difference]: Without dead ends: 547 [2019-10-02 14:27:11,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:27:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-02 14:27:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-10-02 14:27:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-02 14:27:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2019-10-02 14:27:11,819 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 90 [2019-10-02 14:27:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:11,820 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2019-10-02 14:27:11,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:27:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2019-10-02 14:27:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 14:27:11,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:11,821 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:11,822 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1191267151, now seen corresponding path program 1 times [2019-10-02 14:27:11,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:11,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:27:11,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:11,946 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:11,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:27:12,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:27:12,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:12,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 14:27:12,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:27:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:27:12,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:27:12,077 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 7 states. [2019-10-02 14:27:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,262 INFO L93 Difference]: Finished difference Result 1070 states and 1569 transitions. [2019-10-02 14:27:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 14:27:12,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-10-02 14:27:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,266 INFO L225 Difference]: With dead ends: 1070 [2019-10-02 14:27:12,266 INFO L226 Difference]: Without dead ends: 672 [2019-10-02 14:27:12,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 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-10-02 14:27:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-10-02 14:27:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 623. [2019-10-02 14:27:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 14:27:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 918 transitions. [2019-10-02 14:27:12,285 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 918 transitions. Word has length 102 [2019-10-02 14:27:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,286 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 918 transitions. [2019-10-02 14:27:12,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:27:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 918 transitions. [2019-10-02 14:27:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 14:27:12,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,287 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,287 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1449432589, now seen corresponding path program 1 times [2019-10-02 14:27:12,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:27:12,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:12,419 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:12,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:27:12,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:27:12,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 14:27:12,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:27:12,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:27:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:27:12,618 INFO L87 Difference]: Start difference. First operand 623 states and 918 transitions. Second operand 7 states. [2019-10-02 14:27:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,747 INFO L93 Difference]: Finished difference Result 670 states and 984 transitions. [2019-10-02 14:27:12,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 14:27:12,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-10-02 14:27:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,751 INFO L225 Difference]: With dead ends: 670 [2019-10-02 14:27:12,751 INFO L226 Difference]: Without dead ends: 664 [2019-10-02 14:27:12,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:27:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-02 14:27:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2019-10-02 14:27:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-02 14:27:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 972 transitions. [2019-10-02 14:27:12,771 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 972 transitions. Word has length 102 [2019-10-02 14:27:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,771 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 972 transitions. [2019-10-02 14:27:12,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:27:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 972 transitions. [2019-10-02 14:27:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 14:27:12,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,772 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,773 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash -669250513, now seen corresponding path program 1 times [2019-10-02 14:27:12,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:13,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:13,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:13,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:13,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:27:13,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:13,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 14:27:13,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:13,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-10-02 14:27:13,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 14:27:13,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 14:27:13,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:27:13,405 INFO L87 Difference]: Start difference. First operand 661 states and 972 transitions. Second operand 16 states. [2019-10-02 14:27:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:14,121 INFO L93 Difference]: Finished difference Result 697 states and 1006 transitions. [2019-10-02 14:27:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:27:14,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-10-02 14:27:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:14,125 INFO L225 Difference]: With dead ends: 697 [2019-10-02 14:27:14,125 INFO L226 Difference]: Without dead ends: 695 [2019-10-02 14:27:14,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:27:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-10-02 14:27:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 661. [2019-10-02 14:27:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-02 14:27:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 971 transitions. [2019-10-02 14:27:14,154 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 971 transitions. Word has length 106 [2019-10-02 14:27:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:14,154 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 971 transitions. [2019-10-02 14:27:14,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 14:27:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 971 transitions. [2019-10-02 14:27:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 14:27:14,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:14,156 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:14,156 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1267384093, now seen corresponding path program 2 times [2019-10-02 14:27:14,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:14,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:14,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:15,029 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-10-02 14:27:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:15,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:15,061 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:15,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:15,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:15,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:15,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:27:15,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 198 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 14:27:15,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:15,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2019-10-02 14:27:15,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:27:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:27:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:27:15,362 INFO L87 Difference]: Start difference. First operand 661 states and 971 transitions. Second operand 20 states. [2019-10-02 14:27:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:16,730 INFO L93 Difference]: Finished difference Result 732 states and 1039 transitions. [2019-10-02 14:27:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:27:16,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-10-02 14:27:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:16,734 INFO L225 Difference]: With dead ends: 732 [2019-10-02 14:27:16,734 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 14:27:16,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:27:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 14:27:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 662. [2019-10-02 14:27:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 14:27:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 972 transitions. [2019-10-02 14:27:16,756 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 972 transitions. Word has length 113 [2019-10-02 14:27:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:16,757 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 972 transitions. [2019-10-02 14:27:16,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:27:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 972 transitions. [2019-10-02 14:27:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 14:27:16,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:16,758 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:16,759 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1815351467, now seen corresponding path program 2 times [2019-10-02 14:27:16,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:16,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:16,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 14:27:16,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:16,916 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:17,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:17,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:17,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:27:17,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 14:27:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:17,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-10-02 14:27:17,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:17,167 INFO L87 Difference]: Start difference. First operand 662 states and 972 transitions. Second operand 8 states. [2019-10-02 14:27:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:17,456 INFO L93 Difference]: Finished difference Result 1275 states and 1870 transitions. [2019-10-02 14:27:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:27:17,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-02 14:27:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:17,460 INFO L225 Difference]: With dead ends: 1275 [2019-10-02 14:27:17,461 INFO L226 Difference]: Without dead ends: 799 [2019-10-02 14:27:17,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 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-10-02 14:27:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-02 14:27:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 740. [2019-10-02 14:27:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-10-02 14:27:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1091 transitions. [2019-10-02 14:27:17,492 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1091 transitions. Word has length 123 [2019-10-02 14:27:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:17,492 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1091 transitions. [2019-10-02 14:27:17,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1091 transitions. [2019-10-02 14:27:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 14:27:17,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:17,494 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:17,494 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2086588819, now seen corresponding path program 2 times [2019-10-02 14:27:17,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:17,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:17,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:17,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:17,813 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:17,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:17,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:17,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:17,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:27:17,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 14:27:18,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:18,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-10-02 14:27:18,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:27:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:27:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:27:18,115 INFO L87 Difference]: Start difference. First operand 740 states and 1091 transitions. Second operand 20 states. [2019-10-02 14:27:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:18,566 INFO L93 Difference]: Finished difference Result 763 states and 1123 transitions. [2019-10-02 14:27:18,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:27:18,566 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 123 [2019-10-02 14:27:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:18,571 INFO L225 Difference]: With dead ends: 763 [2019-10-02 14:27:18,571 INFO L226 Difference]: Without dead ends: 759 [2019-10-02 14:27:18,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:27:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-10-02 14:27:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-10-02 14:27:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-02 14:27:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1117 transitions. [2019-10-02 14:27:18,605 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1117 transitions. Word has length 123 [2019-10-02 14:27:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:18,606 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1117 transitions. [2019-10-02 14:27:18,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:27:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1117 transitions. [2019-10-02 14:27:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 14:27:18,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:18,608 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:18,608 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash -635604026, now seen corresponding path program 2 times [2019-10-02 14:27:18,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:18,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:18,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:18,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:18,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 14:27:19,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:19,049 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:19,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:19,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:19,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:19,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:27:19,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 14:27:19,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:19,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 14:27:19,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:19,265 INFO L87 Difference]: Start difference. First operand 759 states and 1117 transitions. Second operand 10 states. [2019-10-02 14:27:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:19,610 INFO L93 Difference]: Finished difference Result 788 states and 1154 transitions. [2019-10-02 14:27:19,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:19,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-10-02 14:27:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:19,614 INFO L225 Difference]: With dead ends: 788 [2019-10-02 14:27:19,615 INFO L226 Difference]: Without dead ends: 784 [2019-10-02 14:27:19,615 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-10-02 14:27:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 778. [2019-10-02 14:27:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-10-02 14:27:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2019-10-02 14:27:19,646 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 133 [2019-10-02 14:27:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:19,647 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2019-10-02 14:27:19,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2019-10-02 14:27:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 14:27:19,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:19,650 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:19,650 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash -287211762, now seen corresponding path program 2 times [2019-10-02 14:27:19,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:19,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:19,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:20,540 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-10-02 14:27:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:20,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:20,634 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:20,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:20,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:20,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:20,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:27:20,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:20,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 14:27:21,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:21,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-10-02 14:27:21,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:27:21,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:27:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:27:21,054 INFO L87 Difference]: Start difference. First operand 778 states and 1143 transitions. Second operand 21 states. [2019-10-02 14:27:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:21,596 INFO L93 Difference]: Finished difference Result 783 states and 1147 transitions. [2019-10-02 14:27:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:27:21,599 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2019-10-02 14:27:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:21,603 INFO L225 Difference]: With dead ends: 783 [2019-10-02 14:27:21,603 INFO L226 Difference]: Without dead ends: 781 [2019-10-02 14:27:21,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:27:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-02 14:27:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2019-10-02 14:27:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-10-02 14:27:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1144 transitions. [2019-10-02 14:27:21,628 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1144 transitions. Word has length 136 [2019-10-02 14:27:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:21,628 INFO L475 AbstractCegarLoop]: Abstraction has 779 states and 1144 transitions. [2019-10-02 14:27:21,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:27:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2019-10-02 14:27:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:27:21,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:21,630 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:21,631 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2035567456, now seen corresponding path program 2 times [2019-10-02 14:27:21,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:21,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:21,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:21,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 85 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 14:27:21,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:21,780 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:21,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:21,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 14:27:21,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:21,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:27:21,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:27:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 14:27:21,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:21,891 INFO L87 Difference]: Start difference. First operand 779 states and 1144 transitions. Second operand 10 states. [2019-10-02 14:27:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:22,209 INFO L93 Difference]: Finished difference Result 1568 states and 2302 transitions. [2019-10-02 14:27:22,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:22,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2019-10-02 14:27:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:22,215 INFO L225 Difference]: With dead ends: 1568 [2019-10-02 14:27:22,215 INFO L226 Difference]: Without dead ends: 1009 [2019-10-02 14:27:22,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-10-02 14:27:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 935. [2019-10-02 14:27:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-02 14:27:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1377 transitions. [2019-10-02 14:27:22,247 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1377 transitions. Word has length 148 [2019-10-02 14:27:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:22,247 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1377 transitions. [2019-10-02 14:27:22,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1377 transitions. [2019-10-02 14:27:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:27:22,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:22,249 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:22,250 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2001234402, now seen corresponding path program 2 times [2019-10-02 14:27:22,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:22,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:22,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 14:27:22,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:22,481 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:22,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:22,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:22,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:27:22,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:22,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-10-02 14:27:22,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:27:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:27:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:22,722 INFO L87 Difference]: Start difference. First operand 935 states and 1377 transitions. Second operand 9 states. [2019-10-02 14:27:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:22,936 INFO L93 Difference]: Finished difference Result 982 states and 1443 transitions. [2019-10-02 14:27:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:27:22,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2019-10-02 14:27:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:22,940 INFO L225 Difference]: With dead ends: 982 [2019-10-02 14:27:22,941 INFO L226 Difference]: Without dead ends: 976 [2019-10-02 14:27:22,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-10-02 14:27:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 973. [2019-10-02 14:27:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-10-02 14:27:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1431 transitions. [2019-10-02 14:27:22,968 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1431 transitions. Word has length 148 [2019-10-02 14:27:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:22,968 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1431 transitions. [2019-10-02 14:27:22,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:27:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1431 transitions. [2019-10-02 14:27:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:27:22,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:22,970 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:22,971 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:22,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:22,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1445028928, now seen corresponding path program 2 times [2019-10-02 14:27:22,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:22,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:22,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:22,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:22,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:23,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:23,408 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:23,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:23,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:23,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 14:27:23,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 14:27:23,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:23,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-10-02 14:27:23,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:27:23,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:27:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:27:23,790 INFO L87 Difference]: Start difference. First operand 973 states and 1431 transitions. Second operand 23 states. [2019-10-02 14:27:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:24,606 INFO L93 Difference]: Finished difference Result 975 states and 1432 transitions. [2019-10-02 14:27:24,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:27:24,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 152 [2019-10-02 14:27:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:24,609 INFO L225 Difference]: With dead ends: 975 [2019-10-02 14:27:24,610 INFO L226 Difference]: Without dead ends: 973 [2019-10-02 14:27:24,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:27:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-02 14:27:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2019-10-02 14:27:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-10-02 14:27:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1430 transitions. [2019-10-02 14:27:24,638 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1430 transitions. Word has length 152 [2019-10-02 14:27:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:24,638 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1430 transitions. [2019-10-02 14:27:24,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:27:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1430 transitions. [2019-10-02 14:27:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 14:27:24,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:24,640 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:24,640 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1661877298, now seen corresponding path program 3 times [2019-10-02 14:27:24,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:24,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:24,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:25,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:25,403 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:25,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:25,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:27:25,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:25,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:27:25,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 14:27:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:25,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:26,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:26,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 22 [2019-10-02 14:27:26,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 14:27:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 14:27:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:27:26,077 INFO L87 Difference]: Start difference. First operand 973 states and 1430 transitions. Second operand 22 states. [2019-10-02 14:27:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:28,323 INFO L93 Difference]: Finished difference Result 1531 states and 2222 transitions. [2019-10-02 14:27:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:27:28,329 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2019-10-02 14:27:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:28,332 INFO L225 Difference]: With dead ends: 1531 [2019-10-02 14:27:28,332 INFO L226 Difference]: Without dead ends: 814 [2019-10-02 14:27:28,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=252, Invalid=2504, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:27:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-10-02 14:27:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 738. [2019-10-02 14:27:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-02 14:27:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1036 transitions. [2019-10-02 14:27:28,356 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1036 transitions. Word has length 159 [2019-10-02 14:27:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:28,357 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1036 transitions. [2019-10-02 14:27:28,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 14:27:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1036 transitions. [2019-10-02 14:27:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 14:27:28,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:28,359 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:28,359 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 305812452, now seen corresponding path program 3 times [2019-10-02 14:27:28,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:27:28,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:28,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:28,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-02 14:27:28,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:28,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:27:28,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:27:28,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:28,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-02 14:27:28,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:28,811 INFO L87 Difference]: Start difference. First operand 738 states and 1036 transitions. Second operand 10 states. [2019-10-02 14:27:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:28,964 INFO L93 Difference]: Finished difference Result 886 states and 1229 transitions. [2019-10-02 14:27:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:28,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 169 [2019-10-02 14:27:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:28,968 INFO L225 Difference]: With dead ends: 886 [2019-10-02 14:27:28,969 INFO L226 Difference]: Without dead ends: 802 [2019-10-02 14:27:28,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 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-10-02 14:27:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-02 14:27:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 722. [2019-10-02 14:27:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-02 14:27:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1013 transitions. [2019-10-02 14:27:28,993 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1013 transitions. Word has length 169 [2019-10-02 14:27:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:28,993 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 1013 transitions. [2019-10-02 14:27:28,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1013 transitions. [2019-10-02 14:27:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 14:27:28,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:28,996 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:28,997 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1852980602, now seen corresponding path program 1 times [2019-10-02 14:27:28,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:28,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:28,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:28,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 14:27:29,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:29,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:27:29,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:29,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:29,239 INFO L87 Difference]: Start difference. First operand 722 states and 1013 transitions. Second operand 10 states. [2019-10-02 14:27:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:29,418 INFO L93 Difference]: Finished difference Result 861 states and 1209 transitions. [2019-10-02 14:27:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:29,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2019-10-02 14:27:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:29,422 INFO L225 Difference]: With dead ends: 861 [2019-10-02 14:27:29,422 INFO L226 Difference]: Without dead ends: 857 [2019-10-02 14:27:29,423 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-10-02 14:27:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-10-02 14:27:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 855. [2019-10-02 14:27:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-10-02 14:27:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1202 transitions. [2019-10-02 14:27:29,448 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1202 transitions. Word has length 181 [2019-10-02 14:27:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:29,449 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1202 transitions. [2019-10-02 14:27:29,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1202 transitions. [2019-10-02 14:27:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 14:27:29,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:29,453 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:29,453 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1596376353, now seen corresponding path program 3 times [2019-10-02 14:27:29,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:29,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:30,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:30,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:30,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:30,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-02 14:27:30,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:27:30,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:30,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 14:27:30,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:30,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:27:31,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:31,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-10-02 14:27:31,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:27:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:27:31,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:27:31,043 INFO L87 Difference]: Start difference. First operand 855 states and 1202 transitions. Second operand 27 states. [2019-10-02 14:27:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:31,717 INFO L93 Difference]: Finished difference Result 864 states and 1210 transitions. [2019-10-02 14:27:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:27:31,718 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 182 [2019-10-02 14:27:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:31,721 INFO L225 Difference]: With dead ends: 864 [2019-10-02 14:27:31,721 INFO L226 Difference]: Without dead ends: 862 [2019-10-02 14:27:31,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:27:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-02 14:27:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 855. [2019-10-02 14:27:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-10-02 14:27:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1201 transitions. [2019-10-02 14:27:31,751 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1201 transitions. Word has length 182 [2019-10-02 14:27:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:31,751 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1201 transitions. [2019-10-02 14:27:31,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:27:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1201 transitions. [2019-10-02 14:27:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 14:27:31,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:31,755 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:31,755 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash -730696556, now seen corresponding path program 1 times [2019-10-02 14:27:31,756 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:31,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:31,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:31,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:31,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 14:27:31,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:31,950 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:32,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:27:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 14:27:32,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:32,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-10-02 14:27:32,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:32,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:32,192 INFO L87 Difference]: Start difference. First operand 855 states and 1201 transitions. Second operand 11 states. [2019-10-02 14:27:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:32,349 INFO L93 Difference]: Finished difference Result 1437 states and 2015 transitions. [2019-10-02 14:27:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:32,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2019-10-02 14:27:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:32,354 INFO L225 Difference]: With dead ends: 1437 [2019-10-02 14:27:32,354 INFO L226 Difference]: Without dead ends: 962 [2019-10-02 14:27:32,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 205 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-10-02 14:27:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-02 14:27:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 933. [2019-10-02 14:27:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-10-02 14:27:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1313 transitions. [2019-10-02 14:27:32,386 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1313 transitions. Word has length 197 [2019-10-02 14:27:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:32,386 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1313 transitions. [2019-10-02 14:27:32,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1313 transitions. [2019-10-02 14:27:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 14:27:32,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:32,389 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:32,389 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2108593553, now seen corresponding path program 3 times [2019-10-02 14:27:32,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:32,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:32,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:33,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:33,394 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:33,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:33,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-02 14:27:33,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:33,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:27:33,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:34,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 14:27:34,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:27:34,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2019-10-02 14:27:34,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:27:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:27:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:27:34,396 INFO L87 Difference]: Start difference. First operand 933 states and 1313 transitions. Second operand 30 states. [2019-10-02 14:27:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:35,808 INFO L93 Difference]: Finished difference Result 949 states and 1327 transitions. [2019-10-02 14:27:35,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:27:35,808 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 198 [2019-10-02 14:27:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:35,813 INFO L225 Difference]: With dead ends: 949 [2019-10-02 14:27:35,813 INFO L226 Difference]: Without dead ends: 947 [2019-10-02 14:27:35,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=348, Invalid=1632, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:27:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-10-02 14:27:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 933. [2019-10-02 14:27:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-10-02 14:27:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1311 transitions. [2019-10-02 14:27:35,841 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1311 transitions. Word has length 198 [2019-10-02 14:27:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:35,841 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1311 transitions. [2019-10-02 14:27:35,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:27:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1311 transitions. [2019-10-02 14:27:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 14:27:35,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:35,843 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:35,843 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash -699066829, now seen corresponding path program 4 times [2019-10-02 14:27:35,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:35,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:35,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 14:27:36,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:36,039 INFO L224 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-10-02 14:27:36,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:36,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:36,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:36,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:27:36,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 14:27:36,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:36,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-10-02 14:27:36,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:27:36,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:27:36,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:36,373 INFO L87 Difference]: Start difference. First operand 933 states and 1311 transitions. Second operand 12 states. [2019-10-02 14:27:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:36,523 INFO L93 Difference]: Finished difference Result 1127 states and 1564 transitions. [2019-10-02 14:27:36,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:27:36,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 215 [2019-10-02 14:27:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:36,529 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 14:27:36,529 INFO L226 Difference]: Without dead ends: 1043 [2019-10-02 14:27:36,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-02 14:27:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1011. [2019-10-02 14:27:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-10-02 14:27:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1418 transitions. [2019-10-02 14:27:36,559 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1418 transitions. Word has length 215 [2019-10-02 14:27:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:36,559 INFO L475 AbstractCegarLoop]: Abstraction has 1011 states and 1418 transitions. [2019-10-02 14:27:36,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:27:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1418 transitions. [2019-10-02 14:27:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 14:27:36,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:36,561 INFO L411 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:36,562 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 408795747, now seen corresponding path program 2 times [2019-10-02 14:27:36,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:36,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:36,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:27:36,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:36,788 INFO L224 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-10-02 14:27:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:37,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:37,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:37,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:27:37,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:27:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-10-02 14:27:37,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:27:37,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:27:37,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:27:37,099 INFO L87 Difference]: Start difference. First operand 1011 states and 1418 transitions. Second operand 13 states. [2019-10-02 14:27:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:37,253 INFO L93 Difference]: Finished difference Result 1677 states and 2346 transitions. [2019-10-02 14:27:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:27:37,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 243 [2019-10-02 14:27:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:37,258 INFO L225 Difference]: With dead ends: 1677 [2019-10-02 14:27:37,258 INFO L226 Difference]: Without dead ends: 1124 [2019-10-02 14:27:37,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 253 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-10-02 14:27:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-10-02 14:27:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1089. [2019-10-02 14:27:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-10-02 14:27:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1529 transitions. [2019-10-02 14:27:37,291 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1529 transitions. Word has length 243 [2019-10-02 14:27:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:37,292 INFO L475 AbstractCegarLoop]: Abstraction has 1089 states and 1529 transitions. [2019-10-02 14:27:37,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:27:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1529 transitions. [2019-10-02 14:27:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 14:27:37,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:37,294 INFO L411 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:37,294 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1318987330, now seen corresponding path program 5 times [2019-10-02 14:27:37,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:37,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:37,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 14:27:37,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:37,581 INFO L224 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-10-02 14:27:37,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:37,893 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-10-02 14:27:37,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:37,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:27:37,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 14:27:37,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:37,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-10-02 14:27:37,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:27:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:27:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:27:37,974 INFO L87 Difference]: Start difference. First operand 1089 states and 1529 transitions. Second operand 14 states. [2019-10-02 14:27:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:38,152 INFO L93 Difference]: Finished difference Result 1289 states and 1786 transitions. [2019-10-02 14:27:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:27:38,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-10-02 14:27:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:38,159 INFO L225 Difference]: With dead ends: 1289 [2019-10-02 14:27:38,159 INFO L226 Difference]: Without dead ends: 1205 [2019-10-02 14:27:38,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 272 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-10-02 14:27:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-10-02 14:27:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1167. [2019-10-02 14:27:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-10-02 14:27:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1636 transitions. [2019-10-02 14:27:38,196 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1636 transitions. Word has length 261 [2019-10-02 14:27:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:38,197 INFO L475 AbstractCegarLoop]: Abstraction has 1167 states and 1636 transitions. [2019-10-02 14:27:38,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:27:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1636 transitions. [2019-10-02 14:27:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 14:27:38,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:38,199 INFO L411 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:38,199 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash 589114866, now seen corresponding path program 3 times [2019-10-02 14:27:38,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:38,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:38,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 14:27:38,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:38,533 INFO L224 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-10-02 14:27:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:38,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 14:27:38,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:38,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:27:38,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:38,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:38,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 14:27:38,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:27:38,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:27:38,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:38,904 INFO L87 Difference]: Start difference. First operand 1167 states and 1636 transitions. Second operand 19 states. [2019-10-02 14:27:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:40,067 INFO L93 Difference]: Finished difference Result 1316 states and 1834 transitions. [2019-10-02 14:27:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:27:40,068 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 289 [2019-10-02 14:27:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:40,070 INFO L225 Difference]: With dead ends: 1316 [2019-10-02 14:27:40,070 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 14:27:40,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:27:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 14:27:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 662. [2019-10-02 14:27:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 14:27:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 909 transitions. [2019-10-02 14:27:40,090 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 909 transitions. Word has length 289 [2019-10-02 14:27:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:40,090 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 909 transitions. [2019-10-02 14:27:40,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:27:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 909 transitions. [2019-10-02 14:27:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 14:27:40,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:40,093 INFO L411 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:40,093 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 927920032, now seen corresponding path program 6 times [2019-10-02 14:27:40,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:40,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:40,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 14:27:40,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:40,611 INFO L224 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-10-02 14:27:40,659 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:27:41,054 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-02 14:27:41,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:41,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:27:41,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:41,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-10-02 14:27:41,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:27:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:27:41,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:41,239 INFO L87 Difference]: Start difference. First operand 662 states and 909 transitions. Second operand 18 states. [2019-10-02 14:27:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:41,502 INFO L93 Difference]: Finished difference Result 867 states and 1192 transitions. [2019-10-02 14:27:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:27:41,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 353 [2019-10-02 14:27:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:41,508 INFO L225 Difference]: With dead ends: 867 [2019-10-02 14:27:41,508 INFO L226 Difference]: Without dead ends: 783 [2019-10-02 14:27:41,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-02 14:27:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 740. [2019-10-02 14:27:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-10-02 14:27:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1016 transitions. [2019-10-02 14:27:41,540 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1016 transitions. Word has length 353 [2019-10-02 14:27:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:41,541 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1016 transitions. [2019-10-02 14:27:41,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:27:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1016 transitions. [2019-10-02 14:27:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-02 14:27:41,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:41,548 INFO L411 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:41,548 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1934002415, now seen corresponding path program 7 times [2019-10-02 14:27:41,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:41,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:41,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 14:27:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 14:27:43,294 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 14:27:43,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 02:27:43 BoogieIcfgContainer [2019-10-02 14:27:43,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 14:27:43,542 INFO L168 Benchmark]: Toolchain (without parser) took 43767.36 ms. Allocated memory was 133.7 MB in the beginning and 789.6 MB in the end (delta: 655.9 MB). Free memory was 89.1 MB in the beginning and 175.6 MB in the end (delta: -86.5 MB). Peak memory consumption was 569.4 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:43,543 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 14:27:43,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.62 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 172.1 MB in the end (delta: -83.2 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:43,545 INFO L168 Benchmark]: Boogie Preprocessor took 74.68 ms. Allocated memory is still 200.8 MB. Free memory was 172.1 MB in the beginning and 168.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:43,550 INFO L168 Benchmark]: RCFGBuilder took 887.07 ms. Allocated memory is still 200.8 MB. Free memory was 168.3 MB in the beginning and 117.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:43,550 INFO L168 Benchmark]: TraceAbstraction took 42223.40 ms. Allocated memory was 200.8 MB in the beginning and 789.6 MB in the end (delta: 588.8 MB). Free memory was 116.8 MB in the beginning and 175.6 MB in the end (delta: -58.8 MB). Peak memory consumption was 530.0 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:43,561 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.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 575.62 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 172.1 MB in the end (delta: -83.2 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.68 ms. Allocated memory is still 200.8 MB. Free memory was 172.1 MB in the beginning and 168.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.07 ms. Allocated memory is still 200.8 MB. Free memory was 168.3 MB in the beginning and 117.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42223.40 ms. Allocated memory was 200.8 MB in the beginning and 789.6 MB in the end (delta: 588.8 MB). Free memory was 116.8 MB in the beginning and 175.6 MB in the end (delta: -58.8 MB). Peak memory consumption was 530.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_Protocol = 1; [L6] int m_msg_2 = 2; [L7] int m_recv_ack_2 = 3; [L8] int m_msg_1_1 = 4; [L9] int m_msg_1_2 = 5; [L10] int m_recv_ack_1_1 = 6; [L11] int m_recv_ack_1_2 = 7; VAL [\old(m_msg_1_1)=21, \old(m_msg_1_2)=18, \old(m_msg_2)=19, \old(m_Protocol)=23, \old(m_recv_ack_1_1)=20, \old(m_recv_ack_1_2)=22, \old(m_recv_ack_2)=24, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L16] int q = 0; [L17] int method_id; [L20] int this_expect = 0; [L21] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=1, P9=10, q=0, this_buffer_empty=0, this_expect=0] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [L48] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=1, P9=10, q=0, this_buffer_empty=0, this_expect=0] [L50] COND FALSE !(0) [L54] q = 1 [L56] this_expect=0 [L56] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=1, P9=10, q=1, this_buffer_empty=1, this_expect=0] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=10, P9=10, q=1, this_buffer_empty=1, this_expect=0] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=10, P9=10, q=1, this_buffer_empty=1, this_expect=0] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=10, P9=10, q=1, this_buffer_empty=1, this_expect=0] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=10, P2=10, P3=0, P4=10, P5=0, P6=0, P7=0, P8=10, P9=10, q=3, this_buffer_empty=0, this_expect=1] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=10, P3=-1, P4=10, P5=0, P6=0, P7=0, P8=10, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=10, P3=-1, P4=10, P5=0, P6=0, P7=0, P8=10, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=10, P3=-1, P4=10, P5=0, P6=0, P7=0, P8=10, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=10, P3=-1, P4=10, P5=0, P6=0, P7=0, P8=10, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=10, P3=-1, P4=10, P5=0, P6=0, P7=0, P8=10, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=10, P3=-1, P4=10, P5=0, P6=0, P7=0, P8=10, P9=0, q=4, this_buffer_empty=1, this_expect=1] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=3, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=2] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=2] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=2] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=2] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=2] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=4] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=6] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=6] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=8] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=8] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=8] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=8] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=8] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=10] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=10] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=10] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=10] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=10] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=12] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=12] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=12] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=12] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=12] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=14] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=14] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=14] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=14] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=14] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=16] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=5, this_buffer_empty=0, this_expect=16] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=6, q=1, this_buffer_empty=1, this_expect=16] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=16] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=16] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=16] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=17] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND TRUE this_expect > 16 [L39] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L286] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L569] __VERIFIER_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 115 locations, 1 error locations. UNSAFE Result, 42.1s OverallTime, 45 OverallIterations, 35 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9628 SDtfs, 16870 SDslu, 57183 SDs, 0 SdLazy, 9900 SolverSat, 1220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5070 GetRequests, 4524 SyntacticMatches, 40 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1167occurred in iteration=42, 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: 0.9s AutomataMinimizationTime, 44 MinimizatonAttempts, 943 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 9700 NumberOfCodeBlocks, 9250 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 9222 ConstructedInterpolants, 126 QuantifiedInterpolants, 7091289 SizeOfPredicates, 73 NumberOfNonLiveVariables, 24172 ConjunctsInSsa, 633 ConjunctsInUnsatCore, 79 InterpolantComputations, 11 PerfectInterpolantSequences, 9436/33288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...