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-112bae1 [2019-09-07 23:33:51,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 23:33:51,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 23:33:51,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 23:33:51,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 23:33:51,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 23:33:51,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 23:33:51,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 23:33:51,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 23:33:51,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 23:33:51,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 23:33:51,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 23:33:51,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 23:33:51,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 23:33:51,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 23:33:51,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 23:33:51,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 23:33:51,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 23:33:51,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 23:33:51,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 23:33:51,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 23:33:51,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 23:33:51,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 23:33:51,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 23:33:51,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 23:33:51,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 23:33:51,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 23:33:51,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 23:33:51,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 23:33:51,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 23:33:51,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 23:33:51,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 23:33:51,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 23:33:51,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 23:33:51,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 23:33:51,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 23:33:51,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 23:33:51,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 23:33:51,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 23:33:51,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 23:33:51,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 23:33:51,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 23:33:51,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 23:33:51,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 23:33:51,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 23:33:51,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 23:33:51,200 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 23:33:51,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 23:33:51,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 23:33:51,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 23:33:51,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 23:33:51,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 23:33:51,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 23:33:51,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 23:33:51,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 23:33:51,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 23:33:51,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 23:33:51,202 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 23:33:51,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 23:33:51,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 23:33:51,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 23:33:51,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 23:33:51,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 23:33:51,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:33:51,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 23:33:51,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 23:33:51,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 23:33:51,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 23:33:51,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 23:33:51,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 23:33:51,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 23:33:51,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 23:33:51,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 23:33:51,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 23:33:51,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 23:33:51,275 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 23:33:51,276 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-09-07 23:33:51,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bad7a0d/02d31431db144c1283dd49b731cec12e/FLAG9253f06f0 [2019-09-07 23:33:51,800 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 23:33:51,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-09-07 23:33:51,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bad7a0d/02d31431db144c1283dd49b731cec12e/FLAG9253f06f0 [2019-09-07 23:33:52,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bad7a0d/02d31431db144c1283dd49b731cec12e [2019-09-07 23:33:52,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 23:33:52,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 23:33:52,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 23:33:52,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 23:33:52,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 23:33:52,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a40123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52, skipping insertion in model container [2019-09-07 23:33:52,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,143 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 23:33:52,186 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 23:33:52,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:33:52,622 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 23:33:52,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:33:52,736 INFO L192 MainTranslator]: Completed translation [2019-09-07 23:33:52,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52 WrapperNode [2019-09-07 23:33:52,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 23:33:52,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 23:33:52,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 23:33:52,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 23:33:52,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... [2019-09-07 23:33:52,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 23:33:52,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 23:33:52,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 23:33:52,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 23:33:52,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:33:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 23:33:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 23:33:52,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 23:33:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 23:33:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 23:33:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 23:33:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 23:33:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 23:33:53,721 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 23:33:53,722 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 23:33:53,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:33:53 BoogieIcfgContainer [2019-09-07 23:33:53,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 23:33:53,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 23:33:53,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 23:33:53,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 23:33:53,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:33:52" (1/3) ... [2019-09-07 23:33:53,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fdd051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:33:53, skipping insertion in model container [2019-09-07 23:33:53,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:52" (2/3) ... [2019-09-07 23:33:53,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fdd051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:33:53, skipping insertion in model container [2019-09-07 23:33:53,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:33:53" (3/3) ... [2019-09-07 23:33:53,743 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-09-07 23:33:53,756 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 23:33:53,765 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 23:33:53,783 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 23:33:53,833 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 23:33:53,834 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 23:33:53,834 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 23:33:53,834 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 23:33:53,835 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 23:33:53,835 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 23:33:53,835 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 23:33:53,835 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 23:33:53,836 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 23:33:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-09-07 23:33:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 23:33:53,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:53,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:53,882 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:53,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash 919157391, now seen corresponding path program 1 times [2019-09-07 23:33:53,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:53,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:54,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:54,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:54,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:54,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:54,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:54,143 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-09-07 23:33:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:54,525 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2019-09-07 23:33:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:54,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 23:33:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:54,541 INFO L225 Difference]: With dead ends: 331 [2019-09-07 23:33:54,541 INFO L226 Difference]: Without dead ends: 206 [2019-09-07 23:33:54,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-07 23:33:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-09-07 23:33:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 23:33:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-09-07 23:33:54,604 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2019-09-07 23:33:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:54,605 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-09-07 23:33:54,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-09-07 23:33:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 23:33:54,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:54,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:54,607 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 736602936, now seen corresponding path program 1 times [2019-09-07 23:33:54,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:54,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:54,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:54,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:54,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:54,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:54,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:54,657 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-09-07 23:33:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:54,710 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2019-09-07 23:33:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:54,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 23:33:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:54,713 INFO L225 Difference]: With dead ends: 365 [2019-09-07 23:33:54,713 INFO L226 Difference]: Without dead ends: 189 [2019-09-07 23:33:54,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-07 23:33:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-07 23:33:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-07 23:33:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-09-07 23:33:54,731 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2019-09-07 23:33:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:54,731 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-09-07 23:33:54,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-09-07 23:33:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 23:33:54,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:54,733 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:54,733 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash 816788357, now seen corresponding path program 1 times [2019-09-07 23:33:54,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:54,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:54,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:55,121 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 33 [2019-09-07 23:33:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:55,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:55,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:33:55,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:33:55,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:33:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:33:55,128 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 4 states. [2019-09-07 23:33:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:55,455 INFO L93 Difference]: Finished difference Result 292 states and 485 transitions. [2019-09-07 23:33:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:33:55,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-07 23:33:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:55,458 INFO L225 Difference]: With dead ends: 292 [2019-09-07 23:33:55,458 INFO L226 Difference]: Without dead ends: 276 [2019-09-07 23:33:55,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:33:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-07 23:33:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-09-07 23:33:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-07 23:33:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-09-07 23:33:55,491 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2019-09-07 23:33:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:55,492 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-09-07 23:33:55,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:33:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-09-07 23:33:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 23:33:55,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:55,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:33:55,497 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1993084704, now seen corresponding path program 1 times [2019-09-07 23:33:55,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:55,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:55,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:55,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:55,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:55,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:55,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:55,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:55,571 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-09-07 23:33:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:55,605 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2019-09-07 23:33:55,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:55,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 23:33:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:55,608 INFO L225 Difference]: With dead ends: 468 [2019-09-07 23:33:55,608 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 23:33:55,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 23:33:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-09-07 23:33:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-07 23:33:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-09-07 23:33:55,622 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2019-09-07 23:33:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:55,622 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-09-07 23:33:55,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-09-07 23:33:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 23:33:55,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:55,624 INFO L399 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-09-07 23:33:55,625 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:55,625 INFO L82 PathProgramCache]: Analyzing trace with hash -365898165, now seen corresponding path program 1 times [2019-09-07 23:33:55,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:55,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:55,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:55,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:55,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:55,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:55,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:33:55,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:55,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 23:33:55,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 23:33:55,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:33:55,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 23:33:55,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:33:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:33:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:55,895 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 5 states. [2019-09-07 23:33:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:56,200 INFO L93 Difference]: Finished difference Result 498 states and 813 transitions. [2019-09-07 23:33:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:33:56,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-07 23:33:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:56,203 INFO L225 Difference]: With dead ends: 498 [2019-09-07 23:33:56,203 INFO L226 Difference]: Without dead ends: 288 [2019-09-07 23:33:56,204 INFO L628 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-09-07 23:33:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-07 23:33:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 245. [2019-09-07 23:33:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-07 23:33:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 408 transitions. [2019-09-07 23:33:56,225 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 408 transitions. Word has length 28 [2019-09-07 23:33:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:56,227 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 408 transitions. [2019-09-07 23:33:56,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:33:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 408 transitions. [2019-09-07 23:33:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 23:33:56,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:56,230 INFO L399 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-09-07 23:33:56,232 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash -944739986, now seen corresponding path program 1 times [2019-09-07 23:33:56,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:56,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:56,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:56,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:56,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:56,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:56,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 23:33:56,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:56,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:56,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 23:33:56,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:33:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:33:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:56,432 INFO L87 Difference]: Start difference. First operand 245 states and 408 transitions. Second operand 5 states. [2019-09-07 23:33:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:56,608 INFO L93 Difference]: Finished difference Result 464 states and 780 transitions. [2019-09-07 23:33:56,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 23:33:56,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-07 23:33:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:56,613 INFO L225 Difference]: With dead ends: 464 [2019-09-07 23:33:56,613 INFO L226 Difference]: Without dead ends: 452 [2019-09-07 23:33:56,613 INFO L628 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-09-07 23:33:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-07 23:33:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2019-09-07 23:33:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-09-07 23:33:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 730 transitions. [2019-09-07 23:33:56,631 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 730 transitions. Word has length 30 [2019-09-07 23:33:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:56,631 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 730 transitions. [2019-09-07 23:33:56,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:33:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 730 transitions. [2019-09-07 23:33:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 23:33:56,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:56,634 INFO L399 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-09-07 23:33:56,635 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash 789275061, now seen corresponding path program 1 times [2019-09-07 23:33:56,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:56,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:56,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:56,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:56,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:33:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:56,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 23:33:56,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:56,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:56,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-09-07 23:33:56,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:33:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:33:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:33:56,929 INFO L87 Difference]: Start difference. First operand 438 states and 730 transitions. Second operand 6 states. [2019-09-07 23:33:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:57,073 INFO L93 Difference]: Finished difference Result 495 states and 817 transitions. [2019-09-07 23:33:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:33:57,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-07 23:33:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:57,077 INFO L225 Difference]: With dead ends: 495 [2019-09-07 23:33:57,077 INFO L226 Difference]: Without dead ends: 490 [2019-09-07 23:33:57,078 INFO L628 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-09-07 23:33:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-07 23:33:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-09-07 23:33:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-07 23:33:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2019-09-07 23:33:57,095 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 31 [2019-09-07 23:33:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:57,096 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2019-09-07 23:33:57,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:33:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2019-09-07 23:33:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 23:33:57,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:57,097 INFO L399 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-09-07 23:33:57,098 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:57,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2038890699, now seen corresponding path program 1 times [2019-09-07 23:33:57,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:57,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:57,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:57,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 23:33:57,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:57,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:57,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:57,130 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand 3 states. [2019-09-07 23:33:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:57,182 INFO L93 Difference]: Finished difference Result 949 states and 1566 transitions. [2019-09-07 23:33:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:57,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 23:33:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:57,186 INFO L225 Difference]: With dead ends: 949 [2019-09-07 23:33:57,186 INFO L226 Difference]: Without dead ends: 495 [2019-09-07 23:33:57,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-07 23:33:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-09-07 23:33:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-07 23:33:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 794 transitions. [2019-09-07 23:33:57,204 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 794 transitions. Word has length 32 [2019-09-07 23:33:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:57,204 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 794 transitions. [2019-09-07 23:33:57,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 794 transitions. [2019-09-07 23:33:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 23:33:57,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:57,209 INFO L399 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-09-07 23:33:57,210 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 820851006, now seen corresponding path program 1 times [2019-09-07 23:33:57,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:57,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:33:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:57,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:57,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:57,273 INFO L87 Difference]: Start difference. First operand 493 states and 794 transitions. Second operand 3 states. [2019-09-07 23:33:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:57,311 INFO L93 Difference]: Finished difference Result 939 states and 1525 transitions. [2019-09-07 23:33:57,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:57,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-07 23:33:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:57,315 INFO L225 Difference]: With dead ends: 939 [2019-09-07 23:33:57,315 INFO L226 Difference]: Without dead ends: 495 [2019-09-07 23:33:57,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-07 23:33:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-09-07 23:33:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-07 23:33:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 788 transitions. [2019-09-07 23:33:57,338 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 788 transitions. Word has length 40 [2019-09-07 23:33:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:57,340 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 788 transitions. [2019-09-07 23:33:57,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 788 transitions. [2019-09-07 23:33:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 23:33:57,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:57,342 INFO L399 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-09-07 23:33:57,343 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1867136664, now seen corresponding path program 1 times [2019-09-07 23:33:57,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:57,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:57,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:57,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 23:33:57,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 23:33:57,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:57,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-09-07 23:33:57,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 23:33:57,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 23:33:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 23:33:57,739 INFO L87 Difference]: Start difference. First operand 493 states and 788 transitions. Second operand 8 states. [2019-09-07 23:33:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:58,400 INFO L93 Difference]: Finished difference Result 1034 states and 1641 transitions. [2019-09-07 23:33:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 23:33:58,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-09-07 23:33:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:58,404 INFO L225 Difference]: With dead ends: 1034 [2019-09-07 23:33:58,405 INFO L226 Difference]: Without dead ends: 583 [2019-09-07 23:33:58,408 INFO L628 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-09-07 23:33:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-07 23:33:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 544. [2019-09-07 23:33:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-07 23:33:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 867 transitions. [2019-09-07 23:33:58,426 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 867 transitions. Word has length 41 [2019-09-07 23:33:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:58,426 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 867 transitions. [2019-09-07 23:33:58,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 23:33:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 867 transitions. [2019-09-07 23:33:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 23:33:58,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:58,427 INFO L399 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-09-07 23:33:58,428 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2035215205, now seen corresponding path program 1 times [2019-09-07 23:33:58,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:58,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:58,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 23:33:58,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:58,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:33:58,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:58,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 23:33:58,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 23:33:58,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:58,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 23:33:58,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:33:58,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:33:58,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:33:58,600 INFO L87 Difference]: Start difference. First operand 544 states and 867 transitions. Second operand 4 states. [2019-09-07 23:33:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:58,716 INFO L93 Difference]: Finished difference Result 558 states and 879 transitions. [2019-09-07 23:33:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:33:58,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-09-07 23:33:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:58,721 INFO L225 Difference]: With dead ends: 558 [2019-09-07 23:33:58,721 INFO L226 Difference]: Without dead ends: 546 [2019-09-07 23:33:58,722 INFO L628 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-09-07 23:33:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-07 23:33:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-09-07 23:33:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-07 23:33:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 841 transitions. [2019-09-07 23:33:58,740 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 841 transitions. Word has length 42 [2019-09-07 23:33:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:58,740 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 841 transitions. [2019-09-07 23:33:58,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:33:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 841 transitions. [2019-09-07 23:33:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 23:33:58,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:58,742 INFO L399 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-09-07 23:33:58,742 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:58,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1265387988, now seen corresponding path program 1 times [2019-09-07 23:33:58,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:58,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:58,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:58,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:58,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-07 23:33:58,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 23:33:59,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:33:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-07 23:33:59,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:33:59,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:33:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:59,081 INFO L87 Difference]: Start difference. First operand 544 states and 841 transitions. Second operand 5 states. [2019-09-07 23:33:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:59,227 INFO L93 Difference]: Finished difference Result 553 states and 848 transitions. [2019-09-07 23:33:59,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 23:33:59,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-07 23:33:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:59,232 INFO L225 Difference]: With dead ends: 553 [2019-09-07 23:33:59,232 INFO L226 Difference]: Without dead ends: 551 [2019-09-07 23:33:59,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-07 23:33:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 545. [2019-09-07 23:33:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-07 23:33:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 842 transitions. [2019-09-07 23:33:59,251 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 842 transitions. Word has length 44 [2019-09-07 23:33:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:59,257 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 842 transitions. [2019-09-07 23:33:59,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:33:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 842 transitions. [2019-09-07 23:33:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 23:33:59,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:59,258 INFO L399 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-09-07 23:33:59,259 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash -447084202, now seen corresponding path program 1 times [2019-09-07 23:33:59,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:59,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:33:59,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:59,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:59,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:59,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:59,307 INFO L87 Difference]: Start difference. First operand 545 states and 842 transitions. Second operand 3 states. [2019-09-07 23:33:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:59,346 INFO L93 Difference]: Finished difference Result 1053 states and 1621 transitions. [2019-09-07 23:33:59,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:59,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-07 23:33:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:59,350 INFO L225 Difference]: With dead ends: 1053 [2019-09-07 23:33:59,350 INFO L226 Difference]: Without dead ends: 557 [2019-09-07 23:33:59,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-07 23:33:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2019-09-07 23:33:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-07 23:33:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 835 transitions. [2019-09-07 23:33:59,371 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 835 transitions. Word has length 45 [2019-09-07 23:33:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:59,371 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 835 transitions. [2019-09-07 23:33:59,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 835 transitions. [2019-09-07 23:33:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 23:33:59,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:59,373 INFO L399 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-09-07 23:33:59,373 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1882634818, now seen corresponding path program 1 times [2019-09-07 23:33:59,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:59,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 23:33:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:33:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:33:59,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:33:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:33:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:59,415 INFO L87 Difference]: Start difference. First operand 555 states and 835 transitions. Second operand 3 states. [2019-09-07 23:33:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:59,450 INFO L93 Difference]: Finished difference Result 799 states and 1202 transitions. [2019-09-07 23:33:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:33:59,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-07 23:33:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:59,453 INFO L225 Difference]: With dead ends: 799 [2019-09-07 23:33:59,453 INFO L226 Difference]: Without dead ends: 313 [2019-09-07 23:33:59,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:33:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-07 23:33:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2019-09-07 23:33:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-07 23:33:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2019-09-07 23:33:59,468 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 55 [2019-09-07 23:33:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:59,469 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2019-09-07 23:33:59,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:33:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2019-09-07 23:33:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 23:33:59,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:59,470 INFO L399 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-09-07 23:33:59,471 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1573307774, now seen corresponding path program 1 times [2019-09-07 23:33:59,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:59,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:59,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 23:33:59,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:59,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:59,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 23:33:59,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:33:59,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-07 23:33:59,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:33:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:33:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:33:59,712 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand 5 states. [2019-09-07 23:33:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:33:59,849 INFO L93 Difference]: Finished difference Result 660 states and 968 transitions. [2019-09-07 23:33:59,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 23:33:59,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-07 23:33:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:33:59,852 INFO L225 Difference]: With dead ends: 660 [2019-09-07 23:33:59,852 INFO L226 Difference]: Without dead ends: 418 [2019-09-07 23:33:59,855 INFO L628 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-09-07 23:33:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-07 23:33:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 389. [2019-09-07 23:33:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-09-07 23:33:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 573 transitions. [2019-09-07 23:33:59,870 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 573 transitions. Word has length 56 [2019-09-07 23:33:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:59,870 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 573 transitions. [2019-09-07 23:33:59,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:33:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 573 transitions. [2019-09-07 23:33:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 23:33:59,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:59,871 INFO L399 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-09-07 23:33:59,871 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1831473212, now seen corresponding path program 1 times [2019-09-07 23:33:59,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 23:33:59,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:59,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:33:59,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:00,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 23:34:00,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 23:34:00,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:00,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-07 23:34:00,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:34:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:34:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:34:00,066 INFO L87 Difference]: Start difference. First operand 389 states and 573 transitions. Second operand 5 states. [2019-09-07 23:34:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:00,158 INFO L93 Difference]: Finished difference Result 436 states and 639 transitions. [2019-09-07 23:34:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 23:34:00,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-07 23:34:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:00,161 INFO L225 Difference]: With dead ends: 436 [2019-09-07 23:34:00,161 INFO L226 Difference]: Without dead ends: 430 [2019-09-07 23:34:00,161 INFO L628 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-09-07 23:34:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-07 23:34:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-09-07 23:34:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-07 23:34:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 627 transitions. [2019-09-07 23:34:00,175 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 627 transitions. Word has length 56 [2019-09-07 23:34:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:00,176 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 627 transitions. [2019-09-07 23:34:00,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:34:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2019-09-07 23:34:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 23:34:00,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:00,177 INFO L399 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-09-07 23:34:00,177 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1104488738, now seen corresponding path program 1 times [2019-09-07 23:34:00,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:00,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:00,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:00,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:00,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:00,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:00,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 23:34:00,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:00,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-09-07 23:34:00,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:34:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:34:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:34:00,684 INFO L87 Difference]: Start difference. First operand 427 states and 627 transitions. Second operand 9 states. [2019-09-07 23:34:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:00,929 INFO L93 Difference]: Finished difference Result 430 states and 629 transitions. [2019-09-07 23:34:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:34:00,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-09-07 23:34:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:00,934 INFO L225 Difference]: With dead ends: 430 [2019-09-07 23:34:00,934 INFO L226 Difference]: Without dead ends: 428 [2019-09-07 23:34:00,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 23:34:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-09-07 23:34:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2019-09-07 23:34:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-07 23:34:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 626 transitions. [2019-09-07 23:34:00,956 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 626 transitions. Word has length 60 [2019-09-07 23:34:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:00,956 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 626 transitions. [2019-09-07 23:34:00,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:34:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 626 transitions. [2019-09-07 23:34:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 23:34:00,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:00,958 INFO L399 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-09-07 23:34:00,958 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash 855434068, now seen corresponding path program 1 times [2019-09-07 23:34:00,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:00,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:01,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:01,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:01,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:01,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 23:34:01,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:34:01,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:01,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-09-07 23:34:01,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 23:34:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 23:34:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:34:01,576 INFO L87 Difference]: Start difference. First operand 427 states and 626 transitions. Second operand 11 states. [2019-09-07 23:34:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:02,068 INFO L93 Difference]: Finished difference Result 455 states and 652 transitions. [2019-09-07 23:34:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 23:34:02,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-09-07 23:34:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:02,071 INFO L225 Difference]: With dead ends: 455 [2019-09-07 23:34:02,071 INFO L226 Difference]: Without dead ends: 453 [2019-09-07 23:34:02,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-09-07 23:34:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-07 23:34:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 428. [2019-09-07 23:34:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-07 23:34:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-09-07 23:34:02,086 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 67 [2019-09-07 23:34:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:02,087 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-09-07 23:34:02,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 23:34:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-09-07 23:34:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 23:34:02,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:02,088 INFO L399 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-09-07 23:34:02,088 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1201928326, now seen corresponding path program 1 times [2019-09-07 23:34:02,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:02,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:34:02,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:02,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:02,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:02,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 23:34:02,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:34:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:02,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-07 23:34:02,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:34:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:34:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:34:02,315 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 6 states. [2019-09-07 23:34:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:02,497 INFO L93 Difference]: Finished difference Result 865 states and 1269 transitions. [2019-09-07 23:34:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 23:34:02,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-07 23:34:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:02,501 INFO L225 Difference]: With dead ends: 865 [2019-09-07 23:34:02,501 INFO L226 Difference]: Without dead ends: 545 [2019-09-07 23:34:02,502 INFO L628 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-09-07 23:34:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-07 23:34:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 506. [2019-09-07 23:34:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-07 23:34:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 746 transitions. [2019-09-07 23:34:02,523 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 746 transitions. Word has length 77 [2019-09-07 23:34:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:02,523 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 746 transitions. [2019-09-07 23:34:02,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:34:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 746 transitions. [2019-09-07 23:34:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 23:34:02,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:02,525 INFO L399 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-09-07 23:34:02,525 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash 808901316, now seen corresponding path program 1 times [2019-09-07 23:34:02,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:02,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:02,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:02,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:02,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:02,794 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-09-07 23:34:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:02,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 23:34:02,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:02,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:34:02,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:02,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-07 23:34:02,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 23:34:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 23:34:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 23:34:02,981 INFO L87 Difference]: Start difference. First operand 506 states and 746 transitions. Second operand 13 states. [2019-09-07 23:34:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:03,232 INFO L93 Difference]: Finished difference Result 529 states and 778 transitions. [2019-09-07 23:34:03,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:03,232 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-07 23:34:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:03,235 INFO L225 Difference]: With dead ends: 529 [2019-09-07 23:34:03,235 INFO L226 Difference]: Without dead ends: 525 [2019-09-07 23:34:03,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-07 23:34:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-07 23:34:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-09-07 23:34:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-07 23:34:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2019-09-07 23:34:03,257 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 77 [2019-09-07 23:34:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:03,257 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2019-09-07 23:34:03,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 23:34:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2019-09-07 23:34:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 23:34:03,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:03,259 INFO L399 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-09-07 23:34:03,259 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash 704934839, now seen corresponding path program 1 times [2019-09-07 23:34:03,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:03,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:03,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:03,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:03,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 26 proven. 99 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 23:34:03,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:03,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:03,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:03,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 23:34:03,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 23:34:03,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:03,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-09-07 23:34:03,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:34:03,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:34:03,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:34:03,729 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand 9 states. [2019-09-07 23:34:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:04,081 INFO L93 Difference]: Finished difference Result 581 states and 835 transitions. [2019-09-07 23:34:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 23:34:04,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-07 23:34:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:04,086 INFO L225 Difference]: With dead ends: 581 [2019-09-07 23:34:04,087 INFO L226 Difference]: Without dead ends: 577 [2019-09-07 23:34:04,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 23:34:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-07 23:34:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 544. [2019-09-07 23:34:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-07 23:34:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2019-09-07 23:34:04,111 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 87 [2019-09-07 23:34:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:04,111 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2019-09-07 23:34:04,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:34:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2019-09-07 23:34:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 23:34:04,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:04,113 INFO L399 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-09-07 23:34:04,113 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:04,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1100197245, now seen corresponding path program 1 times [2019-09-07 23:34:04,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:04,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:04,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:04,592 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 22 [2019-09-07 23:34:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:04,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:04,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:04,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:04,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 23:34:04,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:04,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:34:04,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:04,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-09-07 23:34:04,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 23:34:04,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 23:34:04,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-07 23:34:04,860 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand 16 states. [2019-09-07 23:34:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:05,414 INFO L93 Difference]: Finished difference Result 548 states and 802 transitions. [2019-09-07 23:34:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 23:34:05,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2019-09-07 23:34:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:05,424 INFO L225 Difference]: With dead ends: 548 [2019-09-07 23:34:05,424 INFO L226 Difference]: Without dead ends: 546 [2019-09-07 23:34:05,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-09-07 23:34:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-07 23:34:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 545. [2019-09-07 23:34:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-07 23:34:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2019-09-07 23:34:05,441 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 90 [2019-09-07 23:34:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:05,441 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2019-09-07 23:34:05,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 23:34:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2019-09-07 23:34:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 23:34:05,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:05,445 INFO L399 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-09-07 23:34:05,446 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1191267151, now seen corresponding path program 1 times [2019-09-07 23:34:05,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:05,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 23:34:05,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:05,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:05,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:05,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 23:34:05,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:34:05,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:05,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-07 23:34:05,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 23:34:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 23:34:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 23:34:05,688 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 7 states. [2019-09-07 23:34:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:05,892 INFO L93 Difference]: Finished difference Result 1070 states and 1569 transitions. [2019-09-07 23:34:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:34:05,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-09-07 23:34:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:05,896 INFO L225 Difference]: With dead ends: 1070 [2019-09-07 23:34:05,896 INFO L226 Difference]: Without dead ends: 672 [2019-09-07 23:34:05,898 INFO L628 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-09-07 23:34:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-07 23:34:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 623. [2019-09-07 23:34:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-07 23:34:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 918 transitions. [2019-09-07 23:34:05,917 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 918 transitions. Word has length 102 [2019-09-07 23:34:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:05,917 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 918 transitions. [2019-09-07 23:34:05,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 23:34:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 918 transitions. [2019-09-07 23:34:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 23:34:05,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:05,919 INFO L399 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-09-07 23:34:05,919 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1449432589, now seen corresponding path program 1 times [2019-09-07 23:34:05,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:05,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:05,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:05,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:05,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 23:34:06,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:06,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:06,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:06,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 23:34:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 23:34:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-07 23:34:06,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 23:34:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 23:34:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 23:34:06,213 INFO L87 Difference]: Start difference. First operand 623 states and 918 transitions. Second operand 7 states. [2019-09-07 23:34:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:06,379 INFO L93 Difference]: Finished difference Result 670 states and 984 transitions. [2019-09-07 23:34:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:34:06,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-09-07 23:34:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:06,385 INFO L225 Difference]: With dead ends: 670 [2019-09-07 23:34:06,386 INFO L226 Difference]: Without dead ends: 664 [2019-09-07 23:34:06,386 INFO L628 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-09-07 23:34:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-07 23:34:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2019-09-07 23:34:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-07 23:34:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 972 transitions. [2019-09-07 23:34:06,405 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 972 transitions. Word has length 102 [2019-09-07 23:34:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:06,405 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 972 transitions. [2019-09-07 23:34:06,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 23:34:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 972 transitions. [2019-09-07 23:34:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 23:34:06,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:06,407 INFO L399 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-09-07 23:34:06,407 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:06,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash -669250513, now seen corresponding path program 1 times [2019-09-07 23:34:06,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:06,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:06,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:06,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 23:34:06,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:06,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:34:06,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:06,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-09-07 23:34:06,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 23:34:06,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 23:34:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-07 23:34:06,962 INFO L87 Difference]: Start difference. First operand 661 states and 972 transitions. Second operand 15 states. [2019-09-07 23:34:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:07,304 INFO L93 Difference]: Finished difference Result 663 states and 973 transitions. [2019-09-07 23:34:07,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 23:34:07,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2019-09-07 23:34:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:07,316 INFO L225 Difference]: With dead ends: 663 [2019-09-07 23:34:07,317 INFO L226 Difference]: Without dead ends: 661 [2019-09-07 23:34:07,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-07 23:34:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-07 23:34:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-09-07 23:34:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-07 23:34:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 971 transitions. [2019-09-07 23:34:07,340 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 971 transitions. Word has length 106 [2019-09-07 23:34:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:07,341 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 971 transitions. [2019-09-07 23:34:07,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 23:34:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 971 transitions. [2019-09-07 23:34:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 23:34:07,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:07,343 INFO L399 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-09-07 23:34:07,343 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1267384093, now seen corresponding path program 2 times [2019-09-07 23:34:07,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:07,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:07,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:07,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:07,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 23:34:08,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:08,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:08,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 23:34:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:08,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 198 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 23:34:08,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:08,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2019-09-07 23:34:08,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 23:34:08,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 23:34:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-09-07 23:34:08,295 INFO L87 Difference]: Start difference. First operand 661 states and 971 transitions. Second operand 19 states. [2019-09-07 23:34:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:09,385 INFO L93 Difference]: Finished difference Result 702 states and 1010 transitions. [2019-09-07 23:34:09,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 23:34:09,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 113 [2019-09-07 23:34:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:09,389 INFO L225 Difference]: With dead ends: 702 [2019-09-07 23:34:09,389 INFO L226 Difference]: Without dead ends: 700 [2019-09-07 23:34:09,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2019-09-07 23:34:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-09-07 23:34:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 662. [2019-09-07 23:34:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-07 23:34:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 972 transitions. [2019-09-07 23:34:09,409 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 972 transitions. Word has length 113 [2019-09-07 23:34:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:09,409 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 972 transitions. [2019-09-07 23:34:09,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 23:34:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 972 transitions. [2019-09-07 23:34:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 23:34:09,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:09,411 INFO L399 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-09-07 23:34:09,411 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1815351467, now seen corresponding path program 2 times [2019-09-07 23:34:09,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:09,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:09,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 23:34:09,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:09,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:09,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:09,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:09,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:09,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 23:34:09,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 23:34:09,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:09,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-07 23:34:09,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 23:34:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 23:34:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 23:34:09,703 INFO L87 Difference]: Start difference. First operand 662 states and 972 transitions. Second operand 8 states. [2019-09-07 23:34:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:09,961 INFO L93 Difference]: Finished difference Result 1275 states and 1870 transitions. [2019-09-07 23:34:09,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:34:09,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-09-07 23:34:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:09,966 INFO L225 Difference]: With dead ends: 1275 [2019-09-07 23:34:09,966 INFO L226 Difference]: Without dead ends: 799 [2019-09-07 23:34:09,967 INFO L628 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-09-07 23:34:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-09-07 23:34:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 740. [2019-09-07 23:34:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-09-07 23:34:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1091 transitions. [2019-09-07 23:34:09,994 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1091 transitions. Word has length 123 [2019-09-07 23:34:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:09,995 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1091 transitions. [2019-09-07 23:34:09,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 23:34:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1091 transitions. [2019-09-07 23:34:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 23:34:09,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:09,996 INFO L399 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-09-07 23:34:09,997 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2086588819, now seen corresponding path program 2 times [2019-09-07 23:34:09,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:09,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:09,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:10,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:10,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:10,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 23:34:10,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:10,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:10,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 23:34:10,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:10,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 23:34:10,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:10,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-09-07 23:34:10,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 23:34:10,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 23:34:10,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-07 23:34:10,771 INFO L87 Difference]: Start difference. First operand 740 states and 1091 transitions. Second operand 20 states. [2019-09-07 23:34:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:11,246 INFO L93 Difference]: Finished difference Result 763 states and 1123 transitions. [2019-09-07 23:34:11,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 23:34:11,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 123 [2019-09-07 23:34:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:11,251 INFO L225 Difference]: With dead ends: 763 [2019-09-07 23:34:11,251 INFO L226 Difference]: Without dead ends: 759 [2019-09-07 23:34:11,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-07 23:34:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-07 23:34:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-09-07 23:34:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-07 23:34:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1117 transitions. [2019-09-07 23:34:11,271 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1117 transitions. Word has length 123 [2019-09-07 23:34:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:11,271 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1117 transitions. [2019-09-07 23:34:11,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 23:34:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1117 transitions. [2019-09-07 23:34:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-07 23:34:11,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:11,273 INFO L399 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-09-07 23:34:11,273 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash -635604026, now seen corresponding path program 2 times [2019-09-07 23:34:11,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:11,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:11,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 23:34:11,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:11,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 23:34:11,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:11,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:11,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 23:34:11,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 23:34:11,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:11,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 23:34:11,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 23:34:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 23:34:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 23:34:11,977 INFO L87 Difference]: Start difference. First operand 759 states and 1117 transitions. Second operand 10 states. [2019-09-07 23:34:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:12,189 INFO L93 Difference]: Finished difference Result 788 states and 1154 transitions. [2019-09-07 23:34:12,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:12,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-09-07 23:34:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:12,193 INFO L225 Difference]: With dead ends: 788 [2019-09-07 23:34:12,193 INFO L226 Difference]: Without dead ends: 784 [2019-09-07 23:34:12,195 INFO L628 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-09-07 23:34:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-09-07 23:34:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 778. [2019-09-07 23:34:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-09-07 23:34:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2019-09-07 23:34:12,216 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 133 [2019-09-07 23:34:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:12,216 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2019-09-07 23:34:12,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 23:34:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2019-09-07 23:34:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 23:34:12,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:12,218 INFO L399 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-09-07 23:34:12,218 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:12,219 INFO L82 PathProgramCache]: Analyzing trace with hash -287211762, now seen corresponding path program 2 times [2019-09-07 23:34:12,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:12,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:12,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:12,930 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-09-07 23:34:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:12,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:12,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:12,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 23:34:13,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:13,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:13,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 23:34:13,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 23:34:13,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:13,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-09-07 23:34:13,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 23:34:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 23:34:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-07 23:34:13,299 INFO L87 Difference]: Start difference. First operand 778 states and 1143 transitions. Second operand 22 states. [2019-09-07 23:34:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:14,424 INFO L93 Difference]: Finished difference Result 823 states and 1186 transitions. [2019-09-07 23:34:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 23:34:14,430 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2019-09-07 23:34:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:14,433 INFO L225 Difference]: With dead ends: 823 [2019-09-07 23:34:14,434 INFO L226 Difference]: Without dead ends: 821 [2019-09-07 23:34:14,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 23:34:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-07 23:34:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 779. [2019-09-07 23:34:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-09-07 23:34:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1144 transitions. [2019-09-07 23:34:14,455 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1144 transitions. Word has length 136 [2019-09-07 23:34:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:14,456 INFO L475 AbstractCegarLoop]: Abstraction has 779 states and 1144 transitions. [2019-09-07 23:34:14,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 23:34:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2019-09-07 23:34:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 23:34:14,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:14,458 INFO L399 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-09-07 23:34:14,458 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2035567456, now seen corresponding path program 2 times [2019-09-07 23:34:14,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:14,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:14,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:14,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 85 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 23:34:14,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:14,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:14,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 23:34:14,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:14,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 23:34:14,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 23:34:14,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:34:14,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-07 23:34:14,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 23:34:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 23:34:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 23:34:14,686 INFO L87 Difference]: Start difference. First operand 779 states and 1144 transitions. Second operand 10 states. [2019-09-07 23:34:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:15,108 INFO L93 Difference]: Finished difference Result 1568 states and 2302 transitions. [2019-09-07 23:34:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:15,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2019-09-07 23:34:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:15,116 INFO L225 Difference]: With dead ends: 1568 [2019-09-07 23:34:15,117 INFO L226 Difference]: Without dead ends: 1009 [2019-09-07 23:34:15,119 INFO L628 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-09-07 23:34:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-09-07 23:34:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 935. [2019-09-07 23:34:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-09-07 23:34:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1377 transitions. [2019-09-07 23:34:15,159 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1377 transitions. Word has length 148 [2019-09-07 23:34:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:15,160 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1377 transitions. [2019-09-07 23:34:15,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 23:34:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1377 transitions. [2019-09-07 23:34:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 23:34:15,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:15,164 INFO L399 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-09-07 23:34:15,165 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2001234402, now seen corresponding path program 2 times [2019-09-07 23:34:15,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:15,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:15,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 23:34:15,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:15,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:15,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:15,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:15,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:15,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 23:34:15,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 23:34:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:15,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-07 23:34:15,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:34:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:34:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:34:15,809 INFO L87 Difference]: Start difference. First operand 935 states and 1377 transitions. Second operand 9 states. [2019-09-07 23:34:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:16,172 INFO L93 Difference]: Finished difference Result 982 states and 1443 transitions. [2019-09-07 23:34:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 23:34:16,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2019-09-07 23:34:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:16,179 INFO L225 Difference]: With dead ends: 982 [2019-09-07 23:34:16,179 INFO L226 Difference]: Without dead ends: 976 [2019-09-07 23:34:16,182 INFO L628 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-09-07 23:34:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-07 23:34:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 973. [2019-09-07 23:34:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-07 23:34:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1431 transitions. [2019-09-07 23:34:16,221 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1431 transitions. Word has length 148 [2019-09-07 23:34:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:16,222 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1431 transitions. [2019-09-07 23:34:16,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:34:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1431 transitions. [2019-09-07 23:34:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 23:34:16,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:16,225 INFO L399 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-09-07 23:34:16,225 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:16,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1445028928, now seen corresponding path program 2 times [2019-09-07 23:34:16,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:16,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:16,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:16,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:16,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:16,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:16,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:16,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:16,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 23:34:16,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:17,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 23:34:17,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:17,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-07 23:34:17,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 23:34:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 23:34:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-09-07 23:34:17,159 INFO L87 Difference]: Start difference. First operand 973 states and 1431 transitions. Second operand 24 states. [2019-09-07 23:34:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:18,190 INFO L93 Difference]: Finished difference Result 982 states and 1438 transitions. [2019-09-07 23:34:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 23:34:18,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 152 [2019-09-07 23:34:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:18,195 INFO L225 Difference]: With dead ends: 982 [2019-09-07 23:34:18,196 INFO L226 Difference]: Without dead ends: 980 [2019-09-07 23:34:18,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-09-07 23:34:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-09-07 23:34:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 973. [2019-09-07 23:34:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-07 23:34:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1430 transitions. [2019-09-07 23:34:18,224 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1430 transitions. Word has length 152 [2019-09-07 23:34:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:18,224 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1430 transitions. [2019-09-07 23:34:18,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 23:34:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1430 transitions. [2019-09-07 23:34:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 23:34:18,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:18,227 INFO L399 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-09-07 23:34:18,227 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1661877298, now seen corresponding path program 3 times [2019-09-07 23:34:18,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:18,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:18,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:18,785 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 15 [2019-09-07 23:34:18,957 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 11 [2019-09-07 23:34:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 44 proven. 457 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 23:34:19,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:19,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:19,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:19,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 23:34:19,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:19,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 23:34:19,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:19,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 23:34:19,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-09-07 23:34:19,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:19,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 21 [2019-09-07 23:34:19,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 23:34:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 23:34:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-07 23:34:19,958 INFO L87 Difference]: Start difference. First operand 973 states and 1430 transitions. Second operand 21 states. [2019-09-07 23:34:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:23,305 INFO L93 Difference]: Finished difference Result 1562 states and 2251 transitions. [2019-09-07 23:34:23,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 23:34:23,305 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2019-09-07 23:34:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:23,310 INFO L225 Difference]: With dead ends: 1562 [2019-09-07 23:34:23,310 INFO L226 Difference]: Without dead ends: 845 [2019-09-07 23:34:23,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=441, Invalid=5109, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 23:34:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-07 23:34:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 738. [2019-09-07 23:34:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-07 23:34:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1036 transitions. [2019-09-07 23:34:23,336 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1036 transitions. Word has length 159 [2019-09-07 23:34:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:23,337 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1036 transitions. [2019-09-07 23:34:23,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 23:34:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1036 transitions. [2019-09-07 23:34:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 23:34:23,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:23,339 INFO L399 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-09-07 23:34:23,339 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash 305812452, now seen corresponding path program 3 times [2019-09-07 23:34:23,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:23,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:23,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:23,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 23:34:23,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:23,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:23,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 23:34:23,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:23,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 23:34:23,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:34:23,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:23,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-07 23:34:23,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 23:34:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 23:34:23,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 23:34:23,756 INFO L87 Difference]: Start difference. First operand 738 states and 1036 transitions. Second operand 10 states. [2019-09-07 23:34:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:23,911 INFO L93 Difference]: Finished difference Result 886 states and 1229 transitions. [2019-09-07 23:34:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:23,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 169 [2019-09-07 23:34:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:23,916 INFO L225 Difference]: With dead ends: 886 [2019-09-07 23:34:23,916 INFO L226 Difference]: Without dead ends: 802 [2019-09-07 23:34:23,917 INFO L628 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-09-07 23:34:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-07 23:34:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 722. [2019-09-07 23:34:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-09-07 23:34:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1013 transitions. [2019-09-07 23:34:23,939 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1013 transitions. Word has length 169 [2019-09-07 23:34:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:23,939 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 1013 transitions. [2019-09-07 23:34:23,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 23:34:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1013 transitions. [2019-09-07 23:34:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-07 23:34:23,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:23,942 INFO L399 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-09-07 23:34:23,942 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:23,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1852980602, now seen corresponding path program 1 times [2019-09-07 23:34:23,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:23,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 584 proven. 77 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 23:34:24,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:24,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:24,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:24,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 23:34:24,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 23:34:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:34:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 11 [2019-09-07 23:34:24,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 23:34:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 23:34:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:34:24,473 INFO L87 Difference]: Start difference. First operand 722 states and 1013 transitions. Second operand 11 states. [2019-09-07 23:34:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:24,640 INFO L93 Difference]: Finished difference Result 861 states and 1209 transitions. [2019-09-07 23:34:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:24,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2019-09-07 23:34:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:24,646 INFO L225 Difference]: With dead ends: 861 [2019-09-07 23:34:24,646 INFO L226 Difference]: Without dead ends: 857 [2019-09-07 23:34:24,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:34:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-07 23:34:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 855. [2019-09-07 23:34:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-07 23:34:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1202 transitions. [2019-09-07 23:34:24,670 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1202 transitions. Word has length 181 [2019-09-07 23:34:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:24,671 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1202 transitions. [2019-09-07 23:34:24,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 23:34:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1202 transitions. [2019-09-07 23:34:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 23:34:24,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:24,673 INFO L399 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-09-07 23:34:24,673 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1596376353, now seen corresponding path program 3 times [2019-09-07 23:34:24,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:24,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:24,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:25,482 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 21 [2019-09-07 23:34:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:25,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:25,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:25,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 23:34:25,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-07 23:34:25,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:25,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 23:34:25,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:25,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 23:34:25,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:25,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 23:34:26,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:26,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2019-09-07 23:34:26,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 23:34:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 23:34:26,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2019-09-07 23:34:26,211 INFO L87 Difference]: Start difference. First operand 855 states and 1202 transitions. Second operand 28 states. [2019-09-07 23:34:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:27,102 INFO L93 Difference]: Finished difference Result 863 states and 1208 transitions. [2019-09-07 23:34:27,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 23:34:27,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 182 [2019-09-07 23:34:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:27,111 INFO L225 Difference]: With dead ends: 863 [2019-09-07 23:34:27,111 INFO L226 Difference]: Without dead ends: 861 [2019-09-07 23:34:27,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2019-09-07 23:34:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-07 23:34:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 855. [2019-09-07 23:34:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-07 23:34:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1201 transitions. [2019-09-07 23:34:27,136 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1201 transitions. Word has length 182 [2019-09-07 23:34:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:27,136 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1201 transitions. [2019-09-07 23:34:27,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 23:34:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1201 transitions. [2019-09-07 23:34:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-07 23:34:27,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:27,139 INFO L399 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-09-07 23:34:27,139 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash -730696556, now seen corresponding path program 1 times [2019-09-07 23:34:27,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:27,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:27,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:27,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 23:34:27,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:27,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:27,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:27,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 23:34:27,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 23:34:27,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:27,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-07 23:34:27,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 23:34:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 23:34:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:34:27,516 INFO L87 Difference]: Start difference. First operand 855 states and 1201 transitions. Second operand 11 states. [2019-09-07 23:34:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:27,712 INFO L93 Difference]: Finished difference Result 1437 states and 2015 transitions. [2019-09-07 23:34:27,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 23:34:27,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2019-09-07 23:34:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:27,718 INFO L225 Difference]: With dead ends: 1437 [2019-09-07 23:34:27,718 INFO L226 Difference]: Without dead ends: 962 [2019-09-07 23:34:27,719 INFO L628 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-09-07 23:34:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-09-07 23:34:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 933. [2019-09-07 23:34:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-07 23:34:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1313 transitions. [2019-09-07 23:34:27,747 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1313 transitions. Word has length 197 [2019-09-07 23:34:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:27,748 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1313 transitions. [2019-09-07 23:34:27,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 23:34:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1313 transitions. [2019-09-07 23:34:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-07 23:34:27,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:27,751 INFO L399 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-09-07 23:34:27,751 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2108593553, now seen corresponding path program 3 times [2019-09-07 23:34:27,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:27,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:28,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:28,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:28,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:28,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-07 23:34:28,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:28,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 23:34:28,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:28,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 23:34:28,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:28,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 23:34:29,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2019-09-07 23:34:29,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 23:34:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 23:34:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2019-09-07 23:34:29,250 INFO L87 Difference]: Start difference. First operand 933 states and 1313 transitions. Second operand 29 states. [2019-09-07 23:34:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:30,298 INFO L93 Difference]: Finished difference Result 939 states and 1318 transitions. [2019-09-07 23:34:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 23:34:30,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 198 [2019-09-07 23:34:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:30,306 INFO L225 Difference]: With dead ends: 939 [2019-09-07 23:34:30,306 INFO L226 Difference]: Without dead ends: 937 [2019-09-07 23:34:30,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 23:34:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-07 23:34:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 933. [2019-09-07 23:34:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-07 23:34:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1311 transitions. [2019-09-07 23:34:30,334 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1311 transitions. Word has length 198 [2019-09-07 23:34:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:30,334 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1311 transitions. [2019-09-07 23:34:30,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 23:34:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1311 transitions. [2019-09-07 23:34:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 23:34:30,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:30,338 INFO L399 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-09-07 23:34:30,338 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -699066829, now seen corresponding path program 4 times [2019-09-07 23:34:30,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:30,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:30,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 23:34:30,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:30,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:30,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 23:34:30,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 23:34:30,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:30,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 23:34:30,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 23:34:30,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:30,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-07 23:34:30,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 23:34:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 23:34:30,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 23:34:30,807 INFO L87 Difference]: Start difference. First operand 933 states and 1311 transitions. Second operand 12 states. [2019-09-07 23:34:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:31,007 INFO L93 Difference]: Finished difference Result 1127 states and 1564 transitions. [2019-09-07 23:34:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 23:34:31,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 215 [2019-09-07 23:34:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:31,023 INFO L225 Difference]: With dead ends: 1127 [2019-09-07 23:34:31,024 INFO L226 Difference]: Without dead ends: 1043 [2019-09-07 23:34:31,025 INFO L628 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-09-07 23:34:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-09-07 23:34:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1011. [2019-09-07 23:34:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-09-07 23:34:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1418 transitions. [2019-09-07 23:34:31,086 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1418 transitions. Word has length 215 [2019-09-07 23:34:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:31,086 INFO L475 AbstractCegarLoop]: Abstraction has 1011 states and 1418 transitions. [2019-09-07 23:34:31,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 23:34:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1418 transitions. [2019-09-07 23:34:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-07 23:34:31,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:31,094 INFO L399 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-09-07 23:34:31,094 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash 408795747, now seen corresponding path program 2 times [2019-09-07 23:34:31,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:31,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:31,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:31,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 23:34:31,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:31,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:31,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 23:34:31,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 23:34:31,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:31,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 23:34:31,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:34:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-07 23:34:32,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 23:34:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 23:34:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 23:34:32,056 INFO L87 Difference]: Start difference. First operand 1011 states and 1418 transitions. Second operand 13 states. [2019-09-07 23:34:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:32,277 INFO L93 Difference]: Finished difference Result 1677 states and 2346 transitions. [2019-09-07 23:34:32,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 23:34:32,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 243 [2019-09-07 23:34:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:32,282 INFO L225 Difference]: With dead ends: 1677 [2019-09-07 23:34:32,283 INFO L226 Difference]: Without dead ends: 1124 [2019-09-07 23:34:32,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 23:34:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-09-07 23:34:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1089. [2019-09-07 23:34:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-09-07 23:34:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1529 transitions. [2019-09-07 23:34:32,324 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1529 transitions. Word has length 243 [2019-09-07 23:34:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:32,324 INFO L475 AbstractCegarLoop]: Abstraction has 1089 states and 1529 transitions. [2019-09-07 23:34:32,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 23:34:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1529 transitions. [2019-09-07 23:34:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-07 23:34:32,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:32,329 INFO L399 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-09-07 23:34:32,329 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1318987330, now seen corresponding path program 5 times [2019-09-07 23:34:32,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:32,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:32,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 23:34:32,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:32,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:32,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 23:34:33,061 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 23:34:33,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:33,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 23:34:33,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 23:34:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-07 23:34:33,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 23:34:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 23:34:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 23:34:33,173 INFO L87 Difference]: Start difference. First operand 1089 states and 1529 transitions. Second operand 14 states. [2019-09-07 23:34:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:33,392 INFO L93 Difference]: Finished difference Result 1289 states and 1786 transitions. [2019-09-07 23:34:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 23:34:33,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-09-07 23:34:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:33,396 INFO L225 Difference]: With dead ends: 1289 [2019-09-07 23:34:33,396 INFO L226 Difference]: Without dead ends: 1205 [2019-09-07 23:34:33,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 23:34:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-09-07 23:34:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1167. [2019-09-07 23:34:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-09-07 23:34:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1636 transitions. [2019-09-07 23:34:33,431 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1636 transitions. Word has length 261 [2019-09-07 23:34:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:33,431 INFO L475 AbstractCegarLoop]: Abstraction has 1167 states and 1636 transitions. [2019-09-07 23:34:33,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 23:34:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1636 transitions. [2019-09-07 23:34:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-07 23:34:33,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:33,434 INFO L399 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-09-07 23:34:33,434 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 589114866, now seen corresponding path program 3 times [2019-09-07 23:34:33,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:33,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:33,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:33,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-07 23:34:33,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:33,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:33,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 23:34:33,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 23:34:33,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:33,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 23:34:33,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:33,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2019-09-07 23:34:34,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:34,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-09-07 23:34:34,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 23:34:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 23:34:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-09-07 23:34:34,174 INFO L87 Difference]: Start difference. First operand 1167 states and 1636 transitions. Second operand 19 states. [2019-09-07 23:34:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:35,473 INFO L93 Difference]: Finished difference Result 1316 states and 1834 transitions. [2019-09-07 23:34:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 23:34:35,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 289 [2019-09-07 23:34:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:35,476 INFO L225 Difference]: With dead ends: 1316 [2019-09-07 23:34:35,476 INFO L226 Difference]: Without dead ends: 685 [2019-09-07 23:34:35,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 23:34:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-07 23:34:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 662. [2019-09-07 23:34:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-07 23:34:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 909 transitions. [2019-09-07 23:34:35,496 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 909 transitions. Word has length 289 [2019-09-07 23:34:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:35,497 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 909 transitions. [2019-09-07 23:34:35,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 23:34:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 909 transitions. [2019-09-07 23:34:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-07 23:34:35,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:35,500 INFO L399 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-09-07 23:34:35,501 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 927920032, now seen corresponding path program 6 times [2019-09-07 23:34:35,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:35,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:35,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:35,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:35,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 23:34:35,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:35,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:36,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:36,404 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-07 23:34:36,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 23:34:36,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 23:34:36,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:36,543 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 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:34:36,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:36,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-07 23:34:36,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 23:34:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 23:34:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 23:34:36,555 INFO L87 Difference]: Start difference. First operand 662 states and 909 transitions. Second operand 18 states. [2019-09-07 23:34:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:36,764 INFO L93 Difference]: Finished difference Result 867 states and 1192 transitions. [2019-09-07 23:34:36,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 23:34:36,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 353 [2019-09-07 23:34:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:36,766 INFO L225 Difference]: With dead ends: 867 [2019-09-07 23:34:36,766 INFO L226 Difference]: Without dead ends: 783 [2019-09-07 23:34:36,767 INFO L628 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-09-07 23:34:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-07 23:34:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 740. [2019-09-07 23:34:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-09-07 23:34:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1016 transitions. [2019-09-07 23:34:36,788 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1016 transitions. Word has length 353 [2019-09-07 23:34:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:36,789 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1016 transitions. [2019-09-07 23:34:36,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 23:34:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1016 transitions. [2019-09-07 23:34:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 23:34:36,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:36,793 INFO L399 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-09-07 23:34:36,793 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1934002415, now seen corresponding path program 7 times [2019-09-07 23:34:36,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:36,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:36,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 23:34:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 23:34:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 23:34:38,263 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-07 23:34:38,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 11:34:38 BoogieIcfgContainer [2019-09-07 23:34:38,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 23:34:38,447 INFO L168 Benchmark]: Toolchain (without parser) took 46319.99 ms. Allocated memory was 133.2 MB in the beginning and 754.5 MB in the end (delta: 621.3 MB). Free memory was 88.0 MB in the beginning and 595.7 MB in the end (delta: -507.7 MB). Peak memory consumption was 645.4 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:38,448 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 23:34:38,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.70 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 87.6 MB in the beginning and 172.6 MB in the end (delta: -85.0 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:38,452 INFO L168 Benchmark]: Boogie Preprocessor took 73.01 ms. Allocated memory is still 201.9 MB. Free memory was 172.6 MB in the beginning and 169.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:38,453 INFO L168 Benchmark]: RCFGBuilder took 913.38 ms. Allocated memory is still 201.9 MB. Free memory was 169.1 MB in the beginning and 118.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:38,454 INFO L168 Benchmark]: TraceAbstraction took 44719.06 ms. Allocated memory was 201.9 MB in the beginning and 754.5 MB in the end (delta: 552.6 MB). Free memory was 118.6 MB in the beginning and 595.7 MB in the end (delta: -477.1 MB). Peak memory consumption was 607.3 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:38,459 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.40 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 608.70 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 87.6 MB in the beginning and 172.6 MB in the end (delta: -85.0 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.01 ms. Allocated memory is still 201.9 MB. Free memory was 172.6 MB in the beginning and 169.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 913.38 ms. Allocated memory is still 201.9 MB. Free memory was 169.1 MB in the beginning and 118.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44719.06 ms. Allocated memory was 201.9 MB in the beginning and 754.5 MB in the end (delta: 552.6 MB). Free memory was 118.6 MB in the beginning and 595.7 MB in the end (delta: -477.1 MB). Peak memory consumption was 607.3 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=1, P9=8, 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=1, P9=8, 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=1, P9=8, 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=8, P9=8, 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=8, P9=8, 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=8, P9=8, 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=8, P2=8, P3=0, P4=8, P5=0, P6=0, P7=0, P8=8, P9=8, 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=8, P3=1, P4=8, P5=0, P6=0, P7=0, P8=8, 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=8, P3=1, P4=8, P5=0, P6=0, P7=0, P8=8, 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=8, P3=1, P4=8, P5=0, P6=0, P7=0, P8=8, 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=8, P3=1, P4=8, P5=0, P6=0, P7=0, P8=8, 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=8, P3=1, P4=8, P5=0, P6=0, P7=0, P8=8, 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=8, P3=1, P4=8, P5=0, P6=0, P7=0, P8=8, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-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=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=-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=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=-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=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=-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=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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=-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=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=-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=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=-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=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=-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=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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=-6, 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=-6, 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=-6, 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=-6, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=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=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=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=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=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=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=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=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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=-10, 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=-10, 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=-10, 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=-10, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=6, 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=6, 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=6, 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=6, 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, 44.6s OverallTime, 45 OverallIterations, 35 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9624 SDtfs, 18687 SDslu, 60578 SDs, 0 SdLazy, 10890 SolverSat, 1320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5287 GetRequests, 4719 SyntacticMatches, 42 SemanticMatches, 526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2859 ImplicationChecksByTransitivity, 13.4s 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: 1.0s AutomataMinimizationTime, 44 MinimizatonAttempts, 972 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 9881 NumberOfCodeBlocks, 9431 NumberOfCodeBlocksAsserted, 167 NumberOfCheckSat, 9402 ConstructedInterpolants, 126 QuantifiedInterpolants, 7277538 SizeOfPredicates, 75 NumberOfNonLiveVariables, 25255 ConjunctsInSsa, 652 ConjunctsInUnsatCore, 80 InterpolantComputations, 11 PerfectInterpolantSequences, 10068/33980 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...