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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 23:51:25,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 23:51:25,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 23:51:25,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 23:51:25,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 23:51:25,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 23:51:25,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 23:51:25,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 23:51:25,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 23:51:25,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 23:51:25,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 23:51:25,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 23:51:25,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 23:51:25,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 23:51:25,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 23:51:25,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 23:51:25,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 23:51:25,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 23:51:25,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 23:51:25,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 23:51:25,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 23:51:25,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 23:51:25,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 23:51:25,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 23:51:25,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 23:51:25,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 23:51:25,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 23:51:25,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 23:51:25,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 23:51:25,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 23:51:25,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 23:51:25,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 23:51:25,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 23:51:25,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 23:51:25,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 23:51:25,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 23:51:25,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 23:51:25,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 23:51:25,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 23:51:25,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 23:51:25,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 23:51:25,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 23:51:25,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 23:51:25,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 23:51:25,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 23:51:25,081 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 23:51:25,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 23:51:25,082 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 23:51:25,082 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 23:51:25,082 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 23:51:25,082 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 23:51:25,083 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 23:51:25,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 23:51:25,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 23:51:25,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 23:51:25,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 23:51:25,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 23:51:25,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 23:51:25,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 23:51:25,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 23:51:25,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 23:51:25,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 23:51:25,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 23:51:25,086 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 23:51:25,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 23:51:25,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 23:51:25,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 23:51:25,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 23:51:25,087 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 23:51:25,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 23:51:25,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 23:51:25,087 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 23:51:25,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 23:51:25,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 23:51:25,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 23:51:25,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 23:51:25,144 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 23:51:25,145 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-09 23:51:25,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3d58999/dc288ecaee0c4b05bbcf5d9b73ccd169/FLAGaddfd9a35 [2019-09-09 23:51:25,780 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 23:51:25,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-09-09 23:51:25,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3d58999/dc288ecaee0c4b05bbcf5d9b73ccd169/FLAGaddfd9a35 [2019-09-09 23:51:26,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3d58999/dc288ecaee0c4b05bbcf5d9b73ccd169 [2019-09-09 23:51:26,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 23:51:26,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 23:51:26,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 23:51:26,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 23:51:26,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 23:51:26,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe1c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26, skipping insertion in model container [2019-09-09 23:51:26,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 23:51:26,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 23:51:26,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 23:51:26,600 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 23:51:26,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 23:51:26,703 INFO L192 MainTranslator]: Completed translation [2019-09-09 23:51:26,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26 WrapperNode [2019-09-09 23:51:26,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 23:51:26,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 23:51:26,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 23:51:26,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 23:51:26,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (1/1) ... [2019-09-09 23:51:26,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 23:51:26,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 23:51:26,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 23:51:26,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 23:51:26,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (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-09 23:51:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 23:51:26,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 23:51:26,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 23:51:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 23:51:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 23:51:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 23:51:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 23:51:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 23:51:27,721 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 23:51:27,722 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 23:51:27,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 11:51:27 BoogieIcfgContainer [2019-09-09 23:51:27,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 23:51:27,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 23:51:27,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 23:51:27,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 23:51:27,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 11:51:26" (1/3) ... [2019-09-09 23:51:27,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bd5112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 11:51:27, skipping insertion in model container [2019-09-09 23:51:27,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:51:26" (2/3) ... [2019-09-09 23:51:27,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bd5112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 11:51:27, skipping insertion in model container [2019-09-09 23:51:27,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 11:51:27" (3/3) ... [2019-09-09 23:51:27,732 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-09-09 23:51:27,742 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 23:51:27,751 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 23:51:27,765 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 23:51:27,793 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 23:51:27,793 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 23:51:27,793 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 23:51:27,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 23:51:27,794 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 23:51:27,794 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 23:51:27,794 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 23:51:27,795 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 23:51:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-09-09 23:51:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-09 23:51:27,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:27,825 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:51:27,827 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 218362772, now seen corresponding path program 1 times [2019-09-09 23:51:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:27,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:28,033 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-09 23:51:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:28,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:28,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:28,061 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-09-09 23:51:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:28,460 INFO L93 Difference]: Finished difference Result 222 states and 406 transitions. [2019-09-09 23:51:28,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:28,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-09 23:51:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:28,479 INFO L225 Difference]: With dead ends: 222 [2019-09-09 23:51:28,479 INFO L226 Difference]: Without dead ends: 206 [2019-09-09 23:51:28,481 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-09 23:51:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-09 23:51:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-09-09 23:51:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-09 23:51:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-09-09 23:51:28,560 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 13 [2019-09-09 23:51:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:28,561 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-09-09 23:51:28,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-09-09 23:51:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-09 23:51:28,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:28,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:51:28,564 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 486806227, now seen corresponding path program 1 times [2019-09-09 23:51:28,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:28,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:28,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:28,650 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-09 23:51:28,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:28,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:28,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:28,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:28,655 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-09-09 23:51:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:28,702 INFO L93 Difference]: Finished difference Result 189 states and 322 transitions. [2019-09-09 23:51:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:28,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-09 23:51:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:28,707 INFO L225 Difference]: With dead ends: 189 [2019-09-09 23:51:28,708 INFO L226 Difference]: Without dead ends: 189 [2019-09-09 23:51:28,709 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-09 23:51:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-09 23:51:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-09 23:51:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-09 23:51:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-09-09 23:51:28,733 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 14 [2019-09-09 23:51:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:28,738 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-09-09 23:51:28,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-09-09 23:51:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 23:51:28,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:28,740 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:51:28,740 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1338497339, now seen corresponding path program 1 times [2019-09-09 23:51:28,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:28,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:28,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:29,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 23:51:29,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:29,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 23:51:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 23:51:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 23:51:29,136 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 5 states. [2019-09-09 23:51:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:29,587 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2019-09-09 23:51:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 23:51:29,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-09 23:51:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:29,590 INFO L225 Difference]: With dead ends: 290 [2019-09-09 23:51:29,591 INFO L226 Difference]: Without dead ends: 276 [2019-09-09 23:51:29,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-09 23:51:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-09 23:51:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-09-09 23:51:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-09 23:51:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-09-09 23:51:29,608 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 20 [2019-09-09 23:51:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:29,609 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-09-09 23:51:29,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 23:51:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-09-09 23:51:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 23:51:29,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:29,612 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:51:29,613 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:29,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:29,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1294991850, now seen corresponding path program 1 times [2019-09-09 23:51:29,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:29,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:29,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:29,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:29,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:29,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:29,689 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-09-09 23:51:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:29,739 INFO L93 Difference]: Finished difference Result 216 states and 356 transitions. [2019-09-09 23:51:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:29,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 23:51:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:29,744 INFO L225 Difference]: With dead ends: 216 [2019-09-09 23:51:29,744 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 23:51:29,744 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-09 23:51:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 23:51:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-09-09 23:51:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-09 23:51:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-09-09 23:51:29,764 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 21 [2019-09-09 23:51:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:29,764 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-09-09 23:51:29,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-09-09 23:51:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 23:51:29,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:29,772 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:51:29,772 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash -438692304, now seen corresponding path program 1 times [2019-09-09 23:51:29,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:29,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:29,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:29,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:29,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:29,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-09 23:51:29,881 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [53], [55], [525], [531], [532], [533], [534] [2019-09-09 23:51:29,926 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:29,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:30,074 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:30,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:30,982 INFO L272 AbstractInterpreter]: Visited 21 different actions 45 times. Merged at 12 different actions 18 times. Never widened. Performed 238 root evaluator evaluations with a maximum evaluation depth of 15. Performed 238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2019-09-09 23:51:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:30,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:30,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:30,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:51:31,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:31,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:51:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:31,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 23:51:31,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-09 23:51:31,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-09 23:51:31,175 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 23:51:31,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-09-09 23:51:31,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:31,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:31,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 23:51:31,178 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 3 states. [2019-09-09 23:51:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:31,211 INFO L93 Difference]: Finished difference Result 182 states and 292 transitions. [2019-09-09 23:51:31,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:31,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 23:51:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:31,213 INFO L225 Difference]: With dead ends: 182 [2019-09-09 23:51:31,213 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 23:51:31,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 23:51:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 23:51:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-09-09 23:51:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 23:51:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2019-09-09 23:51:31,221 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 27 [2019-09-09 23:51:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:31,221 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2019-09-09 23:51:31,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2019-09-09 23:51:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 23:51:31,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:31,223 INFO L399 BasicCegarLoop]: trace histogram [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-09 23:51:31,223 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1434478097, now seen corresponding path program 1 times [2019-09-09 23:51:31,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:31,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:31,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:31,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:31,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:31,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2019-09-09 23:51:31,294 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [238], [241], [244], [525], [531], [532], [533], [534] [2019-09-09 23:51:31,296 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:31,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:31,312 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:32,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:32,025 INFO L272 AbstractInterpreter]: Visited 26 different actions 74 times. Merged at 17 different actions 38 times. Never widened. Performed 337 root evaluator evaluations with a maximum evaluation depth of 15. Performed 337 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2019-09-09 23:51:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:32,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:32,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:32,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 23:51:32,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:32,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:51:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:32,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 23:51:32,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:32,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:32,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:51:32,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 23:51:32,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:51:32,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 23:51:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 23:51:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-09 23:51:32,147 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 6 states. [2019-09-09 23:51:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:32,588 INFO L93 Difference]: Finished difference Result 540 states and 831 transitions. [2019-09-09 23:51:32,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 23:51:32,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-09-09 23:51:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:32,593 INFO L225 Difference]: With dead ends: 540 [2019-09-09 23:51:32,593 INFO L226 Difference]: Without dead ends: 507 [2019-09-09 23:51:32,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:51:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-09 23:51:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 438. [2019-09-09 23:51:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-09-09 23:51:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 730 transitions. [2019-09-09 23:51:32,614 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 730 transitions. Word has length 29 [2019-09-09 23:51:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:32,614 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 730 transitions. [2019-09-09 23:51:32,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 23:51:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 730 transitions. [2019-09-09 23:51:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 23:51:32,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:32,618 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 23:51:32,618 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1137564592, now seen corresponding path program 1 times [2019-09-09 23:51:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:32,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:32,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:32,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:32,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:32,803 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-09-09 23:51:32,803 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [259], [525], [531], [532], [533], [534] [2019-09-09 23:51:32,810 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:32,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:32,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:33,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:33,332 INFO L272 AbstractInterpreter]: Visited 26 different actions 53 times. Merged at 16 different actions 22 times. Never widened. Performed 258 root evaluator evaluations with a maximum evaluation depth of 15. Performed 258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 4 fixpoints after 3 different actions. Largest state had 40 variables. [2019-09-09 23:51:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:33,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:33,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:33,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:51:33,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:33,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:51:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:33,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-09 23:51:33,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:33,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:33,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:51:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-09-09 23:51:33,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:51:33,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 23:51:33,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 23:51:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-09 23:51:33,539 INFO L87 Difference]: Start difference. First operand 438 states and 730 transitions. Second operand 6 states. [2019-09-09 23:51:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:33,724 INFO L93 Difference]: Finished difference Result 493 states and 812 transitions. [2019-09-09 23:51:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 23:51:33,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-09 23:51:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:33,729 INFO L225 Difference]: With dead ends: 493 [2019-09-09 23:51:33,729 INFO L226 Difference]: Without dead ends: 490 [2019-09-09 23:51:33,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-09 23:51:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-09 23:51:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-09-09 23:51:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-09 23:51:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2019-09-09 23:51:33,741 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 30 [2019-09-09 23:51:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:33,744 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2019-09-09 23:51:33,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 23:51:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2019-09-09 23:51:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 23:51:33,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:33,753 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 23:51:33,754 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -49035728, now seen corresponding path program 1 times [2019-09-09 23:51:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:33,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:33,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-09 23:51:33,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:33,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:33,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:33,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:33,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:33,796 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand 3 states. [2019-09-09 23:51:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:33,826 INFO L93 Difference]: Finished difference Result 495 states and 795 transitions. [2019-09-09 23:51:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:33,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 23:51:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:33,830 INFO L225 Difference]: With dead ends: 495 [2019-09-09 23:51:33,830 INFO L226 Difference]: Without dead ends: 495 [2019-09-09 23:51:33,831 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-09 23:51:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-09 23:51:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-09-09 23:51:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-09 23:51:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 794 transitions. [2019-09-09 23:51:33,841 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 794 transitions. Word has length 31 [2019-09-09 23:51:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:33,842 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 794 transitions. [2019-09-09 23:51:33,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 794 transitions. [2019-09-09 23:51:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-09 23:51:33,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:33,843 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 23:51:33,843 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash -382323394, now seen corresponding path program 1 times [2019-09-09 23:51:33,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:33,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:33,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 23:51:33,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:33,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:33,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:33,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:33,882 INFO L87 Difference]: Start difference. First operand 493 states and 794 transitions. Second operand 3 states. [2019-09-09 23:51:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:33,920 INFO L93 Difference]: Finished difference Result 495 states and 789 transitions. [2019-09-09 23:51:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:33,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-09 23:51:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:33,924 INFO L225 Difference]: With dead ends: 495 [2019-09-09 23:51:33,924 INFO L226 Difference]: Without dead ends: 495 [2019-09-09 23:51:33,925 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-09 23:51:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-09 23:51:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-09-09 23:51:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-09 23:51:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 788 transitions. [2019-09-09 23:51:33,936 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 788 transitions. Word has length 39 [2019-09-09 23:51:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:33,936 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 788 transitions. [2019-09-09 23:51:33,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 788 transitions. [2019-09-09 23:51:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 23:51:33,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:33,937 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 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-09 23:51:33,938 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash -510837400, now seen corresponding path program 1 times [2019-09-09 23:51:33,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:33,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:33,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:33,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:33,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:51:34,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:34,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:34,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2019-09-09 23:51:34,259 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [334], [337], [340], [525], [531], [532], [533], [534] [2019-09-09 23:51:34,262 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:34,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:34,272 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:36,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:36,978 INFO L272 AbstractInterpreter]: Visited 31 different actions 174 times. Merged at 23 different actions 123 times. Widened at 2 different actions 5 times. Performed 885 root evaluator evaluations with a maximum evaluation depth of 15. Performed 885 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 19 fixpoints after 9 different actions. Largest state had 41 variables. [2019-09-09 23:51:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:36,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:36,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:36,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:51:36,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:36,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:51:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:37,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-09 23:51:37,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:51:37,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:37,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:51:37,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:51:37,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2019-09-09 23:51:37,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:51:37,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 23:51:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 23:51:37,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:51:37,272 INFO L87 Difference]: Start difference. First operand 493 states and 788 transitions. Second operand 7 states. [2019-09-09 23:51:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:37,724 INFO L93 Difference]: Finished difference Result 565 states and 887 transitions. [2019-09-09 23:51:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 23:51:37,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-09-09 23:51:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:37,731 INFO L225 Difference]: With dead ends: 565 [2019-09-09 23:51:37,731 INFO L226 Difference]: Without dead ends: 558 [2019-09-09 23:51:37,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-09 23:51:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-09 23:51:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 544. [2019-09-09 23:51:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-09 23:51:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 867 transitions. [2019-09-09 23:51:37,744 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 867 transitions. Word has length 40 [2019-09-09 23:51:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:37,745 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 867 transitions. [2019-09-09 23:51:37,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 23:51:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 867 transitions. [2019-09-09 23:51:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-09 23:51:37,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:37,746 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 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-09 23:51:37,746 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1355356315, now seen corresponding path program 1 times [2019-09-09 23:51:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:37,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 23:51:37,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:37,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:37,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2019-09-09 23:51:37,846 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [349], [352], [355], [525], [531], [532], [533], [534] [2019-09-09 23:51:37,850 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:37,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:37,860 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:39,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:39,646 INFO L272 AbstractInterpreter]: Visited 32 different actions 182 times. Merged at 21 different actions 130 times. Widened at 2 different actions 5 times. Performed 866 root evaluator evaluations with a maximum evaluation depth of 15. Performed 866 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 19 fixpoints after 6 different actions. Largest state had 42 variables. [2019-09-09 23:51:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:39,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:39,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:39,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:51:39,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:39,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:51:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:39,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-09 23:51:39,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 23:51:39,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 23:51:39,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:51:39,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-09-09 23:51:39,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:51:39,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 23:51:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 23:51:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 23:51:39,745 INFO L87 Difference]: Start difference. First operand 544 states and 867 transitions. Second operand 4 states. [2019-09-09 23:51:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:39,866 INFO L93 Difference]: Finished difference Result 556 states and 868 transitions. [2019-09-09 23:51:39,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 23:51:39,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-09 23:51:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:39,870 INFO L225 Difference]: With dead ends: 556 [2019-09-09 23:51:39,870 INFO L226 Difference]: Without dead ends: 546 [2019-09-09 23:51:39,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 23:51:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-09 23:51:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-09-09 23:51:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-09 23:51:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 841 transitions. [2019-09-09 23:51:39,883 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 841 transitions. Word has length 41 [2019-09-09 23:51:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:39,883 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 841 transitions. [2019-09-09 23:51:39,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 23:51:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 841 transitions. [2019-09-09 23:51:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-09 23:51:39,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:39,884 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 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-09 23:51:39,885 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:39,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1488632364, now seen corresponding path program 1 times [2019-09-09 23:51:39,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:39,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:39,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:39,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:39,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:40,298 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 38 [2019-09-09 23:51:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:40,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:40,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:40,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2019-09-09 23:51:40,449 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [385], [525], [531], [532], [533], [534] [2019-09-09 23:51:40,452 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:40,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:40,460 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:41,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:41,107 INFO L272 AbstractInterpreter]: Visited 34 different actions 74 times. Merged at 17 different actions 31 times. Never widened. Performed 344 root evaluator evaluations with a maximum evaluation depth of 15. Performed 344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 8 fixpoints after 5 different actions. Largest state had 44 variables. [2019-09-09 23:51:41,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:41,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:41,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:41,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:51:41,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:41,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:51:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:41,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-09 23:51:41,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:41,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:51:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:51:41,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:51:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:51:41,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:51:41,513 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 20 [2019-09-09 23:51:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:51:41,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:51:41,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2019-09-09 23:51:41,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:51:41,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 23:51:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 23:51:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:51:41,638 INFO L87 Difference]: Start difference. First operand 544 states and 841 transitions. Second operand 7 states. [2019-09-09 23:51:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:42,166 INFO L93 Difference]: Finished difference Result 556 states and 849 transitions. [2019-09-09 23:51:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 23:51:42,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-09-09 23:51:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:42,172 INFO L225 Difference]: With dead ends: 556 [2019-09-09 23:51:42,172 INFO L226 Difference]: Without dead ends: 556 [2019-09-09 23:51:42,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-09 23:51:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-09 23:51:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 545. [2019-09-09 23:51:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-09 23:51:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 842 transitions. [2019-09-09 23:51:42,185 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 842 transitions. Word has length 43 [2019-09-09 23:51:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:42,185 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 842 transitions. [2019-09-09 23:51:42,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 23:51:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 842 transitions. [2019-09-09 23:51:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-09 23:51:42,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:42,186 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 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-09 23:51:42,186 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:42,187 INFO L82 PathProgramCache]: Analyzing trace with hash -971799210, now seen corresponding path program 1 times [2019-09-09 23:51:42,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:42,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:42,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 23:51:42,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:42,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:42,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:42,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:42,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:42,223 INFO L87 Difference]: Start difference. First operand 545 states and 842 transitions. Second operand 3 states. [2019-09-09 23:51:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:42,256 INFO L93 Difference]: Finished difference Result 557 states and 836 transitions. [2019-09-09 23:51:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:42,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-09 23:51:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:42,260 INFO L225 Difference]: With dead ends: 557 [2019-09-09 23:51:42,260 INFO L226 Difference]: Without dead ends: 557 [2019-09-09 23:51:42,261 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-09 23:51:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-09 23:51:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2019-09-09 23:51:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-09 23:51:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 835 transitions. [2019-09-09 23:51:42,273 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 835 transitions. Word has length 44 [2019-09-09 23:51:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:42,274 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 835 transitions. [2019-09-09 23:51:42,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 835 transitions. [2019-09-09 23:51:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 23:51:42,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:42,275 INFO L399 BasicCegarLoop]: trace histogram [4, 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-09 23:51:42,275 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -838324451, now seen corresponding path program 1 times [2019-09-09 23:51:42,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:42,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:42,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 23:51:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:51:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:51:42,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:51:42,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:51:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:51:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:51:42,311 INFO L87 Difference]: Start difference. First operand 555 states and 835 transitions. Second operand 3 states. [2019-09-09 23:51:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:42,337 INFO L93 Difference]: Finished difference Result 313 states and 455 transitions. [2019-09-09 23:51:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:51:42,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-09 23:51:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:42,339 INFO L225 Difference]: With dead ends: 313 [2019-09-09 23:51:42,339 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 23:51:42,340 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-09 23:51:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 23:51:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2019-09-09 23:51:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-09 23:51:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2019-09-09 23:51:42,347 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 54 [2019-09-09 23:51:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:42,347 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2019-09-09 23:51:42,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:51:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2019-09-09 23:51:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 23:51:42,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:42,348 INFO L399 BasicCegarLoop]: trace histogram [4, 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-09 23:51:42,349 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1172050941, now seen corresponding path program 1 times [2019-09-09 23:51:42,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:42,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:42,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:51:42,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:42,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:42,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-09 23:51:42,408 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [525], [531], [532], [533], [534] [2019-09-09 23:51:42,411 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:42,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:42,419 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:51:50,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:51:50,179 INFO L272 AbstractInterpreter]: Visited 41 different actions 268 times. Merged at 33 different actions 187 times. Widened at 2 different actions 6 times. Performed 1238 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 29 fixpoints after 10 different actions. Largest state had 46 variables. [2019-09-09 23:51:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:50,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:51:50,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:50,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 23:51:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:50,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:51:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:50,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-09 23:51:50,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:51:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:51:50,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:51:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:51:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:51:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-09 23:51:50,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:51:50,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 23:51:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 23:51:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-09 23:51:50,320 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand 5 states. [2019-09-09 23:51:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:51:50,469 INFO L93 Difference]: Finished difference Result 418 states and 601 transitions. [2019-09-09 23:51:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 23:51:50,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-09 23:51:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:51:50,474 INFO L225 Difference]: With dead ends: 418 [2019-09-09 23:51:50,475 INFO L226 Difference]: Without dead ends: 418 [2019-09-09 23:51:50,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 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-09 23:51:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-09 23:51:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 389. [2019-09-09 23:51:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-09-09 23:51:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 573 transitions. [2019-09-09 23:51:50,488 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 573 transitions. Word has length 55 [2019-09-09 23:51:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:51:50,489 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 573 transitions. [2019-09-09 23:51:50,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 23:51:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 573 transitions. [2019-09-09 23:51:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 23:51:50,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:51:50,490 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] [2019-09-09 23:51:50,491 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:51:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:51:50,491 INFO L82 PathProgramCache]: Analyzing trace with hash -913885503, now seen corresponding path program 1 times [2019-09-09 23:51:50,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:51:50,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:50,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:51:50,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:51:50,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:51:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:51:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:51:50,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:51:50,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:51:50,607 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-09 23:51:50,607 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [525], [531], [532], [533], [534] [2019-09-09 23:51:50,609 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:51:50,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:51:50,618 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:00,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:00,771 INFO L272 AbstractInterpreter]: Visited 40 different actions 244 times. Merged at 29 different actions 174 times. Widened at 3 different actions 6 times. Performed 1127 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 28 fixpoints after 8 different actions. Largest state had 46 variables. [2019-09-09 23:52:00,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:00,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:00,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:00,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:52:00,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:00,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:52:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:00,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-09 23:52:00,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:52:00,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 23:52:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:00,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2019-09-09 23:52:00,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:00,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 23:52:00,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 23:52:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-09 23:52:00,906 INFO L87 Difference]: Start difference. First operand 389 states and 573 transitions. Second operand 6 states. [2019-09-09 23:52:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:01,038 INFO L93 Difference]: Finished difference Result 436 states and 635 transitions. [2019-09-09 23:52:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 23:52:01,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-09 23:52:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:01,042 INFO L225 Difference]: With dead ends: 436 [2019-09-09 23:52:01,042 INFO L226 Difference]: Without dead ends: 432 [2019-09-09 23:52:01,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-09 23:52:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-09 23:52:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 427. [2019-09-09 23:52:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-09 23:52:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 627 transitions. [2019-09-09 23:52:01,057 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 627 transitions. Word has length 55 [2019-09-09 23:52:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:01,058 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 627 transitions. [2019-09-09 23:52:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 23:52:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2019-09-09 23:52:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 23:52:01,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:01,059 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, 1, 1, 1] [2019-09-09 23:52:01,059 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1026084125, now seen corresponding path program 1 times [2019-09-09 23:52:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:01,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:01,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:01,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:01,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:01,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:01,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2019-09-09 23:52:01,218 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [511], [525], [531], [532], [533], [534] [2019-09-09 23:52:01,220 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:01,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:01,228 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:11,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:11,884 INFO L272 AbstractInterpreter]: Visited 44 different actions 225 times. Merged at 33 different actions 154 times. Widened at 2 different actions 5 times. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 24 fixpoints after 7 different actions. Largest state had 50 variables. [2019-09-09 23:52:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:11,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:11,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:11,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:52:11,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:11,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:52:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:11,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-09 23:52:11,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:12,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:52:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-09-09 23:52:12,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:12,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 23:52:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 23:52:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-09 23:52:12,120 INFO L87 Difference]: Start difference. First operand 427 states and 627 transitions. Second operand 9 states. [2019-09-09 23:52:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:12,245 INFO L93 Difference]: Finished difference Result 427 states and 626 transitions. [2019-09-09 23:52:12,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 23:52:12,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-09 23:52:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:12,249 INFO L225 Difference]: With dead ends: 427 [2019-09-09 23:52:12,249 INFO L226 Difference]: Without dead ends: 427 [2019-09-09 23:52:12,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-09 23:52:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-09 23:52:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-09 23:52:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-09 23:52:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 626 transitions. [2019-09-09 23:52:12,259 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 626 transitions. Word has length 59 [2019-09-09 23:52:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:12,260 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 626 transitions. [2019-09-09 23:52:12,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 23:52:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 626 transitions. [2019-09-09 23:52:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 23:52:12,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:12,261 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 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-09 23:52:12,261 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1844017654, now seen corresponding path program 1 times [2019-09-09 23:52:12,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:12,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:12,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:12,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:12,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:12,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:12,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2019-09-09 23:52:12,799 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [53], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:52:12,801 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:12,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:12,807 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:23,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:23,811 INFO L272 AbstractInterpreter]: Visited 45 different actions 270 times. Merged at 37 different actions 191 times. Widened at 4 different actions 7 times. Performed 1362 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 33 fixpoints after 14 different actions. Largest state had 50 variables. [2019-09-09 23:52:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:23,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:23,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:23,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:52:23,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:23,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:52:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:23,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-09 23:52:23,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:23,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:52:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:52:24,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:52:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 23:52:24,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:24,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2019-09-09 23:52:24,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:24,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 23:52:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 23:52:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-09 23:52:24,133 INFO L87 Difference]: Start difference. First operand 427 states and 626 transitions. Second operand 11 states. [2019-09-09 23:52:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:24,594 INFO L93 Difference]: Finished difference Result 451 states and 648 transitions. [2019-09-09 23:52:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 23:52:24,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-09 23:52:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:24,598 INFO L225 Difference]: With dead ends: 451 [2019-09-09 23:52:24,598 INFO L226 Difference]: Without dead ends: 451 [2019-09-09 23:52:24,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-09 23:52:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-09 23:52:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 428. [2019-09-09 23:52:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 23:52:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-09-09 23:52:24,611 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 66 [2019-09-09 23:52:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:24,612 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-09-09 23:52:24,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 23:52:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-09-09 23:52:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 23:52:24,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:24,618 INFO L399 BasicCegarLoop]: trace histogram [6, 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-09 23:52:24,618 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1592840319, now seen corresponding path program 1 times [2019-09-09 23:52:24,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:24,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:24,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 23:52:24,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:24,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:24,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2019-09-09 23:52:24,703 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [259], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:52:24,705 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:24,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:24,712 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:41,769 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:41,769 INFO L272 AbstractInterpreter]: Visited 46 different actions 489 times. Merged at 38 different actions 371 times. Widened at 5 different actions 16 times. Performed 2233 root evaluator evaluations with a maximum evaluation depth of 17. Performed 2233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 56 fixpoints after 15 different actions. Largest state had 50 variables. [2019-09-09 23:52:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:41,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:41,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:41,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:52:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:41,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:52:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:41,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-09 23:52:41,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 23:52:41,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 23:52:41,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:41,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-09 23:52:41,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:41,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 23:52:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 23:52:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:52:41,902 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 6 states. [2019-09-09 23:52:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:42,074 INFO L93 Difference]: Finished difference Result 545 states and 783 transitions. [2019-09-09 23:52:42,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 23:52:42,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-09 23:52:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:42,078 INFO L225 Difference]: With dead ends: 545 [2019-09-09 23:52:42,078 INFO L226 Difference]: Without dead ends: 545 [2019-09-09 23:52:42,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 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-09 23:52:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-09 23:52:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 506. [2019-09-09 23:52:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-09 23:52:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 746 transitions. [2019-09-09 23:52:42,095 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 746 transitions. Word has length 76 [2019-09-09 23:52:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:42,095 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 746 transitions. [2019-09-09 23:52:42,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 23:52:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 746 transitions. [2019-09-09 23:52:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 23:52:42,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:42,096 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] [2019-09-09 23:52:42,097 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1985867329, now seen corresponding path program 1 times [2019-09-09 23:52:42,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:42,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:42,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 73 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-09 23:52:42,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:42,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:42,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2019-09-09 23:52:42,502 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [259], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:52:42,503 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:42,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:42,510 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:56,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:56,060 INFO L272 AbstractInterpreter]: Visited 45 different actions 312 times. Merged at 37 different actions 229 times. Widened at 5 different actions 8 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 36 fixpoints after 13 different actions. Largest state had 50 variables. [2019-09-09 23:52:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:56,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:56,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:56,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:52:56,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:56,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:52:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:56,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-09 23:52:56,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:56,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-09 23:52:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:56,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 18 [2019-09-09 23:52:56,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:56,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 23:52:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 23:52:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-09-09 23:52:56,387 INFO L87 Difference]: Start difference. First operand 506 states and 746 transitions. Second operand 14 states. [2019-09-09 23:52:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:56,885 INFO L93 Difference]: Finished difference Result 553 states and 799 transitions. [2019-09-09 23:52:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 23:52:56,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-09-09 23:52:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:56,894 INFO L225 Difference]: With dead ends: 553 [2019-09-09 23:52:56,895 INFO L226 Difference]: Without dead ends: 551 [2019-09-09 23:52:56,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-09-09 23:52:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-09 23:52:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 525. [2019-09-09 23:52:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-09 23:52:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2019-09-09 23:52:56,907 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 76 [2019-09-09 23:52:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:56,908 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2019-09-09 23:52:56,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 23:52:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2019-09-09 23:52:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 23:52:56,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:56,909 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 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-09 23:52:56,909 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash -444830537, now seen corresponding path program 1 times [2019-09-09 23:52:56,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:56,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:52:57,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:57,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:57,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2019-09-09 23:52:57,090 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [334], [337], [340], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:52:57,092 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:57,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:57,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:15,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:15,315 INFO L272 AbstractInterpreter]: Visited 47 different actions 356 times. Merged at 39 different actions 268 times. Widened at 4 different actions 8 times. Performed 1841 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1841 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 40 fixpoints after 9 different actions. Largest state had 50 variables. [2019-09-09 23:53:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:15,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:15,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:15,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:53:15,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:15,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:15,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 23:53:15,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:53:15,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-09 23:53:15,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:15,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 10 [2019-09-09 23:53:15,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:15,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 23:53:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 23:53:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:53:15,612 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand 7 states. [2019-09-09 23:53:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:15,792 INFO L93 Difference]: Finished difference Result 550 states and 804 transitions. [2019-09-09 23:53:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 23:53:15,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-09 23:53:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:15,798 INFO L225 Difference]: With dead ends: 550 [2019-09-09 23:53:15,798 INFO L226 Difference]: Without dead ends: 548 [2019-09-09 23:53:15,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:53:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-09-09 23:53:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2019-09-09 23:53:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-09 23:53:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2019-09-09 23:53:15,810 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 86 [2019-09-09 23:53:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:15,810 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2019-09-09 23:53:15,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 23:53:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2019-09-09 23:53:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 23:53:15,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:15,812 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 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-09 23:53:15,812 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash 804066429, now seen corresponding path program 1 times [2019-09-09 23:53:15,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:15,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:15,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:16,282 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 21 [2019-09-09 23:53:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 14 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:16,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:16,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:16,303 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-09 23:53:16,303 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [385], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:53:16,305 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:16,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:16,310 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:25,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:25,839 INFO L272 AbstractInterpreter]: Visited 45 different actions 238 times. Merged at 37 different actions 164 times. Widened at 3 different actions 5 times. Performed 1081 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1081 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 28 fixpoints after 12 different actions. Largest state had 50 variables. [2019-09-09 23:53:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:25,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:25,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:25,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:25,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:25,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:25,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-09 23:53:25,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 14 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:25,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:26,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:26,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:26,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:26,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 44 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2019-09-09 23:53:26,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:26,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 23:53:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 23:53:26,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-09 23:53:26,370 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand 11 states. [2019-09-09 23:53:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:26,627 INFO L93 Difference]: Finished difference Result 547 states and 800 transitions. [2019-09-09 23:53:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 23:53:26,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-09 23:53:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:26,631 INFO L225 Difference]: With dead ends: 547 [2019-09-09 23:53:26,631 INFO L226 Difference]: Without dead ends: 547 [2019-09-09 23:53:26,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-09 23:53:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-09 23:53:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-09-09 23:53:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-09 23:53:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2019-09-09 23:53:26,642 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 89 [2019-09-09 23:53:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:26,643 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2019-09-09 23:53:26,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 23:53:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2019-09-09 23:53:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 23:53:26,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:26,644 INFO L399 BasicCegarLoop]: trace histogram [8, 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-09 23:53:26,644 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -569092908, now seen corresponding path program 1 times [2019-09-09 23:53:26,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:26,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:53:26,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:26,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:26,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-09 23:53:26,723 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:53:26,724 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:26,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:26,729 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:36,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:36,884 INFO L272 AbstractInterpreter]: Visited 48 different actions 350 times. Merged at 37 different actions 248 times. Widened at 3 different actions 7 times. Performed 1420 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 42 fixpoints after 11 different actions. Largest state had 50 variables. [2019-09-09 23:53:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:36,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:36,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:36,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:53:36,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:36,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:36,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-09 23:53:36,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:53:36,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:53:37,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:37,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-09 23:53:37,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:37,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 23:53:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 23:53:37,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-09 23:53:37,066 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 7 states. [2019-09-09 23:53:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:37,231 INFO L93 Difference]: Finished difference Result 672 states and 964 transitions. [2019-09-09 23:53:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 23:53:37,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-09-09 23:53:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:37,235 INFO L225 Difference]: With dead ends: 672 [2019-09-09 23:53:37,235 INFO L226 Difference]: Without dead ends: 672 [2019-09-09 23:53:37,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 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-09 23:53:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-09 23:53:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 623. [2019-09-09 23:53:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-09 23:53:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 918 transitions. [2019-09-09 23:53:37,249 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 918 transitions. Word has length 101 [2019-09-09 23:53:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:37,249 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 918 transitions. [2019-09-09 23:53:37,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 23:53:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 918 transitions. [2019-09-09 23:53:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 23:53:37,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:37,251 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] [2019-09-09 23:53:37,251 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash -310927470, now seen corresponding path program 1 times [2019-09-09 23:53:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:37,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:37,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:53:37,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:37,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:37,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-09 23:53:37,506 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:53:37,509 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:37,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:37,517 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:45,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:45,628 INFO L272 AbstractInterpreter]: Visited 47 different actions 252 times. Merged at 39 different actions 175 times. Widened at 3 different actions 5 times. Performed 1102 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1102 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 30 fixpoints after 12 different actions. Largest state had 50 variables. [2019-09-09 23:53:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:45,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:45,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:45,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:45,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:45,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-09 23:53:45,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:53:45,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-09 23:53:45,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:45,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 4] total 10 [2019-09-09 23:53:45,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:45,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 23:53:45,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 23:53:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:53:45,837 INFO L87 Difference]: Start difference. First operand 623 states and 918 transitions. Second operand 8 states. [2019-09-09 23:53:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:46,044 INFO L93 Difference]: Finished difference Result 668 states and 979 transitions. [2019-09-09 23:53:46,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 23:53:46,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-09 23:53:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:46,048 INFO L225 Difference]: With dead ends: 668 [2019-09-09 23:53:46,049 INFO L226 Difference]: Without dead ends: 664 [2019-09-09 23:53:46,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-09 23:53:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-09 23:53:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2019-09-09 23:53:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-09 23:53:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 972 transitions. [2019-09-09 23:53:46,064 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 972 transitions. Word has length 101 [2019-09-09 23:53:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:46,064 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 972 transitions. [2019-09-09 23:53:46,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 23:53:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 972 transitions. [2019-09-09 23:53:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 23:53:46,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:46,066 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:53:46,066 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 869583668, now seen corresponding path program 1 times [2019-09-09 23:53:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:46,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:46,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:46,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:46,340 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-09 23:53:46,340 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [511], [513], [525], [531], [532], [533], [534] [2019-09-09 23:53:46,342 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:46,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:46,355 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:54:00,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:54:00,910 INFO L272 AbstractInterpreter]: Visited 45 different actions 299 times. Merged at 37 different actions 218 times. Widened at 4 different actions 7 times. Performed 1562 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 36 fixpoints after 14 different actions. Largest state had 50 variables. [2019-09-09 23:54:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:00,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:54:00,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:00,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:00,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:00,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:54:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:01,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-09 23:54:01,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:54:01,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:01,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 62 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:54:01,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2019-09-09 23:54:01,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:01,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 23:54:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 23:54:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-09 23:54:01,425 INFO L87 Difference]: Start difference. First operand 661 states and 972 transitions. Second operand 15 states. [2019-09-09 23:54:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:01,674 INFO L93 Difference]: Finished difference Result 661 states and 971 transitions. [2019-09-09 23:54:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 23:54:01,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-09-09 23:54:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:01,682 INFO L225 Difference]: With dead ends: 661 [2019-09-09 23:54:01,682 INFO L226 Difference]: Without dead ends: 661 [2019-09-09 23:54:01,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-09 23:54:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-09 23:54:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-09-09 23:54:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-09 23:54:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 971 transitions. [2019-09-09 23:54:01,696 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 971 transitions. Word has length 105 [2019-09-09 23:54:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:01,696 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 971 transitions. [2019-09-09 23:54:01,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 23:54:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 971 transitions. [2019-09-09 23:54:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 23:54:01,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:01,698 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 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-09 23:54:01,698 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 190652569, now seen corresponding path program 2 times [2019-09-09 23:54:01,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:01,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:01,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 18 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:54:02,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:02,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:02,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:02,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:02,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:02,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 23:54:02,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:54:02,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:02,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-09 23:54:02,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:02,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-09 23:54:02,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:02,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:02,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 136 proven. 31 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-09 23:54:02,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:02,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:02,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:03,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:03,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:03,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:03,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:03,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:03,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 135 proven. 32 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 23:54:03,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:03,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 22 [2019-09-09 23:54:03,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:03,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-09 23:54:03,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-09 23:54:03,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-09-09 23:54:03,280 INFO L87 Difference]: Start difference. First operand 661 states and 971 transitions. Second operand 18 states. [2019-09-09 23:54:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:04,755 INFO L93 Difference]: Finished difference Result 605 states and 832 transitions. [2019-09-09 23:54:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-09 23:54:04,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 112 [2019-09-09 23:54:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:04,760 INFO L225 Difference]: With dead ends: 605 [2019-09-09 23:54:04,760 INFO L226 Difference]: Without dead ends: 597 [2019-09-09 23:54:04,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2019-09-09 23:54:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-09 23:54:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 528. [2019-09-09 23:54:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-09 23:54:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 743 transitions. [2019-09-09 23:54:04,773 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 743 transitions. Word has length 112 [2019-09-09 23:54:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:04,773 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 743 transitions. [2019-09-09 23:54:04,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-09 23:54:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 743 transitions. [2019-09-09 23:54:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 23:54:04,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:04,775 INFO L399 BasicCegarLoop]: trace histogram [10, 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-09 23:54:04,775 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:04,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:04,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2048729936, now seen corresponding path program 2 times [2019-09-09 23:54:04,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:04,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:04,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 58 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 23:54:04,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:04,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:04,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:04,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:04,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:04,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:04,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:54:04,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 23:54:05,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-09 23:54:05,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:05,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-09 23:54:05,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 58 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 23:54:05,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 58 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 23:54:05,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-09 23:54:05,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:05,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 23:54:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 23:54:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-09 23:54:05,216 INFO L87 Difference]: Start difference. First operand 528 states and 743 transitions. Second operand 8 states. [2019-09-09 23:54:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:05,340 INFO L93 Difference]: Finished difference Result 586 states and 811 transitions. [2019-09-09 23:54:05,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 23:54:05,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-09-09 23:54:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:05,344 INFO L225 Difference]: With dead ends: 586 [2019-09-09 23:54:05,345 INFO L226 Difference]: Without dead ends: 586 [2019-09-09 23:54:05,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-09 23:54:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-09 23:54:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 567. [2019-09-09 23:54:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-09 23:54:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 797 transitions. [2019-09-09 23:54:05,360 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 797 transitions. Word has length 122 [2019-09-09 23:54:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:05,361 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 797 transitions. [2019-09-09 23:54:05,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 23:54:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 797 transitions. [2019-09-09 23:54:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-09 23:54:05,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:05,363 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 23:54:05,363 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1989472887, now seen corresponding path program 1 times [2019-09-09 23:54:05,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:05,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:05,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:05,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 22 proven. 307 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 23:54:05,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:05,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:05,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-09 23:54:05,736 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [364], [367], [370], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:54:05,737 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:54:05,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:54:05,744 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:54:18,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:54:18,996 INFO L272 AbstractInterpreter]: Visited 47 different actions 292 times. Merged at 39 different actions 211 times. Widened at 4 different actions 7 times. Performed 1320 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 33 fixpoints after 14 different actions. Largest state had 50 variables. [2019-09-09 23:54:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:18,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:54:18,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:18,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:19,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:19,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:54:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:19,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-09 23:54:19,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 23:54:19,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:19,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 266 proven. 64 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 23:54:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 23:54:19,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 21 [2019-09-09 23:54:19,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:54:19,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 23:54:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 23:54:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2019-09-09 23:54:19,508 INFO L87 Difference]: Start difference. First operand 567 states and 797 transitions. Second operand 8 states. [2019-09-09 23:54:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:19,593 INFO L93 Difference]: Finished difference Result 706 states and 991 transitions. [2019-09-09 23:54:19,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 23:54:19,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-09-09 23:54:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:19,598 INFO L225 Difference]: With dead ends: 706 [2019-09-09 23:54:19,598 INFO L226 Difference]: Without dead ends: 704 [2019-09-09 23:54:19,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2019-09-09 23:54:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-09 23:54:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 700. [2019-09-09 23:54:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-09 23:54:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 986 transitions. [2019-09-09 23:54:19,614 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 986 transitions. Word has length 134 [2019-09-09 23:54:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:19,614 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 986 transitions. [2019-09-09 23:54:19,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 23:54:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 986 transitions. [2019-09-09 23:54:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-09 23:54:19,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:19,616 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 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-09 23:54:19,616 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1555564814, now seen corresponding path program 2 times [2019-09-09 23:54:19,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:19,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:19,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:20,211 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 21 [2019-09-09 23:54:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 22 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:54:20,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:20,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:20,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:20,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:20,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:20,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:20,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:54:20,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 23:54:20,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-09 23:54:20,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:20,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-09 23:54:20,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:20,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 330 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 23:54:20,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:20,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:20,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:21,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:21,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:21,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 296 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:54:21,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:21,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 30 [2019-09-09 23:54:21,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:21,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-09 23:54:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-09 23:54:21,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=605, Unknown=0, NotChecked=0, Total=870 [2019-09-09 23:54:21,503 INFO L87 Difference]: Start difference. First operand 700 states and 986 transitions. Second operand 22 states. [2019-09-09 23:54:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:22,350 INFO L93 Difference]: Finished difference Result 708 states and 991 transitions. [2019-09-09 23:54:22,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-09 23:54:22,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2019-09-09 23:54:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:22,359 INFO L225 Difference]: With dead ends: 708 [2019-09-09 23:54:22,359 INFO L226 Difference]: Without dead ends: 708 [2019-09-09 23:54:22,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2019-09-09 23:54:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-09 23:54:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 700. [2019-09-09 23:54:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-09 23:54:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 985 transitions. [2019-09-09 23:54:22,374 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 985 transitions. Word has length 135 [2019-09-09 23:54:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:22,375 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 985 transitions. [2019-09-09 23:54:22,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-09 23:54:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 985 transitions. [2019-09-09 23:54:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 23:54:22,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:22,377 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:54:22,377 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1991947744, now seen corresponding path program 1 times [2019-09-09 23:54:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:22,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:22,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 79 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 23:54:22,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:22,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:22,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-09-09 23:54:22,500 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [490], [493], [496], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-09-09 23:54:22,503 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:54:22,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:54:22,518 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:54:34,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:54:34,362 INFO L272 AbstractInterpreter]: Visited 48 different actions 460 times. Merged at 40 different actions 343 times. Widened at 5 different actions 14 times. Performed 2068 root evaluator evaluations with a maximum evaluation depth of 17. Performed 2068 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 55 fixpoints after 18 different actions. Largest state had 50 variables. [2019-09-09 23:54:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:34,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:54:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:34,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:34,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:54:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:34,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-09 23:54:34,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 79 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 23:54:34,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 79 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 23:54:34,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:34,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-09 23:54:34,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:34,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 23:54:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 23:54:34,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-09 23:54:34,624 INFO L87 Difference]: Start difference. First operand 700 states and 985 transitions. Second operand 9 states. [2019-09-09 23:54:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:34,790 INFO L93 Difference]: Finished difference Result 801 states and 1113 transitions. [2019-09-09 23:54:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 23:54:34,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-09 23:54:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:34,795 INFO L225 Difference]: With dead ends: 801 [2019-09-09 23:54:34,795 INFO L226 Difference]: Without dead ends: 801 [2019-09-09 23:54:34,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-09 23:54:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-09 23:54:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 778. [2019-09-09 23:54:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-09-09 23:54:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1097 transitions. [2019-09-09 23:54:34,816 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1097 transitions. Word has length 150 [2019-09-09 23:54:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:34,817 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1097 transitions. [2019-09-09 23:54:34,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 23:54:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1097 transitions. [2019-09-09 23:54:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 23:54:34,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:34,819 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, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:54:34,820 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash 611220933, now seen corresponding path program 2 times [2019-09-09 23:54:34,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:34,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 24 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:54:35,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:35,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:35,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:35,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:35,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:35,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:35,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:54:35,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:35,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-09 23:54:35,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:35,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-09 23:54:35,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 402 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 23:54:35,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 368 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 23:54:36,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:36,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2019-09-09 23:54:36,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:36,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-09 23:54:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-09 23:54:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-09-09 23:54:36,338 INFO L87 Difference]: Start difference. First operand 778 states and 1097 transitions. Second operand 23 states. [2019-09-09 23:54:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:37,031 INFO L93 Difference]: Finished difference Result 784 states and 1100 transitions. [2019-09-09 23:54:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-09 23:54:37,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 151 [2019-09-09 23:54:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:37,039 INFO L225 Difference]: With dead ends: 784 [2019-09-09 23:54:37,039 INFO L226 Difference]: Without dead ends: 784 [2019-09-09 23:54:37,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=451, Invalid=1189, Unknown=0, NotChecked=0, Total=1640 [2019-09-09 23:54:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-09-09 23:54:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 778. [2019-09-09 23:54:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-09-09 23:54:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1095 transitions. [2019-09-09 23:54:37,053 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1095 transitions. Word has length 151 [2019-09-09 23:54:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:37,053 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1095 transitions. [2019-09-09 23:54:37,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-09 23:54:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1095 transitions. [2019-09-09 23:54:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 23:54:37,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:37,055 INFO L399 BasicCegarLoop]: trace histogram [14, 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-09 23:54:37,056 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:37,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1954464991, now seen corresponding path program 3 times [2019-09-09 23:54:37,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:37,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:37,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:37,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:37,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 84 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 23:54:37,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:37,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:37,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:37,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:37,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:37,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:37,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 23:54:37,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 23:54:37,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 23:54:37,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:37,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-09 23:54:37,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 84 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 23:54:37,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 84 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 23:54:37,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:37,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-09 23:54:37,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:37,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 23:54:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 23:54:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-09 23:54:37,536 INFO L87 Difference]: Start difference. First operand 778 states and 1095 transitions. Second operand 10 states. [2019-09-09 23:54:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:37,662 INFO L93 Difference]: Finished difference Result 882 states and 1221 transitions. [2019-09-09 23:54:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 23:54:37,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 168 [2019-09-09 23:54:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:37,668 INFO L225 Difference]: With dead ends: 882 [2019-09-09 23:54:37,668 INFO L226 Difference]: Without dead ends: 882 [2019-09-09 23:54:37,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 335 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-09 23:54:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-09-09 23:54:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 856. [2019-09-09 23:54:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-09-09 23:54:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1202 transitions. [2019-09-09 23:54:37,685 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1202 transitions. Word has length 168 [2019-09-09 23:54:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:37,685 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1202 transitions. [2019-09-09 23:54:37,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 23:54:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1202 transitions. [2019-09-09 23:54:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-09 23:54:37,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:37,688 INFO L399 BasicCegarLoop]: trace histogram [16, 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-09 23:54:37,688 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1475443439, now seen corresponding path program 2 times [2019-09-09 23:54:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:37,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:37,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 109 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-09 23:54:37,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:37,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:37,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:37,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:37,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:37,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:37,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:54:37,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:38,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-09 23:54:38,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:38,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-09 23:54:38,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:38,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:38,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 292 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-09 23:54:38,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:38,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:54:38,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:54:38,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:54:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 292 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-09 23:54:38,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:38,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 18 [2019-09-09 23:54:38,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:38,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 23:54:38,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 23:54:38,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-09-09 23:54:38,499 INFO L87 Difference]: Start difference. First operand 856 states and 1202 transitions. Second operand 15 states. [2019-09-09 23:54:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:39,187 INFO L93 Difference]: Finished difference Result 530 states and 714 transitions. [2019-09-09 23:54:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-09 23:54:39,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 196 [2019-09-09 23:54:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:39,190 INFO L225 Difference]: With dead ends: 530 [2019-09-09 23:54:39,190 INFO L226 Difference]: Without dead ends: 530 [2019-09-09 23:54:39,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=853, Unknown=0, NotChecked=0, Total=1260 [2019-09-09 23:54:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-09 23:54:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 507. [2019-09-09 23:54:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-09 23:54:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 697 transitions. [2019-09-09 23:54:39,198 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 697 transitions. Word has length 196 [2019-09-09 23:54:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:39,199 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 697 transitions. [2019-09-09 23:54:39,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 23:54:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 697 transitions. [2019-09-09 23:54:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-09 23:54:39,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:39,203 INFO L399 BasicCegarLoop]: trace histogram [22, 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-09 23:54:39,203 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash -181350083, now seen corresponding path program 4 times [2019-09-09 23:54:39,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:39,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:39,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 136 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-09 23:54:39,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:39,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:39,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:39,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:39,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:39,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:39,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:39,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-09 23:54:39,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 136 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-09 23:54:39,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 136 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-09 23:54:40,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:40,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2019-09-09 23:54:40,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:40,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 23:54:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 23:54:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-09 23:54:40,111 INFO L87 Difference]: Start difference. First operand 507 states and 697 transitions. Second operand 14 states. [2019-09-09 23:54:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:40,286 INFO L93 Difference]: Finished difference Result 628 states and 860 transitions. [2019-09-09 23:54:40,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 23:54:40,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 260 [2019-09-09 23:54:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:40,290 INFO L225 Difference]: With dead ends: 628 [2019-09-09 23:54:40,290 INFO L226 Difference]: Without dead ends: 628 [2019-09-09 23:54:40,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 513 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-09 23:54:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-09 23:54:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 585. [2019-09-09 23:54:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-09 23:54:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 804 transitions. [2019-09-09 23:54:40,300 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 804 transitions. Word has length 260 [2019-09-09 23:54:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:40,301 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 804 transitions. [2019-09-09 23:54:40,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 23:54:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 804 transitions. [2019-09-09 23:54:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-09 23:54:40,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:40,306 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 19, 19, 12, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:54:40,306 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -733930484, now seen corresponding path program 5 times [2019-09-09 23:54:40,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:54:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:40,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 162 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-09 23:54:40,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:40,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:40,655 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:40,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:40,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:40,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:40,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:54:40,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:41,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-09 23:54:41,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:41,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1808 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-09 23:54:41,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 162 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-09 23:54:41,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 162 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-09 23:54:41,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:41,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 19 [2019-09-09 23:54:41,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:41,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-09 23:54:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-09 23:54:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-09 23:54:41,547 INFO L87 Difference]: Start difference. First operand 585 states and 804 transitions. Second operand 16 states. [2019-09-09 23:54:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:41,709 INFO L93 Difference]: Finished difference Result 706 states and 967 transitions. [2019-09-09 23:54:41,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-09 23:54:41,709 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 306 [2019-09-09 23:54:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:41,713 INFO L225 Difference]: With dead ends: 706 [2019-09-09 23:54:41,713 INFO L226 Difference]: Without dead ends: 706 [2019-09-09 23:54:41,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 601 SyntacticMatches, 21 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-09 23:54:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-09-09 23:54:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 663. [2019-09-09 23:54:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-09 23:54:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 911 transitions. [2019-09-09 23:54:41,723 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 911 transitions. Word has length 306 [2019-09-09 23:54:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:41,724 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 911 transitions. [2019-09-09 23:54:41,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-09 23:54:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 911 transitions. [2019-09-09 23:54:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-09 23:54:41,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:41,729 INFO L399 BasicCegarLoop]: trace histogram [30, 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-09 23:54:41,729 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:41,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 606393499, now seen corresponding path program 6 times [2019-09-09 23:54:41,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:41,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:41,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:54:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2864 backedges. 188 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-09 23:54:42,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:42,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:54:42,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:54:42,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:54:42,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:54:42,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09 23:54:42,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 23:54:42,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:54:42,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 23:54:42,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:54:42,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-09 23:54:42,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:54:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2864 backedges. 188 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-09 23:54:42,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:54:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2864 backedges. 188 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-09 23:54:43,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:54:43,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 19 [2019-09-09 23:54:43,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:54:43,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-09 23:54:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-09 23:54:43,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-09 23:54:43,089 INFO L87 Difference]: Start difference. First operand 663 states and 911 transitions. Second operand 18 states. [2019-09-09 23:54:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:54:43,261 INFO L93 Difference]: Finished difference Result 784 states and 1074 transitions. [2019-09-09 23:54:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-09 23:54:43,262 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2019-09-09 23:54:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:54:43,267 INFO L225 Difference]: With dead ends: 784 [2019-09-09 23:54:43,267 INFO L226 Difference]: Without dead ends: 784 [2019-09-09 23:54:43,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 689 SyntacticMatches, 29 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-09 23:54:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-09-09 23:54:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 741. [2019-09-09 23:54:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-09-09 23:54:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1018 transitions. [2019-09-09 23:54:43,279 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1018 transitions. Word has length 352 [2019-09-09 23:54:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:54:43,280 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 1018 transitions. [2019-09-09 23:54:43,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-09 23:54:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1018 transitions. [2019-09-09 23:54:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-09 23:54:43,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:54:43,286 INFO L399 BasicCegarLoop]: trace histogram [34, 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-09 23:54:43,287 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:54:43,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:54:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1987974422, now seen corresponding path program 7 times [2019-09-09 23:54:43,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:54:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:43,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 23:54:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:54:43,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:54:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 23:54:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 23:54:44,804 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 23:54:45,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 11:54:45 BoogieIcfgContainer [2019-09-09 23:54:45,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 23:54:45,092 INFO L168 Benchmark]: Toolchain (without parser) took 198999.61 ms. Allocated memory was 134.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 89.8 MB in the beginning and 644.5 MB in the end (delta: -554.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-09 23:54:45,093 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 23:54:45,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.29 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 89.6 MB in the beginning and 171.7 MB in the end (delta: -82.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-09-09 23:54:45,096 INFO L168 Benchmark]: Boogie Preprocessor took 124.33 ms. Allocated memory is still 201.9 MB. Free memory was 171.7 MB in the beginning and 168.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-09-09 23:54:45,098 INFO L168 Benchmark]: RCFGBuilder took 894.67 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 117.2 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-09-09 23:54:45,104 INFO L168 Benchmark]: TraceAbstraction took 197365.48 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 117.2 MB in the beginning and 644.5 MB in the end (delta: -527.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-09 23:54:45,112 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.25 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 609.29 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 89.6 MB in the beginning and 171.7 MB in the end (delta: -82.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.33 ms. Allocated memory is still 201.9 MB. Free memory was 171.7 MB in the beginning and 168.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 894.67 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 117.2 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197365.48 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 117.2 MB in the beginning and 644.5 MB in the end (delta: -527.3 MB). Peak memory consumption was 1.2 GB. 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)=9, \old(m_msg_1_2)=6, \old(m_msg_2)=7, \old(m_Protocol)=11, \old(m_recv_ack_1_1)=8, \old(m_recv_ack_1_2)=10, \old(m_recv_ack_2)=12, m_msg_1_1=4, m_msg_1_2=5, 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=5, P2=5, P3=0, P4=5, P5=0, P6=0, P7=0, P8=5, P9=5, 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=5, P2=5, P3=0, P4=5, P5=0, P6=0, P7=0, P8=5, P9=5, 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=5, P2=5, P3=0, P4=5, P5=0, P6=0, P7=0, P8=5, P9=5, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=2, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=2, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=2, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=2, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=2, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=2, P4=0, P5=0, P6=0, P7=5, P8=5, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=2] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=2] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=2] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=2] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=6] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=6] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, q=1, this_buffer_empty=1, this_expect=6] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=-2, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=-2, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=-2, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=-2, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=-2, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=-2, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-2, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=-1, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=2, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=0, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=1, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=1, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=1, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, 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=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=-2, P2=5, P3=5, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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=5, P3=0, P4=0, P5=0, P6=0, P7=5, P8=5, P9=0, 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, 197.3s OverallTime, 37 OverallIterations, 34 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7139 SDtfs, 11230 SDslu, 30359 SDs, 0 SdLazy, 5628 SolverSat, 737 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6754 GetRequests, 6209 SyntacticMatches, 108 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 1973 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=856occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 163.5s AbstIntTime, 19 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 642 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 6964 NumberOfCodeBlocks, 6780 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 9639 ConstructedInterpolants, 290 QuantifiedInterpolants, 7387752 SizeOfPredicates, 79 NumberOfNonLiveVariables, 18311 ConjunctsInSsa, 465 ConjunctsInUnsatCore, 92 InterpolantComputations, 11 PerfectInterpolantSequences, 8456/33790 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...