./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:06:42,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:06:42,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:06:42,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:06:42,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:06:42,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:06:42,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:06:42,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:06:42,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:06:42,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:06:42,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:06:42,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:06:42,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:06:42,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:06:42,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:06:42,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:06:42,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:06:42,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:06:42,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:06:42,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:06:42,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:06:42,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:06:42,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:06:42,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:06:42,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:06:42,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:06:42,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:06:42,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:06:42,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:06:42,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:06:42,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:06:42,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:06:42,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:06:42,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:06:42,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:06:42,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:06:42,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:06:42,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:06:42,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:06:42,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:06:42,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:06:42,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:06:42,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:06:42,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:06:42,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:06:42,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:06:42,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:06:42,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:06:42,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:06:42,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:06:42,704 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:06:42,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:06:42,704 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:06:42,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:06:42,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:06:42,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:06:42,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:06:42,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:06:42,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:06:42,706 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:06:42,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:06:42,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:06:42,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:06:42,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:06:42,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:06:42,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:06:42,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:06:42,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:06:42,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:06:42,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:06:42,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:06:42,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:06:42,709 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:06:42,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:06:42,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:06:42,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef [2022-11-18 20:06:43,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:06:43,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:06:43,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:06:43,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:06:43,041 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:06:43,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-11-18 20:06:43,126 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/data/e9bddb655/b3895dc2d8ba40cfade00f610f01b549/FLAG89402e42a [2022-11-18 20:06:43,582 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:06:43,583 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-11-18 20:06:43,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/data/e9bddb655/b3895dc2d8ba40cfade00f610f01b549/FLAG89402e42a [2022-11-18 20:06:43,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/data/e9bddb655/b3895dc2d8ba40cfade00f610f01b549 [2022-11-18 20:06:43,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:06:43,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:06:43,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:06:43,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:06:43,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:06:43,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:06:43" (1/1) ... [2022-11-18 20:06:43,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed1927f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:43, skipping insertion in model container [2022-11-18 20:06:43,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:06:43" (1/1) ... [2022-11-18 20:06:43,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:06:43,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:06:44,266 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-11-18 20:06:44,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:06:44,282 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:06:44,388 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-11-18 20:06:44,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:06:44,412 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:06:44,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44 WrapperNode [2022-11-18 20:06:44,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:06:44,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:06:44,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:06:44,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:06:44,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,488 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2022-11-18 20:06:44,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:06:44,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:06:44,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:06:44,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:06:44,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,528 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:06:44,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:06:44,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:06:44,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:06:44,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (1/1) ... [2022-11-18 20:06:44,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:06:44,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:44,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:06:44,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:06:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:06:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:06:44,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:06:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:06:44,775 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:06:44,794 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:06:45,527 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:06:45,535 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:06:45,535 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:06:45,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:06:45 BoogieIcfgContainer [2022-11-18 20:06:45,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:06:45,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:06:45,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:06:45,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:06:45,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:06:43" (1/3) ... [2022-11-18 20:06:45,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbe36c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:06:45, skipping insertion in model container [2022-11-18 20:06:45,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:06:44" (2/3) ... [2022-11-18 20:06:45,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbe36c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:06:45, skipping insertion in model container [2022-11-18 20:06:45,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:06:45" (3/3) ... [2022-11-18 20:06:45,553 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2022-11-18 20:06:45,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:06:45,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:06:45,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:06:45,656 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68b7d660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:06:45,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:06:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:06:45,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:45,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:45,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2022-11-18 20:06:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:45,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364905094] [2022-11-18 20:06:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364905094] [2022-11-18 20:06:45,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364905094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:45,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:45,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:06:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924667921] [2022-11-18 20:06:45,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:06:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:06:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:06:45,959 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:46,019 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2022-11-18 20:06:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:06:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 20:06:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:46,030 INFO L225 Difference]: With dead ends: 218 [2022-11-18 20:06:46,031 INFO L226 Difference]: Without dead ends: 106 [2022-11-18 20:06:46,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:06:46,037 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:46,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-18 20:06:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-18 20:06:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 105 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2022-11-18 20:06:46,075 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2022-11-18 20:06:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:46,075 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2022-11-18 20:06:46,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2022-11-18 20:06:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:06:46,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:46,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:46,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:06:46,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2022-11-18 20:06:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:46,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298187578] [2022-11-18 20:06:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:46,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298187578] [2022-11-18 20:06:46,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298187578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:46,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:46,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:06:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704468275] [2022-11-18 20:06:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:46,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:06:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:46,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:06:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:06:46,152 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:46,198 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2022-11-18 20:06:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:06:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:06:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:46,200 INFO L225 Difference]: With dead ends: 214 [2022-11-18 20:06:46,200 INFO L226 Difference]: Without dead ends: 110 [2022-11-18 20:06:46,201 INFO L412 NwaCegarLoop]: 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 [2022-11-18 20:06:46,202 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:46,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 332 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-18 20:06:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-18 20:06:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 109 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2022-11-18 20:06:46,213 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2022-11-18 20:06:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:46,214 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2022-11-18 20:06:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2022-11-18 20:06:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:06:46,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:46,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:46,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:06:46,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:46,217 INFO L85 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2022-11-18 20:06:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038663038] [2022-11-18 20:06:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038663038] [2022-11-18 20:06:46,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038663038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:46,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:46,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:06:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248211120] [2022-11-18 20:06:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:46,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:06:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:06:46,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:06:46,658 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:46,958 INFO L93 Difference]: Finished difference Result 326 states and 541 transitions. [2022-11-18 20:06:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:06:46,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 20:06:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:46,961 INFO L225 Difference]: With dead ends: 326 [2022-11-18 20:06:46,961 INFO L226 Difference]: Without dead ends: 197 [2022-11-18 20:06:46,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:06:46,963 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 148 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:46,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 389 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:06:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-18 20:06:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2022-11-18 20:06:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.644808743169399) internal successors, (301), 183 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2022-11-18 20:06:46,977 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2022-11-18 20:06:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:46,978 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2022-11-18 20:06:46,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2022-11-18 20:06:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:06:46,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:46,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:46,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:06:46,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2022-11-18 20:06:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:46,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098596943] [2022-11-18 20:06:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:47,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098596943] [2022-11-18 20:06:47,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098596943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:47,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:47,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:06:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372917401] [2022-11-18 20:06:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:06:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:06:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:06:47,019 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:47,049 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2022-11-18 20:06:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:06:47,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 20:06:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:47,051 INFO L225 Difference]: With dead ends: 314 [2022-11-18 20:06:47,051 INFO L226 Difference]: Without dead ends: 133 [2022-11-18 20:06:47,052 INFO L412 NwaCegarLoop]: 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 [2022-11-18 20:06:47,053 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 33 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:47,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-18 20:06:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-11-18 20:06:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.623076923076923) internal successors, (211), 130 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2022-11-18 20:06:47,062 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2022-11-18 20:06:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:47,062 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2022-11-18 20:06:47,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2022-11-18 20:06:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:06:47,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:47,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:47,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:06:47,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2022-11-18 20:06:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:47,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388320797] [2022-11-18 20:06:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:06:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:47,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388320797] [2022-11-18 20:06:47,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388320797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:47,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:47,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:06:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919051559] [2022-11-18 20:06:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:47,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:06:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:47,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:06:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:06:47,125 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:47,158 INFO L93 Difference]: Finished difference Result 267 states and 431 transitions. [2022-11-18 20:06:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:06:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 20:06:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:47,159 INFO L225 Difference]: With dead ends: 267 [2022-11-18 20:06:47,159 INFO L226 Difference]: Without dead ends: 139 [2022-11-18 20:06:47,160 INFO L412 NwaCegarLoop]: 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 [2022-11-18 20:06:47,161 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 35 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:47,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 306 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-18 20:06:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-11-18 20:06:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 136 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 218 transitions. [2022-11-18 20:06:47,169 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 218 transitions. Word has length 24 [2022-11-18 20:06:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 218 transitions. [2022-11-18 20:06:47,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 218 transitions. [2022-11-18 20:06:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:06:47,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:47,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:47,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:06:47,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2022-11-18 20:06:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:47,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895693065] [2022-11-18 20:06:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:47,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895693065] [2022-11-18 20:06:47,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895693065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703198464] [2022-11-18 20:06:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:47,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:47,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:47,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:06:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:47,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:06:47,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:47,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:47,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703198464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:47,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:47,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-18 20:06:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361990091] [2022-11-18 20:06:47,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:47,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:06:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:47,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:06:47,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:06:47,581 INFO L87 Difference]: Start difference. First operand 137 states and 218 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:47,798 INFO L93 Difference]: Finished difference Result 258 states and 411 transitions. [2022-11-18 20:06:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:06:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:06:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:47,800 INFO L225 Difference]: With dead ends: 258 [2022-11-18 20:06:47,800 INFO L226 Difference]: Without dead ends: 243 [2022-11-18 20:06:47,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:06:47,802 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 348 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:47,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 708 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:06:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-18 20:06:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 220. [2022-11-18 20:06:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6484018264840183) internal successors, (361), 219 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 361 transitions. [2022-11-18 20:06:47,814 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 361 transitions. Word has length 26 [2022-11-18 20:06:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:47,814 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 361 transitions. [2022-11-18 20:06:47,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 361 transitions. [2022-11-18 20:06:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 20:06:47,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:47,816 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:47,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:48,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:48,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2022-11-18 20:06:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774610704] [2022-11-18 20:06:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774610704] [2022-11-18 20:06:48,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774610704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849724143] [2022-11-18 20:06:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:48,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:48,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:48,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:06:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:48,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:06:48,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:48,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:48,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849724143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:48,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:48,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-11-18 20:06:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046185211] [2022-11-18 20:06:48,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:06:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:06:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:06:48,777 INFO L87 Difference]: Start difference. First operand 220 states and 361 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:48,990 INFO L93 Difference]: Finished difference Result 462 states and 753 transitions. [2022-11-18 20:06:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:06:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-18 20:06:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:48,992 INFO L225 Difference]: With dead ends: 462 [2022-11-18 20:06:48,992 INFO L226 Difference]: Without dead ends: 243 [2022-11-18 20:06:48,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:06:48,994 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 54 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:48,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 886 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:06:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-18 20:06:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2022-11-18 20:06:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 238 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions. [2022-11-18 20:06:49,012 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 27 [2022-11-18 20:06:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:49,012 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions. [2022-11-18 20:06:49,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions. [2022-11-18 20:06:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:06:49,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:49,014 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:49,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:49,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:49,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -895020851, now seen corresponding path program 1 times [2022-11-18 20:06:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:49,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715193381] [2022-11-18 20:06:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:06:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715193381] [2022-11-18 20:06:49,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715193381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:49,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:49,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:06:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599580670] [2022-11-18 20:06:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:49,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:06:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:49,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:06:49,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:06:49,298 INFO L87 Difference]: Start difference. First operand 239 states and 387 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:49,332 INFO L93 Difference]: Finished difference Result 447 states and 721 transitions. [2022-11-18 20:06:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:06:49,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-18 20:06:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:49,335 INFO L225 Difference]: With dead ends: 447 [2022-11-18 20:06:49,336 INFO L226 Difference]: Without dead ends: 211 [2022-11-18 20:06:49,336 INFO L412 NwaCegarLoop]: 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 [2022-11-18 20:06:49,337 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 70 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:49,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-18 20:06:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-11-18 20:06:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5769230769230769) internal successors, (328), 208 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2022-11-18 20:06:49,345 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 34 [2022-11-18 20:06:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:49,346 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2022-11-18 20:06:49,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2022-11-18 20:06:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:06:49,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:49,350 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:49,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:06:49,351 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2022-11-18 20:06:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418530688] [2022-11-18 20:06:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418530688] [2022-11-18 20:06:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418530688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813793828] [2022-11-18 20:06:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:49,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:49,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:49,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:06:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:49,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:06:49,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:49,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:50,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813793828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:50,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:50,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-18 20:06:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361591243] [2022-11-18 20:06:50,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:50,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:06:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:06:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:06:50,128 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:50,822 INFO L93 Difference]: Finished difference Result 673 states and 1050 transitions. [2022-11-18 20:06:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:06:50,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-18 20:06:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:50,825 INFO L225 Difference]: With dead ends: 673 [2022-11-18 20:06:50,825 INFO L226 Difference]: Without dead ends: 438 [2022-11-18 20:06:50,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:06:50,826 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 523 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:50,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 851 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:06:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-18 20:06:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 400. [2022-11-18 20:06:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.5488721804511278) internal successors, (618), 399 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 618 transitions. [2022-11-18 20:06:50,848 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 618 transitions. Word has length 37 [2022-11-18 20:06:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:50,850 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 618 transitions. [2022-11-18 20:06:50,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 618 transitions. [2022-11-18 20:06:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 20:06:50,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:50,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:50,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:51,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:51,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2022-11-18 20:06:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:51,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511802150] [2022-11-18 20:06:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:06:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:51,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511802150] [2022-11-18 20:06:51,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511802150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:51,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007805973] [2022-11-18 20:06:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:51,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:51,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:51,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:06:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:51,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:06:51,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:06:51,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:06:51,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007805973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:51,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-18 20:06:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515502308] [2022-11-18 20:06:51,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:51,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:06:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:51,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:06:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:06:51,431 INFO L87 Difference]: Start difference. First operand 400 states and 618 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:51,539 INFO L93 Difference]: Finished difference Result 415 states and 631 transitions. [2022-11-18 20:06:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:06:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-18 20:06:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:51,544 INFO L225 Difference]: With dead ends: 415 [2022-11-18 20:06:51,544 INFO L226 Difference]: Without dead ends: 403 [2022-11-18 20:06:51,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:06:51,546 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 222 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:51,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 437 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:06:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-18 20:06:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2022-11-18 20:06:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.518796992481203) internal successors, (606), 399 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 606 transitions. [2022-11-18 20:06:51,565 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 606 transitions. Word has length 38 [2022-11-18 20:06:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:51,566 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 606 transitions. [2022-11-18 20:06:51,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2022-11-18 20:06:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:06:51,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:51,568 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:51,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 20:06:51,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:06:51,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2022-11-18 20:06:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:51,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207831810] [2022-11-18 20:06:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207831810] [2022-11-18 20:06:52,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207831810] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324714835] [2022-11-18 20:06:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:52,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:52,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:06:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:52,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:06:52,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:52,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:53,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324714835] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:53,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:53,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-18 20:06:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431496010] [2022-11-18 20:06:53,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:53,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:06:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:06:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:06:53,021 INFO L87 Difference]: Start difference. First operand 400 states and 606 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:53,233 INFO L93 Difference]: Finished difference Result 412 states and 615 transitions. [2022-11-18 20:06:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:06:53,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-18 20:06:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:53,236 INFO L225 Difference]: With dead ends: 412 [2022-11-18 20:06:53,236 INFO L226 Difference]: Without dead ends: 410 [2022-11-18 20:06:53,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:06:53,237 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:53,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 659 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:06:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-18 20:06:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 401. [2022-11-18 20:06:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.5175) internal successors, (607), 400 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 607 transitions. [2022-11-18 20:06:53,254 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 607 transitions. Word has length 40 [2022-11-18 20:06:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:53,255 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 607 transitions. [2022-11-18 20:06:53,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 607 transitions. [2022-11-18 20:06:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:06:53,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:53,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:53,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:53,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:53,462 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2022-11-18 20:06:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:53,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515788404] [2022-11-18 20:06:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:06:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:53,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515788404] [2022-11-18 20:06:53,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515788404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:53,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:53,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:06:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844606574] [2022-11-18 20:06:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:53,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:06:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:06:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:06:53,506 INFO L87 Difference]: Start difference. First operand 401 states and 607 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:53,544 INFO L93 Difference]: Finished difference Result 756 states and 1142 transitions. [2022-11-18 20:06:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:06:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-18 20:06:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:53,547 INFO L225 Difference]: With dead ends: 756 [2022-11-18 20:06:53,547 INFO L226 Difference]: Without dead ends: 400 [2022-11-18 20:06:53,548 INFO L412 NwaCegarLoop]: 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 [2022-11-18 20:06:53,548 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:53,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-18 20:06:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2022-11-18 20:06:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.4836272040302267) internal successors, (589), 397 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 589 transitions. [2022-11-18 20:06:53,565 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 589 transitions. Word has length 41 [2022-11-18 20:06:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:53,565 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 589 transitions. [2022-11-18 20:06:53,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 589 transitions. [2022-11-18 20:06:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-18 20:06:53,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:53,566 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:53,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:06:53,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1798904348, now seen corresponding path program 1 times [2022-11-18 20:06:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:53,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918398839] [2022-11-18 20:06:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:53,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-18 20:06:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918398839] [2022-11-18 20:06:53,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918398839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:53,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:53,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:06:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234661667] [2022-11-18 20:06:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:53,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:06:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:06:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:06:53,628 INFO L87 Difference]: Start difference. First operand 398 states and 589 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:53,670 INFO L93 Difference]: Finished difference Result 566 states and 838 transitions. [2022-11-18 20:06:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:06:53,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-18 20:06:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:53,672 INFO L225 Difference]: With dead ends: 566 [2022-11-18 20:06:53,672 INFO L226 Difference]: Without dead ends: 233 [2022-11-18 20:06:53,672 INFO L412 NwaCegarLoop]: 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 [2022-11-18 20:06:53,673 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:53,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-18 20:06:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-11-18 20:06:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4478260869565218) internal successors, (333), 230 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 333 transitions. [2022-11-18 20:06:53,683 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 333 transitions. Word has length 53 [2022-11-18 20:06:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:53,683 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 333 transitions. [2022-11-18 20:06:53,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2022-11-18 20:06:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:06:53,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:53,684 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:53,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:06:53,685 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:53,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1723595032, now seen corresponding path program 1 times [2022-11-18 20:06:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:53,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388665554] [2022-11-18 20:06:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388665554] [2022-11-18 20:06:53,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388665554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309086411] [2022-11-18 20:06:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:53,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:53,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:06:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:54,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:06:54,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:54,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:06:54,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309086411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:54,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:06:54,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-18 20:06:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063264586] [2022-11-18 20:06:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:54,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:06:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:06:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:06:54,116 INFO L87 Difference]: Start difference. First operand 231 states and 333 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:54,207 INFO L93 Difference]: Finished difference Result 317 states and 455 transitions. [2022-11-18 20:06:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:06:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-18 20:06:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:54,209 INFO L225 Difference]: With dead ends: 317 [2022-11-18 20:06:54,210 INFO L226 Difference]: Without dead ends: 313 [2022-11-18 20:06:54,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:06:54,211 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 198 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:54,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 427 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:06:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-18 20:06:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2022-11-18 20:06:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4545454545454546) internal successors, (448), 308 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 448 transitions. [2022-11-18 20:06:54,225 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 448 transitions. Word has length 55 [2022-11-18 20:06:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:54,225 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 448 transitions. [2022-11-18 20:06:54,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 448 transitions. [2022-11-18 20:06:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:06:54,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:54,226 INFO L195 NwaCegarLoop]: 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] [2022-11-18 20:06:54,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:06:54,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:06:54,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1291508586, now seen corresponding path program 1 times [2022-11-18 20:06:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:54,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765238163] [2022-11-18 20:06:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:54,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765238163] [2022-11-18 20:06:54,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765238163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:54,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799037700] [2022-11-18 20:06:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:54,560 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:54,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:06:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:54,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:06:54,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:54,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:06:54,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799037700] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:54,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:54,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-18 20:06:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157356072] [2022-11-18 20:06:54,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:54,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:06:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:06:54,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:06:54,840 INFO L87 Difference]: Start difference. First operand 309 states and 448 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:55,021 INFO L93 Difference]: Finished difference Result 810 states and 1182 transitions. [2022-11-18 20:06:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:06:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-18 20:06:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:55,024 INFO L225 Difference]: With dead ends: 810 [2022-11-18 20:06:55,024 INFO L226 Difference]: Without dead ends: 643 [2022-11-18 20:06:55,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:06:55,028 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 603 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:55,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 688 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:06:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-18 20:06:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 628. [2022-11-18 20:06:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4290271132376395) internal successors, (896), 627 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 896 transitions. [2022-11-18 20:06:55,060 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 896 transitions. Word has length 55 [2022-11-18 20:06:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:55,060 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 896 transitions. [2022-11-18 20:06:55,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 896 transitions. [2022-11-18 20:06:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:06:55,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:55,062 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:55,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:55,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:55,268 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2022-11-18 20:06:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:55,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658101631] [2022-11-18 20:06:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:55,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658101631] [2022-11-18 20:06:55,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658101631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:55,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016131448] [2022-11-18 20:06:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:55,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:55,666 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:55,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:06:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:55,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:06:55,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:56,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:56,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016131448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:56,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:56,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-18 20:06:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057687224] [2022-11-18 20:06:56,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:56,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:06:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:06:56,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:06:56,415 INFO L87 Difference]: Start difference. First operand 628 states and 896 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:56,606 INFO L93 Difference]: Finished difference Result 634 states and 899 transitions. [2022-11-18 20:06:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:06:56,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-18 20:06:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:56,609 INFO L225 Difference]: With dead ends: 634 [2022-11-18 20:06:56,610 INFO L226 Difference]: Without dead ends: 632 [2022-11-18 20:06:56,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:06:56,611 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:56,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1057 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:06:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-18 20:06:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2022-11-18 20:06:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4242424242424243) internal successors, (893), 627 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 893 transitions. [2022-11-18 20:06:56,640 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 893 transitions. Word has length 56 [2022-11-18 20:06:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:56,640 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 893 transitions. [2022-11-18 20:06:56,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 893 transitions. [2022-11-18 20:06:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 20:06:56,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:56,641 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:56,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 20:06:56,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:06:56,847 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2022-11-18 20:06:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075969611] [2022-11-18 20:06:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075969611] [2022-11-18 20:06:57,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075969611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:57,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031356721] [2022-11-18 20:06:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:57,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:57,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:57,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:06:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:57,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:06:57,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:57,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:06:58,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031356721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:58,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:58,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2022-11-18 20:06:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185383379] [2022-11-18 20:06:58,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:58,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:06:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:06:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:06:58,341 INFO L87 Difference]: Start difference. First operand 628 states and 893 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:58,836 INFO L93 Difference]: Finished difference Result 638 states and 898 transitions. [2022-11-18 20:06:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:06:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-18 20:06:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:58,839 INFO L225 Difference]: With dead ends: 638 [2022-11-18 20:06:58,840 INFO L226 Difference]: Without dead ends: 636 [2022-11-18 20:06:58,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:06:58,841 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 281 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:58,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1795 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:06:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-11-18 20:06:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 628. [2022-11-18 20:06:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4066985645933014) internal successors, (882), 627 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 882 transitions. [2022-11-18 20:06:58,871 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 882 transitions. Word has length 63 [2022-11-18 20:06:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:58,871 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 882 transitions. [2022-11-18 20:06:58,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:06:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 882 transitions. [2022-11-18 20:06:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:06:58,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:58,873 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:58,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:59,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:06:59,079 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2022-11-18 20:06:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:59,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799138498] [2022-11-18 20:06:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:06:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799138498] [2022-11-18 20:06:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799138498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:59,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065615730] [2022-11-18 20:06:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:59,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:59,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:59,944 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:59,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:07:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:00,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:07:00,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:00,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:01,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065615730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:01,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:01,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-11-18 20:07:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454177735] [2022-11-18 20:07:01,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:01,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:07:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:07:01,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:07:01,311 INFO L87 Difference]: Start difference. First operand 628 states and 882 transitions. Second operand has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 21 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:01,678 INFO L93 Difference]: Finished difference Result 634 states and 885 transitions. [2022-11-18 20:07:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:07:01,678 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 21 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-11-18 20:07:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:01,681 INFO L225 Difference]: With dead ends: 634 [2022-11-18 20:07:01,681 INFO L226 Difference]: Without dead ends: 632 [2022-11-18 20:07:01,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:07:01,682 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 376 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:01,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 2045 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:07:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-18 20:07:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2022-11-18 20:07:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4035087719298245) internal successors, (880), 627 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 880 transitions. [2022-11-18 20:07:01,713 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 880 transitions. Word has length 86 [2022-11-18 20:07:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:01,713 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 880 transitions. [2022-11-18 20:07:01,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 21 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 880 transitions. [2022-11-18 20:07:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 20:07:01,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:01,719 INFO L195 NwaCegarLoop]: 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:01,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:01,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:07:01,925 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -520376012, now seen corresponding path program 1 times [2022-11-18 20:07:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:01,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368386335] [2022-11-18 20:07:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:07:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368386335] [2022-11-18 20:07:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368386335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:07:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152627106] [2022-11-18 20:07:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:02,380 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:07:02,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:07:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:02,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:07:02,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:07:02,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:07:03,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152627106] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:03,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:03,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-11-18 20:07:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413036004] [2022-11-18 20:07:03,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:07:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:07:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:07:03,065 INFO L87 Difference]: Start difference. First operand 628 states and 880 transitions. Second operand has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:03,389 INFO L93 Difference]: Finished difference Result 1687 states and 2348 transitions. [2022-11-18 20:07:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:07:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-11-18 20:07:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:03,395 INFO L225 Difference]: With dead ends: 1687 [2022-11-18 20:07:03,395 INFO L226 Difference]: Without dead ends: 1323 [2022-11-18 20:07:03,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:07:03,397 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 1489 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:03,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1242 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:07:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-11-18 20:07:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1252. [2022-11-18 20:07:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.4036770583533174) internal successors, (1756), 1251 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1756 transitions. [2022-11-18 20:07:03,458 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1756 transitions. Word has length 147 [2022-11-18 20:07:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:03,459 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1756 transitions. [2022-11-18 20:07:03,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1756 transitions. [2022-11-18 20:07:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-18 20:07:03,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:03,461 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:03,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:03,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:03,668 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 1 times [2022-11-18 20:07:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:03,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220439524] [2022-11-18 20:07:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-18 20:07:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220439524] [2022-11-18 20:07:04,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220439524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:07:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871733901] [2022-11-18 20:07:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:04,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:07:04,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:07:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:05,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:07:05,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:05,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 142 proven. 311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:07,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871733901] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:07,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:07,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 33 [2022-11-18 20:07:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791311154] [2022-11-18 20:07:07,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:07,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 20:07:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 20:07:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 20:07:07,170 INFO L87 Difference]: Start difference. First operand 1252 states and 1756 transitions. Second operand has 33 states, 33 states have (on average 11.757575757575758) internal successors, (388), 33 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:07,976 INFO L93 Difference]: Finished difference Result 1256 states and 1758 transitions. [2022-11-18 20:07:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:07:07,977 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 11.757575757575758) internal successors, (388), 33 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-11-18 20:07:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:07,982 INFO L225 Difference]: With dead ends: 1256 [2022-11-18 20:07:07,982 INFO L226 Difference]: Without dead ends: 1254 [2022-11-18 20:07:07,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2022-11-18 20:07:07,983 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 556 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 5329 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:07,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 5329 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:07:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-11-18 20:07:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2022-11-18 20:07:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.3996802557953638) internal successors, (1751), 1251 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1751 transitions. [2022-11-18 20:07:08,037 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1751 transitions. Word has length 148 [2022-11-18 20:07:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:08,037 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1751 transitions. [2022-11-18 20:07:08,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 11.757575757575758) internal successors, (388), 33 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1751 transitions. [2022-11-18 20:07:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-11-18 20:07:08,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:08,043 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:08,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:08,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:08,250 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:08,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -691826832, now seen corresponding path program 2 times [2022-11-18 20:07:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:08,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679794002] [2022-11-18 20:07:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:07:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679794002] [2022-11-18 20:07:10,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679794002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:07:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976395643] [2022-11-18 20:07:10,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:07:10,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:10,106 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:07:10,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:07:10,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:07:10,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:07:10,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:07:10,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:07:11,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:07:11,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976395643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:11,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:11,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20 [2022-11-18 20:07:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263683709] [2022-11-18 20:07:11,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:11,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:07:11,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:11,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:07:11,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:07:11,749 INFO L87 Difference]: Start difference. First operand 1252 states and 1751 transitions. Second operand has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:12,140 INFO L93 Difference]: Finished difference Result 2222 states and 3089 transitions. [2022-11-18 20:07:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:07:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2022-11-18 20:07:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:12,146 INFO L225 Difference]: With dead ends: 2222 [2022-11-18 20:07:12,147 INFO L226 Difference]: Without dead ends: 1546 [2022-11-18 20:07:12,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 647 SyntacticMatches, 25 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:07:12,149 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 1911 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:12,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1911 Valid, 1434 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:07:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-11-18 20:07:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1486. [2022-11-18 20:07:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 1.3986531986531987) internal successors, (2077), 1485 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2077 transitions. [2022-11-18 20:07:12,219 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2077 transitions. Word has length 331 [2022-11-18 20:07:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:12,220 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 2077 transitions. [2022-11-18 20:07:12,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2077 transitions. [2022-11-18 20:07:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-11-18 20:07:12,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:12,227 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:12,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:12,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:07:12,444 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 1 times [2022-11-18 20:07:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:12,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721404740] [2022-11-18 20:07:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:07:13,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:07:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:07:15,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:07:15,189 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:07:15,191 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:07:15,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:07:15,198 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:15,203 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:07:15,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:07:15 BoogieIcfgContainer [2022-11-18 20:07:15,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:07:15,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:07:15,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:07:15,443 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:07:15,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:06:45" (3/4) ... [2022-11-18 20:07:15,445 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:07:15,720 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:07:15,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:07:15,721 INFO L158 Benchmark]: Toolchain (without parser) took 31792.49ms. Allocated memory was 136.3MB in the beginning and 423.6MB in the end (delta: 287.3MB). Free memory was 101.1MB in the beginning and 359.0MB in the end (delta: -257.8MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,722 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory was 59.3MB in the beginning and 59.2MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:07:15,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.26ms. Allocated memory is still 136.3MB. Free memory was 100.9MB in the beginning and 104.2MB in the end (delta: -3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.13ms. Allocated memory is still 136.3MB. Free memory was 104.2MB in the beginning and 99.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,723 INFO L158 Benchmark]: Boogie Preprocessor took 46.75ms. Allocated memory is still 136.3MB. Free memory was 99.4MB in the beginning and 96.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,723 INFO L158 Benchmark]: RCFGBuilder took 1002.01ms. Allocated memory is still 136.3MB. Free memory was 96.6MB in the beginning and 55.3MB in the end (delta: 41.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,724 INFO L158 Benchmark]: TraceAbstraction took 29901.11ms. Allocated memory was 136.3MB in the beginning and 423.6MB in the end (delta: 287.3MB). Free memory was 54.7MB in the beginning and 151.3MB in the end (delta: -96.7MB). Peak memory consumption was 194.4MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,727 INFO L158 Benchmark]: Witness Printer took 277.58ms. Allocated memory is still 423.6MB. Free memory was 151.3MB in the beginning and 359.0MB in the end (delta: -207.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:07:15,734 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory was 59.3MB in the beginning and 59.2MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.26ms. Allocated memory is still 136.3MB. Free memory was 100.9MB in the beginning and 104.2MB in the end (delta: -3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.13ms. Allocated memory is still 136.3MB. Free memory was 104.2MB in the beginning and 99.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.75ms. Allocated memory is still 136.3MB. Free memory was 99.4MB in the beginning and 96.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1002.01ms. Allocated memory is still 136.3MB. Free memory was 96.6MB in the beginning and 55.3MB in the end (delta: 41.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29901.11ms. Allocated memory was 136.3MB in the beginning and 423.6MB in the end (delta: 287.3MB). Free memory was 54.7MB in the beginning and 151.3MB in the end (delta: -96.7MB). Peak memory consumption was 194.4MB. Max. memory is 16.1GB. * Witness Printer took 277.58ms. Allocated memory is still 423.6MB. Free memory was 151.3MB in the beginning and 359.0MB in the end (delta: -207.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L13] int m_recv_ack_1_2 = 7; [L12] int m_recv_ack_1_1 = 6; [L11] int m_msg_1_2 = 5; [L8] int m_msg_2 = 2; [L10] int m_msg_1_1 = 4; [L9] int m_recv_ack_2 = 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] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] 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] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=4, P2=0, P3=0, P4=0, P5=0, P6=-3, P7=-4, P8=0, P9=5, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] 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=4, P2=0, P3=0, P4=0, P5=0, P6=-3, P7=-4, P8=0, P9=5, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] 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=4, P2=0, P3=0, P4=0, P5=0, P6=-3, P7=-4, P8=0, P9=5, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=60, P2=0, P3=0, P4=0, P5=0, P6=-5, P7=6, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L45] 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=60, P2=0, P3=0, P4=0, P5=0, P6=-5, P7=6, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=60, P2=0, P3=0, P4=0, P5=0, P6=-5, P7=6, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=60, P2=0, P3=0, P4=0, P5=0, P6=-5, P7=6, P8=0, P9=-6, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=-1, P4=0, P5=0, P6=7, P7=-7, P8=0, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L45] 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=0, P3=-1, P4=0, P5=0, P6=7, P7=-7, P8=0, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L65] 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=0, P3=-1, P4=0, P5=0, P6=7, P7=-7, P8=0, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L165] 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=0, P3=-1, P4=0, P5=0, P6=7, P7=-7, P8=0, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=-1, P4=0, P5=0, P6=7, P7=-7, P8=0, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=-1, P4=0, P5=0, P6=7, P7=-7, P8=0, P9=8, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L45] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L65] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L165] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L265] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=53, P2=0, P3=0, P4=0, P5=0, P6=70, P7=-8, P8=0, P9=9, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L45] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L65] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L165] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L265] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L365] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=5, this_buffer_empty=0, this_expect=2] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=-9, P7=10, P8=0, P9=-53, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=56, P2=0, P3=0, P4=0, P5=0, P6=-10, P7=11, P8=0, P9=-11, q=1, this_buffer_empty=1, this_expect=2] [L45] 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=56, P2=0, P3=0, P4=0, P5=0, P6=-10, P7=11, P8=0, P9=-11, q=1, this_buffer_empty=1, this_expect=2] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=56, P2=0, P3=0, P4=0, P5=0, P6=-10, P7=11, P8=0, P9=-11, q=1, this_buffer_empty=1, this_expect=2] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=56, P2=0, P3=0, P4=0, P5=0, P6=-10, P7=11, P8=0, P9=-11, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-12, P7=13, P8=0, P9=-13, q=3, this_buffer_empty=0, this_expect=3] [L45] 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=0, P3=0, P4=0, P5=0, P6=-12, P7=13, P8=0, P9=-13, q=3, this_buffer_empty=0, this_expect=3] [L65] 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=0, P3=0, P4=0, P5=0, P6=-12, P7=13, P8=0, P9=-13, q=3, this_buffer_empty=0, this_expect=3] [L165] 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=0, P3=0, P4=0, P5=0, P6=-12, P7=13, P8=0, P9=-13, q=3, this_buffer_empty=0, this_expect=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=0, P4=0, P5=0, P6=-12, P7=13, P8=0, P9=-13, q=3, this_buffer_empty=0, this_expect=3] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=0, P4=0, P5=0, P6=-12, P7=13, P8=0, P9=-13, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=4, this_buffer_empty=1, this_expect=3] [L45] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=4, this_buffer_empty=1, this_expect=3] [L65] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=4, this_buffer_empty=1, this_expect=3] [L165] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=4, this_buffer_empty=1, this_expect=3] [L265] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=4, this_buffer_empty=1, this_expect=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=4, this_buffer_empty=1, this_expect=3] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=55, P2=0, P3=0, P4=0, P5=0, P6=71, P7=14, P8=0, P9=-14, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L45] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L65] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L165] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L265] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L365] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=4] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=15, P7=-15, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=62, P2=0, P3=0, P4=0, P5=0, P6=-16, P7=17, P8=0, P9=-17, q=1, this_buffer_empty=1, this_expect=4] [L45] 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=62, P2=0, P3=0, P4=0, P5=0, P6=-16, P7=17, P8=0, P9=-17, q=1, this_buffer_empty=1, this_expect=4] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=62, P2=0, P3=0, P4=0, P5=0, P6=-16, P7=17, P8=0, P9=-17, q=1, this_buffer_empty=1, this_expect=4] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=62, P2=0, P3=0, P4=0, P5=0, P6=-16, P7=17, P8=0, P9=-17, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=18, P7=-18, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=5] [L45] 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=0, P3=0, P4=0, P5=0, P6=18, P7=-18, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=5] [L65] 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=0, P3=0, P4=0, P5=0, P6=18, P7=-18, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=5] [L165] 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=0, P3=0, P4=0, P5=0, P6=18, P7=-18, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=5] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=0, P4=0, P5=0, P6=18, P7=-18, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=5] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=0, P4=0, P5=0, P6=18, P7=-18, P8=0, P9=19, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L45] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L65] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L165] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L265] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=57, P2=0, P3=0, P4=0, P5=0, P6=-21, P7=-19, P8=0, P9=20, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L45] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L65] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L165] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L265] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L365] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=-20, P7=21, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=-52, P2=0, P3=0, P4=0, P5=0, P6=22, P7=-22, P8=0, P9=23, q=1, this_buffer_empty=1, this_expect=6] [L45] 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=-52, P2=0, P3=0, P4=0, P5=0, P6=22, P7=-22, P8=0, P9=23, q=1, this_buffer_empty=1, this_expect=6] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=-52, P2=0, P3=0, P4=0, P5=0, P6=22, P7=-22, P8=0, P9=23, q=1, this_buffer_empty=1, this_expect=6] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=-52, P2=0, P3=0, P4=0, P5=0, P6=22, P7=-22, P8=0, P9=23, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-23, P7=24, P8=0, P9=-24, q=3, this_buffer_empty=0, this_expect=7] [L45] 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=0, P3=0, P4=0, P5=0, P6=-23, P7=24, P8=0, P9=-24, q=3, this_buffer_empty=0, this_expect=7] [L65] 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=0, P3=0, P4=0, P5=0, P6=-23, P7=24, P8=0, P9=-24, q=3, this_buffer_empty=0, this_expect=7] [L165] 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=0, P3=0, P4=0, P5=0, P6=-23, P7=24, P8=0, P9=-24, q=3, this_buffer_empty=0, this_expect=7] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=0, P4=0, P5=0, P6=-23, P7=24, P8=0, P9=-24, q=3, this_buffer_empty=0, this_expect=7] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=0, P4=0, P5=0, P6=-23, P7=24, P8=0, P9=-24, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L45] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L65] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L165] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L265] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=59, P2=0, P3=0, P4=0, P5=0, P6=73, P7=25, P8=0, P9=-25, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L45] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L65] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L165] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L265] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L365] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=-54, P2=0, P3=0, P4=0, P5=0, P6=27, P7=-27, P8=0, P9=28, q=1, this_buffer_empty=1, this_expect=8] [L45] 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=-54, P2=0, P3=0, P4=0, P5=0, P6=27, P7=-27, P8=0, P9=28, q=1, this_buffer_empty=1, this_expect=8] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=-54, P2=0, P3=0, P4=0, P5=0, P6=27, P7=-27, P8=0, P9=28, q=1, this_buffer_empty=1, this_expect=8] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=-54, P2=0, P3=0, P4=0, P5=0, P6=27, P7=-27, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-28, P7=29, P8=0, P9=-29, q=3, this_buffer_empty=0, this_expect=9] [L45] 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=0, P3=0, P4=0, P5=0, P6=-28, P7=29, P8=0, P9=-29, q=3, this_buffer_empty=0, this_expect=9] [L65] 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=0, P3=0, P4=0, P5=0, P6=-28, P7=29, P8=0, P9=-29, q=3, this_buffer_empty=0, this_expect=9] [L165] 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=0, P3=0, P4=0, P5=0, P6=-28, P7=29, P8=0, P9=-29, q=3, this_buffer_empty=0, this_expect=9] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=0, P4=0, P5=0, P6=-28, P7=29, P8=0, P9=-29, q=3, this_buffer_empty=0, this_expect=9] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=0, P4=0, P5=0, P6=-28, P7=29, P8=0, P9=-29, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=9] [L45] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=9] [L65] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=9] [L165] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=9] [L265] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=9] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=9] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=61, P2=0, P3=0, P4=0, P5=0, P6=31, P7=30, P8=0, P9=-30, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L45] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L65] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L165] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L265] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L365] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=-31, P7=32, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-32, P7=33, P8=0, P9=-33, q=1, this_buffer_empty=1, this_expect=10] [L45] 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=0, P3=0, P4=0, P5=0, P6=-32, P7=33, P8=0, P9=-33, q=1, this_buffer_empty=1, this_expect=10] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=0, P3=0, P4=0, P5=0, P6=-32, P7=33, P8=0, P9=-33, q=1, this_buffer_empty=1, this_expect=10] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=0, P3=0, P4=0, P5=0, P6=-32, P7=33, P8=0, P9=-33, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=1, P4=0, P5=0, P6=34, P7=-34, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=11] [L45] 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=0, P3=1, P4=0, P5=0, P6=34, P7=-34, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=11] [L65] 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=0, P3=1, P4=0, P5=0, P6=34, P7=-34, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=11] [L165] 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=0, P3=1, P4=0, P5=0, P6=34, P7=-34, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=11] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=1, P4=0, P5=0, P6=34, P7=-34, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=11] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=1, P4=0, P5=0, P6=34, P7=-34, P8=0, P9=35, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=4, this_buffer_empty=1, this_expect=11] [L45] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=4, this_buffer_empty=1, this_expect=11] [L65] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=4, this_buffer_empty=1, this_expect=11] [L165] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=4, this_buffer_empty=1, this_expect=11] [L265] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=4, this_buffer_empty=1, this_expect=11] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=4, this_buffer_empty=1, this_expect=11] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=-35, P8=0, P9=36, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L45] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L65] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L165] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L265] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L365] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=37, P7=-37, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=40, P2=0, P3=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, q=1, this_buffer_empty=1, this_expect=12] [L45] 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=40, P2=0, P3=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, q=1, this_buffer_empty=1, this_expect=12] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=40, P2=0, P3=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, q=1, this_buffer_empty=1, this_expect=12] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=40, P2=0, P3=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=1, P4=0, P5=0, P6=-39, P7=-40, P8=0, P9=41, q=3, this_buffer_empty=0, this_expect=13] [L45] 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=0, P3=1, P4=0, P5=0, P6=-39, P7=-40, P8=0, P9=41, q=3, this_buffer_empty=0, this_expect=13] [L65] 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=0, P3=1, P4=0, P5=0, P6=-39, P7=-40, P8=0, P9=41, q=3, this_buffer_empty=0, this_expect=13] [L165] 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=0, P3=1, P4=0, P5=0, P6=-39, P7=-40, P8=0, P9=41, q=3, this_buffer_empty=0, this_expect=13] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=1, P4=0, P5=0, P6=-39, P7=-40, P8=0, P9=41, q=3, this_buffer_empty=0, this_expect=13] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=1, P4=0, P5=0, P6=-39, P7=-40, P8=0, P9=41, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=4, this_buffer_empty=1, this_expect=13] [L45] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=4, this_buffer_empty=1, this_expect=13] [L65] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=4, this_buffer_empty=1, this_expect=13] [L165] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=4, this_buffer_empty=1, this_expect=13] [L265] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=4, this_buffer_empty=1, this_expect=13] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=4, this_buffer_empty=1, this_expect=13] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=65, P2=0, P3=0, P4=0, P5=0, P6=-43, P7=-41, P8=0, P9=42, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L45] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L65] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L165] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L265] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L365] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=5, this_buffer_empty=0, this_expect=14] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=-42, P7=43, P8=0, P9=54, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=58, P2=0, P3=0, P4=0, P5=0, P6=44, P7=-44, P8=0, P9=45, q=1, this_buffer_empty=1, this_expect=14] [L45] 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=58, P2=0, P3=0, P4=0, P5=0, P6=44, P7=-44, P8=0, P9=45, q=1, this_buffer_empty=1, this_expect=14] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=58, P2=0, P3=0, P4=0, P5=0, P6=44, P7=-44, P8=0, P9=45, q=1, this_buffer_empty=1, this_expect=14] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=58, P2=0, P3=0, P4=0, P5=0, P6=44, P7=-44, P8=0, P9=45, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-45, P7=46, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=15] [L45] 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=0, P3=0, P4=0, P5=0, P6=-45, P7=46, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=15] [L65] 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=0, P3=0, P4=0, P5=0, P6=-45, P7=46, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=15] [L165] 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=0, P3=0, P4=0, P5=0, P6=-45, P7=46, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=15] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=0, P4=0, P5=0, P6=-45, P7=46, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=15] [L288] 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))))) [L292] q = 4 [L294] this_expect=this_expect [L294] 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=0, P3=0, P4=0, P5=0, P6=-45, P7=46, P8=0, P9=-46, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=4, this_buffer_empty=1, this_expect=15] [L45] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=4, this_buffer_empty=1, this_expect=15] [L65] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=4, this_buffer_empty=1, this_expect=15] [L165] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=4, this_buffer_empty=1, this_expect=15] [L265] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=4, this_buffer_empty=1, this_expect=15] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=4, this_buffer_empty=1, this_expect=15] [L420] 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))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] 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=67, P2=0, P3=0, P4=0, P5=0, P6=75, P7=47, P8=0, P9=-47, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L45] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L65] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L165] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L265] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L365] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L552] 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))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] 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=0, P3=0, P4=0, P5=0, P6=-48, P7=49, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] 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=64, P2=0, P3=0, P4=0, P5=0, P6=-49, P7=50, P8=0, P9=-50, q=1, this_buffer_empty=1, this_expect=16] [L45] 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=64, P2=0, P3=0, P4=0, P5=0, P6=-49, P7=50, P8=0, P9=-50, q=1, this_buffer_empty=1, this_expect=16] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] 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=64, P2=0, P3=0, P4=0, P5=0, P6=-49, P7=50, P8=0, P9=-50, q=1, this_buffer_empty=1, this_expect=16] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] 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=64, P2=0, P3=0, P4=0, P5=0, P6=-49, P7=50, P8=0, P9=-50, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] 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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] [L45] 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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] [L65] 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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] [L165] 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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] 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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] [L288] 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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_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=0, P3=0, P4=0, P5=0, P6=51, P7=-51, P8=0, P9=52, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 22, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7254 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7254 mSDsluCounter, 19761 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15786 mSDsCounter, 522 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3074 IncrementalHoareTripleChecker+Invalid, 3596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 522 mSolverCounterUnsat, 3975 mSDtfsCounter, 3074 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2299 GetRequests, 2097 SyntacticMatches, 44 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1486occurred in iteration=21, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 268 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2821 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3434 ConstructedInterpolants, 0 QuantifiedInterpolants, 19770 SizeOfPredicates, 29 NumberOfNonLiveVariables, 6967 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 46 InterpolantComputations, 9 PerfectInterpolantSequences, 2061/11697 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:07:15,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8206c0f-0c88-4d52-a473-379f7bcc6002/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE