./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-3.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_abp_1-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:07:23,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:07:23,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:07:24,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:07:24,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:07:24,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:07:24,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:07:24,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:07:24,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:07:24,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:07:24,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:07:24,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:07:24,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:07:24,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:07:24,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:07:24,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:07:24,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:07:24,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:07:24,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:07:24,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:07:24,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:07:24,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:07:24,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:07:24,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:07:24,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:07:24,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:07:24,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:07:24,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:07:24,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:07:24,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:07:24,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:07:24,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:07:24,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:07:24,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:07:24,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:07:24,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:07:24,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:07:24,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:07:24,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:07:24,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:07:24,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:07:24,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:07:24,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:07:24,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:07:24,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:07:24,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:07:24,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:07:24,059 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:07:24,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:07:24,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:07:24,060 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:07:24,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:07:24,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:07:24,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:07:24,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:07:24,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:07:24,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:07:24,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:07:24,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:07:24,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:07:24,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:07:24,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:07:24,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:07:24,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:07:24,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:07:24,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:07:24,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:07:24,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:07:24,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:07:24,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:07:24,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:07:24,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:07:24,065 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:07:24,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:07:24,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:07:24,065 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc [2022-02-20 16:07:24,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:07:24,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:07:24,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:07:24,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:07:24,288 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:07:24,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2022-02-20 16:07:24,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eff0a9fba/0d401efb2f9c47e7b52d2f6c05ced784/FLAGc5143a822 [2022-02-20 16:07:24,737 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:07:24,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2022-02-20 16:07:24,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eff0a9fba/0d401efb2f9c47e7b52d2f6c05ced784/FLAGc5143a822 [2022-02-20 16:07:25,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eff0a9fba/0d401efb2f9c47e7b52d2f6c05ced784 [2022-02-20 16:07:25,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:07:25,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:07:25,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:07:25,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:07:25,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:07:25,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484a3f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25, skipping insertion in model container [2022-02-20 16:07:25,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:07:25,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:07:25,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c[24720,24733] [2022-02-20 16:07:25,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:07:25,446 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:07:25,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c[24720,24733] [2022-02-20 16:07:25,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:07:25,549 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:07:25,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25 WrapperNode [2022-02-20 16:07:25,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:07:25,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:07:25,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:07:25,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:07:25,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,642 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 415 [2022-02-20 16:07:25,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:07:25,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:07:25,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:07:25,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:07:25,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:07:25,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:07:25,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:07:25,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:07:25,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (1/1) ... [2022-02-20 16:07:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:07:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:07:25,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:07:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:07:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:07:25,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:07:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:07:25,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:07:25,857 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:07:25,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:07:26,682 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:07:26,689 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:07:26,689 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:07:26,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:07:26 BoogieIcfgContainer [2022-02-20 16:07:26,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:07:26,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:07:26,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:07:26,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:07:26,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:07:25" (1/3) ... [2022-02-20 16:07:26,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177643b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:07:26, skipping insertion in model container [2022-02-20 16:07:26,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:25" (2/3) ... [2022-02-20 16:07:26,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177643b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:07:26, skipping insertion in model container [2022-02-20 16:07:26,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:07:26" (3/3) ... [2022-02-20 16:07:26,704 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2022-02-20 16:07:26,708 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:07:26,708 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:07:26,746 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:07:26,752 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:07:26,752 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:07:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 107 states have (on average 1.9532710280373833) internal successors, (209), 108 states have internal predecessors, (209), 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-02-20 16:07:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:07:26,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:26,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:26,781 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2022-02-20 16:07:26,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:26,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826288457] [2022-02-20 16:07:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:26,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:26,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {112#true} is VALID [2022-02-20 16:07:26,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {112#true} is VALID [2022-02-20 16:07:26,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} goto; {112#true} is VALID [2022-02-20 16:07:26,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {112#true} is VALID [2022-02-20 16:07:26,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {112#true} is VALID [2022-02-20 16:07:26,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {112#true} is VALID [2022-02-20 16:07:26,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#true} main_~method_id~0#1 := 1; {112#true} is VALID [2022-02-20 16:07:26,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#true} assume false; {113#false} is VALID [2022-02-20 16:07:26,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#false} assume !false; {113#false} is VALID [2022-02-20 16:07:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:27,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:27,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826288457] [2022-02-20 16:07:27,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826288457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:27,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:27,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:07:27,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707040558] [2022-02-20 16:07:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:27,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:07:27,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:27,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-20 16:07:27,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:27,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:07:27,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:07:27,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:07:27,053 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.9532710280373833) internal successors, (209), 108 states have internal predecessors, (209), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-20 16:07:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:27,247 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2022-02-20 16:07:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:07:27,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:07:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-20 16:07:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 416 transitions. [2022-02-20 16:07:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-20 16:07:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 416 transitions. [2022-02-20 16:07:27,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 416 transitions. [2022-02-20 16:07:27,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:27,710 INFO L225 Difference]: With dead ends: 216 [2022-02-20 16:07:27,710 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 16:07:27,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:07:27,717 INFO L933 BasicCegarLoop]: 199 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, 199 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-02-20 16:07:27,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 16:07:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-02-20 16:07:27,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:27,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 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-02-20 16:07:27,745 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 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-02-20 16:07:27,745 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 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-02-20 16:07:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:27,750 INFO L93 Difference]: Finished difference Result 100 states and 165 transitions. [2022-02-20 16:07:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2022-02-20 16:07:27,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:27,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:27,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 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 100 states. [2022-02-20 16:07:27,752 INFO L87 Difference]: Start difference. First operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 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 100 states. [2022-02-20 16:07:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:27,756 INFO L93 Difference]: Finished difference Result 100 states and 165 transitions. [2022-02-20 16:07:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2022-02-20 16:07:27,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:27,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:27,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:27,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 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-02-20 16:07:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2022-02-20 16:07:27,762 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2022-02-20 16:07:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:27,763 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2022-02-20 16:07:27,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-20 16:07:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2022-02-20 16:07:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:07:27,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:27,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:27,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:07:27,765 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2022-02-20 16:07:27,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:27,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663229317] [2022-02-20 16:07:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:27,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:27,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {643#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {643#true} is VALID [2022-02-20 16:07:27,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {645#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 16:07:27,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#(= |ULTIMATE.start_main_~q~0#1| 0)} goto; {645#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 16:07:27,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {645#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {645#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 16:07:27,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {645#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !(0 == main_~q~0#1); {644#false} is VALID [2022-02-20 16:07:27,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#false} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {644#false} is VALID [2022-02-20 16:07:27,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {644#false} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {644#false} is VALID [2022-02-20 16:07:27,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {644#false} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {644#false} is VALID [2022-02-20 16:07:27,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {644#false} assume (((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))); {644#false} is VALID [2022-02-20 16:07:27,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {644#false} assume !false; {644#false} is VALID [2022-02-20 16:07:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:27,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:27,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663229317] [2022-02-20 16:07:27,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663229317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:27,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:27,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:27,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632389541] [2022-02-20 16:07:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:27,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:27,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:27,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:27,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:27,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:27,828 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:28,031 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2022-02-20 16:07:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2022-02-20 16:07:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2022-02-20 16:07:28,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 332 transitions. [2022-02-20 16:07:28,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:28,309 INFO L225 Difference]: With dead ends: 201 [2022-02-20 16:07:28,309 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 16:07:28,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:28,311 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 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-02-20 16:07:28,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 16:07:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-02-20 16:07:28,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:28,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 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-02-20 16:07:28,318 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 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-02-20 16:07:28,319 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 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-02-20 16:07:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:28,322 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2022-02-20 16:07:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2022-02-20 16:07:28,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:28,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:28,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 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 103 states. [2022-02-20 16:07:28,325 INFO L87 Difference]: Start difference. First operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 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 103 states. [2022-02-20 16:07:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:28,328 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2022-02-20 16:07:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2022-02-20 16:07:28,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:28,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:28,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:28,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 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-02-20 16:07:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2022-02-20 16:07:28,333 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2022-02-20 16:07:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:28,334 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2022-02-20 16:07:28,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-20 16:07:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2022-02-20 16:07:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:07:28,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:28,335 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:28,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:07:28,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2022-02-20 16:07:28,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:28,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558780564] [2022-02-20 16:07:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:28,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {1171#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {1171#true} is VALID [2022-02-20 16:07:28,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {1171#true} is VALID [2022-02-20 16:07:28,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1171#true} goto; {1171#true} is VALID [2022-02-20 16:07:28,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {1171#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1171#true} is VALID [2022-02-20 16:07:28,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {1171#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1171#true} is VALID [2022-02-20 16:07:28,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1171#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {1171#true} is VALID [2022-02-20 16:07:28,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {1171#true} main_~method_id~0#1 := 1; {1171#true} is VALID [2022-02-20 16:07:28,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1171#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {1173#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0))} is VALID [2022-02-20 16:07:28,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} is VALID [2022-02-20 16:07:28,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} assume !(0 == main_~q~0#1); {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} is VALID [2022-02-20 16:07:28,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} is VALID [2022-02-20 16:07:28,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} is VALID [2022-02-20 16:07:28,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {1174#(and (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (or (= |ULTIMATE.start_main_~this_expect~0#1| 0) (not (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))))} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {1175#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))} is VALID [2022-02-20 16:07:28,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {1175#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0) (= 0 (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2)))))} assume (((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))); {1172#false} is VALID [2022-02-20 16:07:28,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2022-02-20 16:07:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:28,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:28,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558780564] [2022-02-20 16:07:28,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558780564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:28,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:28,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:07:28,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748045351] [2022-02-20 16:07:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:07:28,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:28,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-02-20 16:07:28,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:28,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:07:28,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:07:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:07:28,543 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-02-20 16:07:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:29,207 INFO L93 Difference]: Finished difference Result 207 states and 335 transitions. [2022-02-20 16:07:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:07:29,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:07:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-02-20 16:07:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2022-02-20 16:07:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-02-20 16:07:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2022-02-20 16:07:29,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 330 transitions. [2022-02-20 16:07:29,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:29,480 INFO L225 Difference]: With dead ends: 207 [2022-02-20 16:07:29,480 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 16:07:29,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:07:29,482 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 147 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:07:29,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 450 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:07:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 16:07:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-02-20 16:07:29,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:29,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 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-02-20 16:07:29,492 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 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-02-20 16:07:29,492 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 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-02-20 16:07:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:29,498 INFO L93 Difference]: Finished difference Result 188 states and 299 transitions. [2022-02-20 16:07:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 299 transitions. [2022-02-20 16:07:29,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:29,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:29,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 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 188 states. [2022-02-20 16:07:29,500 INFO L87 Difference]: Start difference. First operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 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 188 states. [2022-02-20 16:07:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:29,505 INFO L93 Difference]: Finished difference Result 188 states and 299 transitions. [2022-02-20 16:07:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 299 transitions. [2022-02-20 16:07:29,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:29,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:29,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:29,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 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-02-20 16:07:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2022-02-20 16:07:29,512 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2022-02-20 16:07:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:29,512 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2022-02-20 16:07:29,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-02-20 16:07:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2022-02-20 16:07:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:07:29,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:29,513 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:29,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:07:29,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2022-02-20 16:07:29,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:29,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752413204] [2022-02-20 16:07:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:29,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1951#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {1951#true} is VALID [2022-02-20 16:07:29,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {1951#true} is VALID [2022-02-20 16:07:29,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1951#true} goto; {1951#true} is VALID [2022-02-20 16:07:29,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {1951#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1951#true} is VALID [2022-02-20 16:07:29,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {1951#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1951#true} is VALID [2022-02-20 16:07:29,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1951#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {1951#true} is VALID [2022-02-20 16:07:29,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {1951#true} main_~method_id~0#1 := 1; {1951#true} is VALID [2022-02-20 16:07:29,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {1951#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {1953#(= |ULTIMATE.start_main_~q~0#1| 1)} is VALID [2022-02-20 16:07:29,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {1953#(= |ULTIMATE.start_main_~q~0#1| 1)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1953#(= |ULTIMATE.start_main_~q~0#1| 1)} is VALID [2022-02-20 16:07:29,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#(= |ULTIMATE.start_main_~q~0#1| 1)} assume !(0 == main_~q~0#1); {1953#(= |ULTIMATE.start_main_~q~0#1| 1)} is VALID [2022-02-20 16:07:29,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1953#(= |ULTIMATE.start_main_~q~0#1| 1)} assume !(1 == main_~q~0#1); {1952#false} is VALID [2022-02-20 16:07:29,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1952#false} assume 2 == main_~q~0#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647; {1952#false} is VALID [2022-02-20 16:07:29,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1952#false} assume 0 != main_#t~nondet20#1;havoc main_#t~nondet20#1; {1952#false} is VALID [2022-02-20 16:07:29,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#false} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {1952#false} is VALID [2022-02-20 16:07:29,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#false} assume ((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 == (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2)); {1952#false} is VALID [2022-02-20 16:07:29,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#false} assume !false; {1952#false} is VALID [2022-02-20 16:07:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:29,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:29,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752413204] [2022-02-20 16:07:29,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752413204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:29,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:29,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:29,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608334221] [2022-02-20 16:07:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:29,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-02-20 16:07:29,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:29,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-20 16:07:29,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:29,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:29,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:29,580 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-20 16:07:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:29,749 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2022-02-20 16:07:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:29,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-02-20 16:07:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-20 16:07:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 16:07:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-20 16:07:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 16:07:29,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 334 transitions. [2022-02-20 16:07:29,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:29,994 INFO L225 Difference]: With dead ends: 293 [2022-02-20 16:07:29,994 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 16:07:29,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:29,996 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 30 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 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-02-20 16:07:29,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 16:07:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2022-02-20 16:07:30,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:30,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 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-02-20 16:07:30,003 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 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-02-20 16:07:30,003 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 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-02-20 16:07:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:30,006 INFO L93 Difference]: Finished difference Result 124 states and 195 transitions. [2022-02-20 16:07:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 195 transitions. [2022-02-20 16:07:30,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:30,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:30,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 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 124 states. [2022-02-20 16:07:30,008 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 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 124 states. [2022-02-20 16:07:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:30,011 INFO L93 Difference]: Finished difference Result 124 states and 195 transitions. [2022-02-20 16:07:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 195 transitions. [2022-02-20 16:07:30,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:30,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:30,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:30,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 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-02-20 16:07:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2022-02-20 16:07:30,015 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2022-02-20 16:07:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:30,016 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2022-02-20 16:07:30,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-20 16:07:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2022-02-20 16:07:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:07:30,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:30,017 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:30,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:07:30,017 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2022-02-20 16:07:30,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:30,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870560597] [2022-02-20 16:07:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:30,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:30,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {2640#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {2640#true} is VALID [2022-02-20 16:07:30,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {2640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {2640#true} is VALID [2022-02-20 16:07:30,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2640#true} goto; {2640#true} is VALID [2022-02-20 16:07:30,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {2640#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2640#true} is VALID [2022-02-20 16:07:30,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {2640#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {2640#true} is VALID [2022-02-20 16:07:30,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2640#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {2640#true} is VALID [2022-02-20 16:07:30,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#true} main_~method_id~0#1 := 1; {2640#true} is VALID [2022-02-20 16:07:30,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {2640#true} is VALID [2022-02-20 16:07:30,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {2640#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2640#true} is VALID [2022-02-20 16:07:30,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {2640#true} assume !(0 == main_~q~0#1); {2640#true} is VALID [2022-02-20 16:07:30,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {2640#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {2640#true} is VALID [2022-02-20 16:07:30,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {2640#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {2640#true} is VALID [2022-02-20 16:07:30,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {2640#true} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {2640#true} is VALID [2022-02-20 16:07:30,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {2640#true} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {2642#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:30,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {2642#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2642#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:30,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {2642#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {2642#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:30,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {2642#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {2641#false} is VALID [2022-02-20 16:07:30,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {2641#false} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {2641#false} is VALID [2022-02-20 16:07:30,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {2641#false} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {2641#false} is VALID [2022-02-20 16:07:30,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {2641#false} assume (((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))); {2641#false} is VALID [2022-02-20 16:07:30,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {2641#false} assume !false; {2641#false} is VALID [2022-02-20 16:07:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:07:30,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:30,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870560597] [2022-02-20 16:07:30,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870560597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:30,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:30,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:30,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17387814] [2022-02-20 16:07:30,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:30,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2022-02-20 16:07:30,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:30,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-20 16:07:30,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:30,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:30,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:30,128 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-20 16:07:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:30,306 INFO L93 Difference]: Finished difference Result 248 states and 395 transitions. [2022-02-20 16:07:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:30,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2022-02-20 16:07:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-20 16:07:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2022-02-20 16:07:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-20 16:07:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2022-02-20 16:07:30,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 338 transitions. [2022-02-20 16:07:30,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:30,555 INFO L225 Difference]: With dead ends: 248 [2022-02-20 16:07:30,555 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 16:07:30,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:30,557 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 32 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 282 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-02-20 16:07:30,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 282 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 16:07:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-02-20 16:07:30,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:30,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 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-02-20 16:07:30,562 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 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-02-20 16:07:30,563 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 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-02-20 16:07:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:30,566 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2022-02-20 16:07:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2022-02-20 16:07:30,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:30,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:30,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 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 129 states. [2022-02-20 16:07:30,568 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 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 129 states. [2022-02-20 16:07:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:30,571 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2022-02-20 16:07:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2022-02-20 16:07:30,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:30,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:30,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:30,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 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-02-20 16:07:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 199 transitions. [2022-02-20 16:07:30,575 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 199 transitions. Word has length 21 [2022-02-20 16:07:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:30,576 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 199 transitions. [2022-02-20 16:07:30,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-20 16:07:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 199 transitions. [2022-02-20 16:07:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:07:30,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:30,577 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:30,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:07:30,577 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2022-02-20 16:07:30,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:30,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586831352] [2022-02-20 16:07:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:30,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {3301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {3301#true} is VALID [2022-02-20 16:07:30,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {3301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {3301#true} is VALID [2022-02-20 16:07:30,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {3301#true} goto; {3301#true} is VALID [2022-02-20 16:07:30,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {3301#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3301#true} is VALID [2022-02-20 16:07:30,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {3301#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {3301#true} is VALID [2022-02-20 16:07:30,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {3301#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {3301#true} is VALID [2022-02-20 16:07:30,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {3301#true} main_~method_id~0#1 := 1; {3301#true} is VALID [2022-02-20 16:07:30,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {3301#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:30,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:30,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 == main_~q~0#1); {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:30,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:30,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:30,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:30,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {3303#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {3304#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:30,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {3304#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume !(0 == main_~q~0#1); {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume !(1 == main_~q~0#1); {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume !(2 == main_~q~0#1); {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1; {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} is VALID [2022-02-20 16:07:30,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {3305#(or (<= (+ (* 2 (div |ULTIMATE.start_main_~this_expect~0#1| 2)) 1) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div (+ |ULTIMATE.start_main_~P1~0#1| (* (- 2) (div |ULTIMATE.start_main_~P1~0#1| 2))) 4294967296) 4294967296))) (not (= (* 2 (div |ULTIMATE.start_main_~P1~0#1| 2)) |ULTIMATE.start_main_~P1~0#1|)))} assume ((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 == (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2)); {3302#false} is VALID [2022-02-20 16:07:30,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {3302#false} assume !false; {3302#false} is VALID [2022-02-20 16:07:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:30,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:30,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586831352] [2022-02-20 16:07:30,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586831352] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:07:30,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524811990] [2022-02-20 16:07:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:07:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:07:30,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:07:30,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:07:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:30,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:07:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:30,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:07:31,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {3301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {3301#true} is VALID [2022-02-20 16:07:31,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {3301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {3301#true} is VALID [2022-02-20 16:07:31,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {3301#true} goto; {3301#true} is VALID [2022-02-20 16:07:31,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {3301#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3301#true} is VALID [2022-02-20 16:07:31,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {3301#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {3301#true} is VALID [2022-02-20 16:07:31,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {3301#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {3301#true} is VALID [2022-02-20 16:07:31,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {3301#true} main_~method_id~0#1 := 1; {3301#true} is VALID [2022-02-20 16:07:31,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {3301#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-20 16:07:31,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-20 16:07:31,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume !(0 == main_~q~0#1); {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-20 16:07:31,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-20 16:07:31,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-20 16:07:31,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-20 16:07:31,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {3330#(= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume !(0 == main_~q~0#1); {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume !(1 == main_~q~0#1); {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume !(2 == main_~q~0#1); {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1; {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} is VALID [2022-02-20 16:07:31,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {3349#(= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1)} assume ((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 == (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2)); {3302#false} is VALID [2022-02-20 16:07:31,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {3302#false} assume !false; {3302#false} is VALID [2022-02-20 16:07:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:31,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:07:31,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {3302#false} assume !false; {3302#false} is VALID [2022-02-20 16:07:31,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume ((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 == (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2)); {3302#false} is VALID [2022-02-20 16:07:31,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1; {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume !(2 == main_~q~0#1); {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume !(1 == main_~q~0#1); {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume !(0 == main_~q~0#1); {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {3380#(not (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1))} is VALID [2022-02-20 16:07:31,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:31,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:31,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:31,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 == main_~q~0#1); {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:31,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:31,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {3301#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {3405#(not (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:31,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {3301#true} main_~method_id~0#1 := 1; {3301#true} is VALID [2022-02-20 16:07:31,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {3301#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {3301#true} is VALID [2022-02-20 16:07:31,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {3301#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {3301#true} is VALID [2022-02-20 16:07:31,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {3301#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3301#true} is VALID [2022-02-20 16:07:31,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {3301#true} goto; {3301#true} is VALID [2022-02-20 16:07:31,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {3301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {3301#true} is VALID [2022-02-20 16:07:31,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {3301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {3301#true} is VALID [2022-02-20 16:07:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:31,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524811990] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:07:31,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:07:31,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-02-20 16:07:31,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125493434] [2022-02-20 16:07:31,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:07:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 23 [2022-02-20 16:07:31,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:31,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-02-20 16:07:31,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:31,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:07:31,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:31,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:07:31,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:07:31,242 INFO L87 Difference]: Start difference. First operand 127 states and 199 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-02-20 16:07:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:33,333 INFO L93 Difference]: Finished difference Result 469 states and 734 transitions. [2022-02-20 16:07:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:07:33,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 23 [2022-02-20 16:07:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-02-20 16:07:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 690 transitions. [2022-02-20 16:07:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-02-20 16:07:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 690 transitions. [2022-02-20 16:07:33,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 690 transitions. [2022-02-20 16:07:33,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 690 edges. 690 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:33,932 INFO L225 Difference]: With dead ends: 469 [2022-02-20 16:07:33,932 INFO L226 Difference]: Without dead ends: 417 [2022-02-20 16:07:33,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-02-20 16:07:33,933 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 1462 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:07:33,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 1208 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:07:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-02-20 16:07:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 348. [2022-02-20 16:07:33,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:33,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 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-02-20 16:07:33,970 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 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-02-20 16:07:33,971 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 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-02-20 16:07:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:33,981 INFO L93 Difference]: Finished difference Result 417 states and 631 transitions. [2022-02-20 16:07:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2022-02-20 16:07:33,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:33,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:33,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 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 417 states. [2022-02-20 16:07:33,984 INFO L87 Difference]: Start difference. First operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 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 417 states. [2022-02-20 16:07:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:33,995 INFO L93 Difference]: Finished difference Result 417 states and 631 transitions. [2022-02-20 16:07:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2022-02-20 16:07:33,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:33,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:33,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:33,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 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-02-20 16:07:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 551 transitions. [2022-02-20 16:07:34,004 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 551 transitions. Word has length 23 [2022-02-20 16:07:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:34,006 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 551 transitions. [2022-02-20 16:07:34,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-02-20 16:07:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 551 transitions. [2022-02-20 16:07:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:07:34,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:34,007 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:34,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 16:07:34,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 16:07:34,223 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2022-02-20 16:07:34,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:34,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810585249] [2022-02-20 16:07:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:34,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {5169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {5169#true} is VALID [2022-02-20 16:07:34,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {5169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {5169#true} is VALID [2022-02-20 16:07:34,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {5169#true} goto; {5169#true} is VALID [2022-02-20 16:07:34,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {5169#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {5169#true} is VALID [2022-02-20 16:07:34,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {5169#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {5169#true} is VALID [2022-02-20 16:07:34,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {5169#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {5169#true} is VALID [2022-02-20 16:07:34,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {5169#true} main_~method_id~0#1 := 1; {5169#true} is VALID [2022-02-20 16:07:34,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {5169#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {5169#true} is VALID [2022-02-20 16:07:34,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {5169#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {5169#true} is VALID [2022-02-20 16:07:34,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {5169#true} assume !(0 == main_~q~0#1); {5169#true} is VALID [2022-02-20 16:07:34,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {5169#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {5169#true} is VALID [2022-02-20 16:07:34,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {5169#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {5169#true} is VALID [2022-02-20 16:07:34,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {5169#true} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {5169#true} is VALID [2022-02-20 16:07:34,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {5169#true} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {5169#true} is VALID [2022-02-20 16:07:34,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {5169#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(0 == main_~q~0#1); {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(1 == main_~q~0#1); {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(2 == main_~q~0#1); {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(0 != main_#t~nondet27#1);havoc main_#t~nondet27#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume 0 != main_~P1~0#1 && 1 != main_~P1~0#1 && 0 != main_~P1~0#1;main_~method_id~0#1 := 6; {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} is VALID [2022-02-20 16:07:34,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {5171#(and (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)))} assume ((main_~P8~0#1 % 4294967296 == (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && 0 != main_~P8~0#1) && 0 != main_~P8~0#1 && 1 != main_~P8~0#1 && 0 != main_~P8~0#1; {5170#false} is VALID [2022-02-20 16:07:34,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2022-02-20 16:07:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:07:34,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:34,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810585249] [2022-02-20 16:07:34,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810585249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:34,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:34,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:34,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081403748] [2022-02-20 16:07:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:34,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:34,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:34,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:34,376 INFO L87 Difference]: Start difference. First operand 348 states and 551 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:34,594 INFO L93 Difference]: Finished difference Result 351 states and 553 transitions. [2022-02-20 16:07:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:34,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2022-02-20 16:07:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2022-02-20 16:07:34,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2022-02-20 16:07:34,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:34,759 INFO L225 Difference]: With dead ends: 351 [2022-02-20 16:07:34,759 INFO L226 Difference]: Without dead ends: 344 [2022-02-20 16:07:34,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:34,760 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 147 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:07:34,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-02-20 16:07:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2022-02-20 16:07:34,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:34,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 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-02-20 16:07:34,799 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 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-02-20 16:07:34,799 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 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-02-20 16:07:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:34,807 INFO L93 Difference]: Finished difference Result 344 states and 537 transitions. [2022-02-20 16:07:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 537 transitions. [2022-02-20 16:07:34,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:34,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:34,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 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 344 states. [2022-02-20 16:07:34,809 INFO L87 Difference]: Start difference. First operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 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 344 states. [2022-02-20 16:07:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:34,816 INFO L93 Difference]: Finished difference Result 344 states and 537 transitions. [2022-02-20 16:07:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 537 transitions. [2022-02-20 16:07:34,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:34,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:34,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:34,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 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-02-20 16:07:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 536 transitions. [2022-02-20 16:07:34,825 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 536 transitions. Word has length 27 [2022-02-20 16:07:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:34,826 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 536 transitions. [2022-02-20 16:07:34,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 16:07:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 536 transitions. [2022-02-20 16:07:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 16:07:34,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:34,827 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:34,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 16:07:34,827 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash 338445793, now seen corresponding path program 1 times [2022-02-20 16:07:34,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:34,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417488338] [2022-02-20 16:07:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:34,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {6596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {6596#true} is VALID [2022-02-20 16:07:34,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {6596#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {6596#true} is VALID [2022-02-20 16:07:34,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {6596#true} goto; {6596#true} is VALID [2022-02-20 16:07:34,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {6596#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6596#true} is VALID [2022-02-20 16:07:34,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {6596#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {6596#true} is VALID [2022-02-20 16:07:34,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {6596#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {6596#true} is VALID [2022-02-20 16:07:34,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {6596#true} main_~method_id~0#1 := 1; {6596#true} is VALID [2022-02-20 16:07:34,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {6596#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {6596#true} is VALID [2022-02-20 16:07:34,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {6596#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6596#true} is VALID [2022-02-20 16:07:34,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {6596#true} assume !(0 == main_~q~0#1); {6596#true} is VALID [2022-02-20 16:07:34,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {6596#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {6596#true} is VALID [2022-02-20 16:07:34,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {6596#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {6596#true} is VALID [2022-02-20 16:07:34,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#true} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {6596#true} is VALID [2022-02-20 16:07:34,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {6596#true} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {6596#true} is VALID [2022-02-20 16:07:34,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {6596#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6596#true} is VALID [2022-02-20 16:07:34,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {6596#true} assume !(0 == main_~q~0#1); {6596#true} is VALID [2022-02-20 16:07:34,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {6596#true} assume !(1 == main_~q~0#1); {6596#true} is VALID [2022-02-20 16:07:34,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {6596#true} assume !(2 == main_~q~0#1); {6596#true} is VALID [2022-02-20 16:07:34,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {6596#true} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {6596#true} is VALID [2022-02-20 16:07:34,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {6596#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {6596#true} is VALID [2022-02-20 16:07:34,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {6596#true} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {6596#true} is VALID [2022-02-20 16:07:34,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {6596#true} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {6596#true} is VALID [2022-02-20 16:07:34,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {6596#true} assume !((1 == main_~this_buffer_empty~0#1 % 4294967296 && !(0 != main_~P3~0#1)) || ((main_~P3~0#1 % 4294967296 != (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1)));main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {6598#(<= 4 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:34,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {6598#(<= 4 |ULTIMATE.start_main_~q~0#1|)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6598#(<= 4 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:34,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {6598#(<= 4 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {6598#(<= 4 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:34,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {6598#(<= 4 |ULTIMATE.start_main_~q~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {6597#false} is VALID [2022-02-20 16:07:34,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {6597#false} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {6597#false} is VALID [2022-02-20 16:07:34,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {6597#false} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {6597#false} is VALID [2022-02-20 16:07:34,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {6597#false} assume (((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))); {6597#false} is VALID [2022-02-20 16:07:34,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {6597#false} assume !false; {6597#false} is VALID [2022-02-20 16:07:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:07:34,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:34,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417488338] [2022-02-20 16:07:34,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417488338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:34,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:34,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:34,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231400876] [2022-02-20 16:07:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:34,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-02-20 16:07:34,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:34,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-20 16:07:34,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:34,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:34,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:34,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:34,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:34,964 INFO L87 Difference]: Start difference. First operand 343 states and 536 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-20 16:07:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:35,143 INFO L93 Difference]: Finished difference Result 583 states and 907 transitions. [2022-02-20 16:07:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-02-20 16:07:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-20 16:07:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2022-02-20 16:07:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-20 16:07:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2022-02-20 16:07:35,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 291 transitions. [2022-02-20 16:07:35,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:35,362 INFO L225 Difference]: With dead ends: 583 [2022-02-20 16:07:35,362 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 16:07:35,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:35,364 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 184 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-02-20 16:07:35,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 16:07:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2022-02-20 16:07:35,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:35,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 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-02-20 16:07:35,407 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 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-02-20 16:07:35,407 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 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-02-20 16:07:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:35,412 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2022-02-20 16:07:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 362 transitions. [2022-02-20 16:07:35,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:35,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:35,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 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) Second operand 243 states. [2022-02-20 16:07:35,414 INFO L87 Difference]: Start difference. First operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 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) Second operand 243 states. [2022-02-20 16:07:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:35,419 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2022-02-20 16:07:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 362 transitions. [2022-02-20 16:07:35,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:35,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:35,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:35,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 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-02-20 16:07:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2022-02-20 16:07:35,442 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 30 [2022-02-20 16:07:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:35,442 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2022-02-20 16:07:35,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-20 16:07:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2022-02-20 16:07:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:07:35,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:35,443 INFO L514 BasicCegarLoop]: trace histogram [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-02-20 16:07:35,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 16:07:35,443 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2022-02-20 16:07:35,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:35,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100337102] [2022-02-20 16:07:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:35,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {7962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {7962#true} is VALID [2022-02-20 16:07:35,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {7962#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {7962#true} is VALID [2022-02-20 16:07:35,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {7962#true} goto; {7962#true} is VALID [2022-02-20 16:07:35,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {7962#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7962#true} is VALID [2022-02-20 16:07:35,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {7962#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {7962#true} is VALID [2022-02-20 16:07:35,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {7962#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {7962#true} is VALID [2022-02-20 16:07:35,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {7962#true} main_~method_id~0#1 := 1; {7962#true} is VALID [2022-02-20 16:07:35,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {7962#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {7962#true} is VALID [2022-02-20 16:07:35,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {7962#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7962#true} is VALID [2022-02-20 16:07:35,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {7962#true} assume !(0 == main_~q~0#1); {7962#true} is VALID [2022-02-20 16:07:35,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {7962#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {7962#true} is VALID [2022-02-20 16:07:35,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {7962#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {7962#true} is VALID [2022-02-20 16:07:35,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {7962#true} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {7962#true} is VALID [2022-02-20 16:07:35,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {7962#true} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {7962#true} is VALID [2022-02-20 16:07:35,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {7962#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7962#true} is VALID [2022-02-20 16:07:35,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {7962#true} assume !(0 == main_~q~0#1); {7962#true} is VALID [2022-02-20 16:07:35,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {7962#true} assume !(1 == main_~q~0#1); {7962#true} is VALID [2022-02-20 16:07:35,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {7962#true} assume !(2 == main_~q~0#1); {7962#true} is VALID [2022-02-20 16:07:35,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {7962#true} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {7962#true} is VALID [2022-02-20 16:07:35,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {7962#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {7962#true} is VALID [2022-02-20 16:07:35,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {7962#true} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {7962#true} is VALID [2022-02-20 16:07:35,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {7962#true} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {7962#true} is VALID [2022-02-20 16:07:35,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {7962#true} assume !((1 == main_~this_buffer_empty~0#1 % 4294967296 && !(0 != main_~P3~0#1)) || ((main_~P3~0#1 % 4294967296 != (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1)));main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} is VALID [2022-02-20 16:07:35,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} is VALID [2022-02-20 16:07:35,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} assume !(0 == main_~q~0#1); {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} is VALID [2022-02-20 16:07:35,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} assume !(1 == main_~q~0#1); {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} is VALID [2022-02-20 16:07:35,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} assume !(2 == main_~q~0#1); {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} is VALID [2022-02-20 16:07:35,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} assume !(3 == main_~q~0#1); {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} is VALID [2022-02-20 16:07:35,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {7964#(= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 0)} assume !(4 == main_~q~0#1); {7963#false} is VALID [2022-02-20 16:07:35,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {7963#false} assume 5 == main_~q~0#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {7963#false} is VALID [2022-02-20 16:07:35,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {7963#false} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {7963#false} is VALID [2022-02-20 16:07:35,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {7963#false} assume !(0 != main_#t~nondet39#1);havoc main_#t~nondet39#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {7963#false} is VALID [2022-02-20 16:07:35,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {7963#false} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {7963#false} is VALID [2022-02-20 16:07:35,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {7963#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1; {7963#false} is VALID [2022-02-20 16:07:35,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {7963#false} assume 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && !(1 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 5; {7963#false} is VALID [2022-02-20 16:07:35,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {7963#false} assume (((if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) % 4294967296 == (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)); {7963#false} is VALID [2022-02-20 16:07:35,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {7963#false} assume !false; {7963#false} is VALID [2022-02-20 16:07:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:07:35,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:35,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100337102] [2022-02-20 16:07:35,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100337102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:35,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:35,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:35,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114610935] [2022-02-20 16:07:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:35,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 37 [2022-02-20 16:07:35,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:35,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-02-20 16:07:35,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:35,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:35,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:35,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:35,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:35,528 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-02-20 16:07:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:35,711 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2022-02-20 16:07:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 37 [2022-02-20 16:07:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-02-20 16:07:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-02-20 16:07:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-02-20 16:07:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-02-20 16:07:35,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 257 transitions. [2022-02-20 16:07:35,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:35,894 INFO L225 Difference]: With dead ends: 424 [2022-02-20 16:07:35,894 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 16:07:35,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:35,895 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 28 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 212 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-02-20 16:07:35,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 212 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 16:07:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2022-02-20 16:07:35,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:35,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 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-02-20 16:07:35,936 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 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-02-20 16:07:35,937 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 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-02-20 16:07:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:35,941 INFO L93 Difference]: Finished difference Result 225 states and 325 transitions. [2022-02-20 16:07:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2022-02-20 16:07:35,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:35,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:35,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 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 225 states. [2022-02-20 16:07:35,942 INFO L87 Difference]: Start difference. First operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 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 225 states. [2022-02-20 16:07:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:35,947 INFO L93 Difference]: Finished difference Result 225 states and 325 transitions. [2022-02-20 16:07:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2022-02-20 16:07:35,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:35,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:35,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:35,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 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-02-20 16:07:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2022-02-20 16:07:35,952 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2022-02-20 16:07:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:35,952 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2022-02-20 16:07:35,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-02-20 16:07:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2022-02-20 16:07:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 16:07:35,953 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:35,953 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:35,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 16:07:35,954 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2022-02-20 16:07:35,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:35,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695901694] [2022-02-20 16:07:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:36,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {9109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {9109#true} is VALID [2022-02-20 16:07:36,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {9109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {9109#true} is VALID [2022-02-20 16:07:36,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {9109#true} goto; {9109#true} is VALID [2022-02-20 16:07:36,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {9109#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9109#true} is VALID [2022-02-20 16:07:36,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {9109#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {9109#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {9109#true} is VALID [2022-02-20 16:07:36,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {9109#true} main_~method_id~0#1 := 1; {9109#true} is VALID [2022-02-20 16:07:36,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {9109#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {9109#true} is VALID [2022-02-20 16:07:36,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {9109#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9109#true} is VALID [2022-02-20 16:07:36,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {9109#true} assume !(0 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {9109#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {9109#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {9109#true} is VALID [2022-02-20 16:07:36,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {9109#true} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {9109#true} is VALID [2022-02-20 16:07:36,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {9109#true} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9109#true} is VALID [2022-02-20 16:07:36,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {9109#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9109#true} is VALID [2022-02-20 16:07:36,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {9109#true} assume !(0 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {9109#true} assume !(1 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {9109#true} assume !(2 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {9109#true} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {9109#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {9109#true} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {9109#true} is VALID [2022-02-20 16:07:36,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {9109#true} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {9109#true} is VALID [2022-02-20 16:07:36,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {9109#true} assume !((1 == main_~this_buffer_empty~0#1 % 4294967296 && !(0 != main_~P3~0#1)) || ((main_~P3~0#1 % 4294967296 != (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1)));main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9109#true} is VALID [2022-02-20 16:07:36,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {9109#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9109#true} is VALID [2022-02-20 16:07:36,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {9109#true} assume !(0 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {9109#true} assume !(1 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {9109#true} assume !(2 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {9109#true} assume !(3 == main_~q~0#1); {9109#true} is VALID [2022-02-20 16:07:36,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {9109#true} assume 4 == main_~q~0#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {9109#true} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {9109#true} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {9109#true} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {9109#true} is VALID [2022-02-20 16:07:36,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {9109#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1; {9109#true} is VALID [2022-02-20 16:07:36,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {9109#true} assume 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && !(1 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 5; {9109#true} is VALID [2022-02-20 16:07:36,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {9109#true} assume !(((((if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))) || ((1 != main_~this_buffer_empty~0#1 % 4294967296 && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))));main_~q~0#1 := 5;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:36,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:36,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:36,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} assume !(1 == main_~q~0#1); {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:36,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} assume !(2 == main_~q~0#1); {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:36,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} assume !(3 == main_~q~0#1); {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:07:36,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {9111#(<= 5 |ULTIMATE.start_main_~q~0#1|)} assume 4 == main_~q~0#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {9110#false} is VALID [2022-02-20 16:07:36,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {9110#false} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {9110#false} is VALID [2022-02-20 16:07:36,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {9110#false} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1; {9110#false} is VALID [2022-02-20 16:07:36,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {9110#false} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {9110#false} is VALID [2022-02-20 16:07:36,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {9110#false} assume (main_~P3~0#1 % 4294967296 == (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1); {9110#false} is VALID [2022-02-20 16:07:36,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {9110#false} assume !false; {9110#false} is VALID [2022-02-20 16:07:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 16:07:36,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:36,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695901694] [2022-02-20 16:07:36,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695901694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:36,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:36,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:36,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912418529] [2022-02-20 16:07:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 46 [2022-02-20 16:07:36,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:36,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-20 16:07:36,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:36,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:07:36,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:07:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:36,108 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-20 16:07:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:36,257 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2022-02-20 16:07:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:36,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 46 [2022-02-20 16:07:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-20 16:07:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2022-02-20 16:07:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-20 16:07:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2022-02-20 16:07:36,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 241 transitions. [2022-02-20 16:07:36,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:36,442 INFO L225 Difference]: With dead ends: 305 [2022-02-20 16:07:36,442 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 16:07:36,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:36,443 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 184 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-02-20 16:07:36,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 184 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:07:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 16:07:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-02-20 16:07:36,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:36,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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-02-20 16:07:36,471 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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-02-20 16:07:36,472 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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-02-20 16:07:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:36,474 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2022-02-20 16:07:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2022-02-20 16:07:36,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:36,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:36,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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 143 states. [2022-02-20 16:07:36,475 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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 143 states. [2022-02-20 16:07:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:36,477 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2022-02-20 16:07:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2022-02-20 16:07:36,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:36,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:36,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:36,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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-02-20 16:07:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2022-02-20 16:07:36,480 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2022-02-20 16:07:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:36,481 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2022-02-20 16:07:36,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-20 16:07:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2022-02-20 16:07:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:07:36,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:36,482 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 16:07:36,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 16:07:36,482 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2022-02-20 16:07:36,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:36,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260944571] [2022-02-20 16:07:36,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:36,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {9880#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {9880#true} is VALID [2022-02-20 16:07:36,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {9880#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {9880#true} is VALID [2022-02-20 16:07:36,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {9880#true} goto; {9880#true} is VALID [2022-02-20 16:07:36,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {9880#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9880#true} is VALID [2022-02-20 16:07:36,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {9880#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {9880#true} is VALID [2022-02-20 16:07:36,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {9880#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {9880#true} is VALID [2022-02-20 16:07:36,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {9880#true} main_~method_id~0#1 := 1; {9880#true} is VALID [2022-02-20 16:07:36,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {9880#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:36,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:36,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 == main_~q~0#1); {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:36,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:36,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:36,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-20 16:07:36,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {9882#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(1 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(2 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !((1 == main_~this_buffer_empty~0#1 % 4294967296 && !(0 != main_~P3~0#1)) || ((main_~P3~0#1 % 4294967296 != (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1)));main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(1 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(2 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(3 == main_~q~0#1); {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume 4 == main_~q~0#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && !(1 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 5; {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} is VALID [2022-02-20 16:07:36,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {9883#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))} assume !(((((if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))) || ((1 != main_~this_buffer_empty~0#1 % 4294967296 && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))));main_~q~0#1 := 5;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9884#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 2) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 2))} is VALID [2022-02-20 16:07:36,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {9884#(<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 2) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 2))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(0 == main_~q~0#1); {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(1 == main_~q~0#1); {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(2 == main_~q~0#1); {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(3 == main_~q~0#1); {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(4 == main_~q~0#1); {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume 5 == main_~q~0#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#1; {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} is VALID [2022-02-20 16:07:36,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {9885#(or (<= (+ 2 |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296)) (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2)) (<= (* (div (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2) 2) (+ |ULTIMATE.start_main_~this_expect~0#1| (* (div |ULTIMATE.start_main_~P3~0#1| 4294967296) 4294967296))))} assume (main_~P3~0#1 % 4294967296 == (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1); {9881#false} is VALID [2022-02-20 16:07:36,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {9881#false} assume !false; {9881#false} is VALID [2022-02-20 16:07:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:07:36,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:36,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260944571] [2022-02-20 16:07:36,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260944571] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:07:36,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058377034] [2022-02-20 16:07:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:36,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:07:36,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:07:36,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:07:36,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:07:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:36,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 16:07:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:36,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:07:37,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {9880#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {9880#true} is VALID [2022-02-20 16:07:37,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {9880#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {9880#true} is VALID [2022-02-20 16:07:37,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {9880#true} goto; {9880#true} is VALID [2022-02-20 16:07:37,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {9880#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9880#true} is VALID [2022-02-20 16:07:37,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {9880#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {9880#true} is VALID [2022-02-20 16:07:37,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {9880#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {9880#true} is VALID [2022-02-20 16:07:37,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {9880#true} main_~method_id~0#1 := 1; {9880#true} is VALID [2022-02-20 16:07:37,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {9880#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(0 == main_~q~0#1); {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {9910#(and (= |ULTIMATE.start_main_~this_expect~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !(0 == main_~q~0#1); {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !(1 == main_~q~0#1); {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !(2 == main_~q~0#1); {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} is VALID [2022-02-20 16:07:37,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {9929#(and (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 0))} assume !((1 == main_~this_buffer_empty~0#1 % 4294967296 && !(0 != main_~P3~0#1)) || ((main_~P3~0#1 % 4294967296 != (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1)));main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(0 == main_~q~0#1); {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(1 == main_~q~0#1); {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(2 == main_~q~0#1); {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(3 == main_~q~0#1); {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume 4 == main_~q~0#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && !(1 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 5; {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} is VALID [2022-02-20 16:07:37,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {9957#(and (= |ULTIMATE.start_main_~this_expect~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))} assume !(((((if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))) || ((1 != main_~this_buffer_empty~0#1 % 4294967296 && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))));main_~q~0#1 := 5;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(0 == main_~q~0#1); {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(1 == main_~q~0#1); {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(2 == main_~q~0#1); {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(3 == main_~q~0#1); {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(4 == main_~q~0#1); {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume 5 == main_~q~0#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#1; {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} is VALID [2022-02-20 16:07:37,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#(and (= 2 |ULTIMATE.start_main_~this_expect~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 1) 1))} assume (main_~P3~0#1 % 4294967296 == (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1); {9881#false} is VALID [2022-02-20 16:07:37,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {9881#false} assume !false; {9881#false} is VALID [2022-02-20 16:07:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:37,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:07:37,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {9881#false} assume !false; {9881#false} is VALID [2022-02-20 16:07:37,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume (main_~P3~0#1 % 4294967296 == (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1); {9881#false} is VALID [2022-02-20 16:07:37,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume 0 != main_#t~nondet39#1;havoc main_#t~nondet39#1; {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume 5 == main_~q~0#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(4 == main_~q~0#1); {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(3 == main_~q~0#1); {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(2 == main_~q~0#1); {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(1 == main_~q~0#1); {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !(0 == main_~q~0#1); {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(((((if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))) || ((1 != main_~this_buffer_empty~0#1 % 4294967296 && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2)) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && !(1 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2) && 0 != (if main_~P6~0#1 < 0 && 0 != main_~P6~0#1 % 2 then main_~P6~0#1 % 2 - 2 else main_~P6~0#1 % 2))));main_~q~0#1 := 5;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {10034#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))} is VALID [2022-02-20 16:07:37,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && !(1 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) && 0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 5; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 4 == main_~q~0#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(3 == main_~q~0#1); {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(2 == main_~q~0#1); {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(1 == main_~q~0#1); {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 == main_~q~0#1); {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !((1 == main_~this_buffer_empty~0#1 % 4294967296 && !(0 != main_~P3~0#1)) || ((main_~P3~0#1 % 4294967296 != (if (main_~this_expect~0#1 - 1) % 4294967296 < 0 && 0 != (main_~this_expect~0#1 - 1) % 4294967296 % 2 then (main_~this_expect~0#1 - 1) % 4294967296 % 2 - 2 else (main_~this_expect~0#1 - 1) % 4294967296 % 2) % 4294967296 && 1 != main_~this_buffer_empty~0#1 % 4294967296) && !(0 != main_~P3~0#1)));main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {10068#(or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !(2 == main_~q~0#1); {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !(1 == main_~q~0#1); {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !(0 == main_~q~0#1); {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !((((if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2) % 4294967296 != (if main_~this_expect~0#1 % 4294967296 < 0 && 0 != main_~this_expect~0#1 % 4294967296 % 2 then main_~this_expect~0#1 % 4294967296 % 2 - 2 else main_~this_expect~0#1 % 4294967296 % 2) % 4294967296 && 1 == main_~this_buffer_empty~0#1 % 4294967296) && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))) || (1 != main_~this_buffer_empty~0#1 % 4294967296 && !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2))));main_~q~0#1 := 3;main_~this_expect~0#1 := 1 + main_~this_expect~0#1;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {10105#(or (= (mod |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967296) 1) (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)))} is VALID [2022-02-20 16:07:37,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 != (if main_~P1~0#1 < 0 && 0 != main_~P1~0#1 % 2 then main_~P1~0#1 % 2 - 2 else main_~P1~0#1 % 2));main_~method_id~0#1 := 2; {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !(0 == main_~q~0#1); {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {9880#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {10133#(or (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (mod (+ (* |ULTIMATE.start_main_~this_buffer_empty~0#1| 4294967295) 1) 4294967296) 1))} is VALID [2022-02-20 16:07:37,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {9880#true} main_~method_id~0#1 := 1; {9880#true} is VALID [2022-02-20 16:07:37,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {9880#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {9880#true} is VALID [2022-02-20 16:07:37,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {9880#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {9880#true} is VALID [2022-02-20 16:07:37,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {9880#true} assume !false;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9880#true} is VALID [2022-02-20 16:07:37,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {9880#true} goto; {9880#true} is VALID [2022-02-20 16:07:37,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {9880#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; {9880#true} is VALID [2022-02-20 16:07:37,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {9880#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; {9880#true} is VALID [2022-02-20 16:07:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:37,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058377034] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:07:37,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:07:37,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-02-20 16:07:37,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039465095] [2022-02-20 16:07:37,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:07:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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 47 [2022-02-20 16:07:37,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:37,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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-02-20 16:07:37,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:37,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 16:07:37,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 16:07:37,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:07:37,634 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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-02-20 16:07:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:38,354 INFO L93 Difference]: Finished difference Result 163 states and 231 transitions. [2022-02-20 16:07:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:07:38,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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 47 [2022-02-20 16:07:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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-02-20 16:07:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2022-02-20 16:07:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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-02-20 16:07:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2022-02-20 16:07:38,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 231 transitions. [2022-02-20 16:07:38,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:38,584 INFO L225 Difference]: With dead ends: 163 [2022-02-20 16:07:38,584 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:07:38,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 16:07:38,585 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 471 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:07:38,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 594 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:07:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:07:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:07:38,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:38,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:07:38,586 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:07:38,586 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:07:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:38,586 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:07:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:07:38,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:38,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:38,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:07:38,586 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:07:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:38,587 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:07:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:07:38,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:38,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:38,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:38,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:07:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:07:38,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-02-20 16:07:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:38,587 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:07:38,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 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-02-20 16:07:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:07:38,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:38,590 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:07:38,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:07:38,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 16:07:38,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 434) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L300(lines 300 302) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 170) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 534) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 402) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 502) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 60) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 57) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 157) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 257) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L110(lines 110 125) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 55) no Hoare annotation was computed. [2022-02-20 16:07:39,105 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 357) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 225) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 155) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 93) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L442(lines 442 457) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 325) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L244(lines 244 255) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 193) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 123) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L542(lines 542 557) no Hoare annotation was computed. [2022-02-20 16:07:39,106 INFO L858 garLoopResultBuilder]: For program point L410(lines 410 425) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 355) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 293) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 223) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 91) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 525) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 455) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 393) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 323) no Hoare annotation was computed. [2022-02-20 16:07:39,107 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 191) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 555) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 493) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 423) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L858 garLoopResultBuilder]: For program point L280(lines 280 291) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 150) no Hoare annotation was computed. [2022-02-20 16:07:39,108 INFO L861 garLoopResultBuilder]: At program point L16(lines 16 568) the Hoare annotation is: true [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L512(lines 512 523) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L380(lines 380 391) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 250) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 118) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 491) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 350) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 218) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 86) no Hoare annotation was computed. [2022-02-20 16:07:39,109 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 450) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point L548(lines 548 550) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 286) no Hoare annotation was computed. [2022-02-20 16:07:39,110 INFO L854 garLoopResultBuilder]: At program point L549(lines 16 568) the Hoare annotation is: false [2022-02-20 16:07:39,110 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 518) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L384(lines 384 386) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 563) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0))) (or (and .cse0 (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 5 |ULTIMATE.start_main_~q~0#1|) (<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 2) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 2)) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648))) (and (= |ULTIMATE.start_main_~this_expect~0#1| 0) .cse0 (= |ULTIMATE.start_main_~q~0#1| 0)))) [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L26-3(lines 26 563) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 141) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L226(lines 226 241) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 109) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 160) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 341) no Hoare annotation was computed. [2022-02-20 16:07:39,111 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 209) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 260) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 139) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 77) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L426(lines 426 441) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 309) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 360) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 239) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 177) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 107) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L854 garLoopResultBuilder]: At program point L559(lines 26 563) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))) (.cse0 (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0)) (.cse4 (<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 2) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 2))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648))) (.cse5 (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~q~0#1| 4) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~q~0#1| 1) .cse4 .cse2 .cse3) (and .cse5 .cse0 (= 3 |ULTIMATE.start_main_~q~0#1|) .cse1 .cse2) (and .cse5 .cse0 (<= 5 |ULTIMATE.start_main_~q~0#1|) .cse4 .cse2) (and (= |ULTIMATE.start_main_~this_expect~0#1| 0) .cse5 (= |ULTIMATE.start_main_~q~0#1| 0)))) [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 541) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 409) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 460) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 339) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 277) no Hoare annotation was computed. [2022-02-20 16:07:39,112 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 207) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 75) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 509) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 560) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L428(lines 428 439) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 377) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 307) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 175) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 567) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 539) no Hoare annotation was computed. [2022-02-20 16:07:39,113 INFO L858 garLoopResultBuilder]: For program point L462(lines 462 477) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L396(lines 396 407) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L264(lines 264 275) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 134) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L496(lines 496 507) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 375) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 102) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 475) no Hoare annotation was computed. [2022-02-20 16:07:39,114 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-02-20 16:07:39,115 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 202) no Hoare annotation was computed. [2022-02-20 16:07:39,115 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-02-20 16:07:39,117 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:39,118 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:07:39,119 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:07:39,120 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:07:39,122 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:07:39,123 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-02-20 16:07:39,124 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:07:39,125 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:07:39,126 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:07:39,126 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-02-20 16:07:39,126 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-02-20 16:07:39,126 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:07:39,126 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:07:39,126 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-20 16:07:39,127 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:07:39,128 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:07:39,128 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:07:39,128 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:07:39,128 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:07:39,128 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:07:39,128 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L280 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L280 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-02-20 16:07:39,129 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L462 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L462 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 16:07:39,130 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-02-20 16:07:39,131 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-02-20 16:07:39,132 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 16:07:39,132 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 16:07:39,132 WARN L170 areAnnotationChecker]: L310 has no Hoare annotation [2022-02-20 16:07:39,132 WARN L170 areAnnotationChecker]: L310 has no Hoare annotation [2022-02-20 16:07:39,132 WARN L170 areAnnotationChecker]: L368 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L368 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L394 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L394 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L464 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L464 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L478 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L478 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:07:39,133 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L242 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L242 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2022-02-20 16:07:39,134 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2022-02-20 16:07:39,135 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2022-02-20 16:07:39,135 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2022-02-20 16:07:39,135 WARN L170 areAnnotationChecker]: L326 has no Hoare annotation [2022-02-20 16:07:39,135 WARN L170 areAnnotationChecker]: L326 has no Hoare annotation [2022-02-20 16:07:39,135 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L396 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L396 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L410 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L410 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L480 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L480 has no Hoare annotation [2022-02-20 16:07:39,136 WARN L170 areAnnotationChecker]: L494 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L494 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L328 has no Hoare annotation [2022-02-20 16:07:39,137 WARN L170 areAnnotationChecker]: L328 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L342 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L342 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L412 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L412 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L426 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L426 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-02-20 16:07:39,138 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L496 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L496 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L510 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L510 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2022-02-20 16:07:39,139 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L428 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L428 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L442 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L442 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L500 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L500 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L512 has no Hoare annotation [2022-02-20 16:07:39,140 WARN L170 areAnnotationChecker]: L512 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L526 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L526 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L432 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L432 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L444 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L444 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2022-02-20 16:07:39,141 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 16:07:39,142 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2022-02-20 16:07:39,143 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2022-02-20 16:07:39,143 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:07:39,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:07:39 BoogieIcfgContainer [2022-02-20 16:07:39,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:07:39,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:07:39,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:07:39,168 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:07:39,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:07:26" (3/4) ... [2022-02-20 16:07:39,171 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:07:39,190 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 16:07:39,191 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:07:39,191 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:07:39,191 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:07:39,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:07:39,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:07:39,219 INFO L158 Benchmark]: Toolchain (without parser) took 14119.29ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 75.0MB in the beginning and 75.1MB in the end (delta: -93.0kB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-02-20 16:07:39,219 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:07:39,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.02ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 74.7MB in the beginning and 90.3MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:07:39,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.56ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 83.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:07:39,220 INFO L158 Benchmark]: Boogie Preprocessor took 47.11ms. Allocated memory is still 125.8MB. Free memory was 83.1MB in the beginning and 79.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:07:39,221 INFO L158 Benchmark]: RCFGBuilder took 1000.15ms. Allocated memory is still 125.8MB. Free memory was 79.8MB in the beginning and 81.4MB in the end (delta: -1.6MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2022-02-20 16:07:39,221 INFO L158 Benchmark]: TraceAbstraction took 12475.51ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 80.8MB in the beginning and 77.2MB in the end (delta: 3.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-02-20 16:07:39,221 INFO L158 Benchmark]: Witness Printer took 49.62ms. Allocated memory is still 151.0MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:07:39,225 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.02ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 74.7MB in the beginning and 90.3MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.56ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 83.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.11ms. Allocated memory is still 125.8MB. Free memory was 83.1MB in the beginning and 79.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1000.15ms. Allocated memory is still 125.8MB. Free memory was 79.8MB in the beginning and 81.4MB in the end (delta: -1.6MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12475.51ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 80.8MB in the beginning and 77.2MB in the end (delta: 3.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 49.62ms. Allocated memory is still 151.0MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). There was no memory consumed. 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 - PositiveResult [Line: 567]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2409 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2409 mSDsluCounter, 4068 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2280 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 572 IncrementalHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 1788 mSDtfsCounter, 572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 96 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 164 HoareAnnotationTreeSize, 4 FomulaSimplifications, 343 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 426 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 2412 SizeOfPredicates, 7 NumberOfNonLiveVariables, 542 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 132/211 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((P8 / 4294967296 <= 0 && q == 4) && this_expect <= 2 * ((-1 + this_expect) / 2) + 1) && 0 <= P8 + 2147483648) && this_buffer_empty == 1) || ((((P8 / 4294967296 <= 0 && q == 1) && this_expect <= 2 * ((-2 + this_expect) / 2) + 2) && 0 <= P8 + 2147483648) && this_buffer_empty == 1)) || ((((this_buffer_empty == 0 && P8 / 4294967296 <= 0) && 3 == q) && this_expect <= 2 * ((-1 + this_expect) / 2) + 1) && 0 <= P8 + 2147483648)) || ((((this_buffer_empty == 0 && P8 / 4294967296 <= 0) && 5 <= q) && this_expect <= 2 * ((-2 + this_expect) / 2) + 2) && 0 <= P8 + 2147483648)) || ((this_expect == 0 && this_buffer_empty == 0) && q == 0) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((this_buffer_empty == 0 && P8 / 4294967296 <= 0) && 5 <= q) && this_expect <= 2 * ((-2 + this_expect) / 2) + 2) && 0 <= P8 + 2147483648) || ((this_expect == 0 && this_buffer_empty == 0) && q == 0) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:07:39,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Result: TRUE