./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:10:30,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:10:30,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:10:30,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:10:30,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:10:30,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:10:30,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:10:30,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:10:30,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:10:30,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:10:30,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:10:30,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:10:30,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:10:30,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:10:30,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:10:30,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:10:30,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:10:30,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:10:30,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:10:30,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:10:30,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:10:30,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:10:30,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:10:30,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:10:30,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:10:30,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:10:30,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:10:30,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:10:30,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:10:30,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:10:30,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:10:30,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:10:30,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:10:30,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:10:30,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:10:30,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:10:30,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:10:30,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:10:30,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:10:30,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:10:30,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:10:30,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:10:30,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:10:30,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:10:30,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:10:30,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:10:30,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:10:30,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:10:30,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:10:30,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:10:30,299 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:10:30,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:10:30,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:10:30,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:10:30,301 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:10:30,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:10:30,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:10:30,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:10:30,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:10:30,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:10:30,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:10:30,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:10:30,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:30,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:10:30,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:10:30,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:10:30,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:10:30,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:10:30,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:10:30,307 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef [2022-02-21 03:10:30,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:10:30,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:10:30,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:10:30,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:10:30,519 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:10:30,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-02-21 03:10:30,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11d78b38/1f2b76bddad34d3e8ab0634f0b793c1e/FLAG058c06f8f [2022-02-21 03:10:30,997 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:10:30,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-02-21 03:10:31,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11d78b38/1f2b76bddad34d3e8ab0634f0b793c1e/FLAG058c06f8f [2022-02-21 03:10:31,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11d78b38/1f2b76bddad34d3e8ab0634f0b793c1e [2022-02-21 03:10:31,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:10:31,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:10:31,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:31,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:10:31,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:10:31,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3123f3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31, skipping insertion in model container [2022-02-21 03:10:31,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:10:31,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:10:31,634 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-1.c[24818,24831] [2022-02-21 03:10:31,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:31,643 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:10:31,694 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-1.c[24818,24831] [2022-02-21 03:10:31,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:31,705 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:10:31,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31 WrapperNode [2022-02-21 03:10:31,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:31,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:31,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:10:31,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:10:31,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,791 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 469 [2022-02-21 03:10:31,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:31,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:10:31,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:10:31,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:10:31,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:10:31,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:10:31,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:10:31,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:10:31,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (1/1) ... [2022-02-21 03:10:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:31,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:31,899 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-21 03:10:31,915 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-21 03:10:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:10:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:10:31,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:10:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:10:32,007 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:10:32,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:10:32,923 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:10:32,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:10:32,934 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:10:32,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:32 BoogieIcfgContainer [2022-02-21 03:10:32,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:10:32,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:10:32,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:10:32,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:10:32,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:10:31" (1/3) ... [2022-02-21 03:10:32,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40747234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:32, skipping insertion in model container [2022-02-21 03:10:32,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:31" (2/3) ... [2022-02-21 03:10:32,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40747234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:32, skipping insertion in model container [2022-02-21 03:10:32,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:32" (3/3) ... [2022-02-21 03:10:32,941 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2022-02-21 03:10:32,945 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:10:32,945 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-02-21 03:10:32,990 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:10:32,996 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=FINITE_AUTOMATA, 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-21 03:10:32,996 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-02-21 03:10:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 152 states have (on average 1.9605263157894737) internal successors, (298), 194 states have internal predecessors, (298), 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-21 03:10:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:10:33,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:33,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:33,035 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:33,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1915241167, now seen corresponding path program 1 times [2022-02-21 03:10:33,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:33,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905459844] [2022-02-21 03:10:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:33,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#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; {198#true} is VALID [2022-02-21 03:10:33,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#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~short28#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_#t~nondet44#1, main_#t~short45#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; {200#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-21 03:10:33,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#(= |ULTIMATE.start_main_~q~0#1| 0)} goto; {200#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-21 03:10:33,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#(= |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; {200#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-21 03:10:33,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !(main_~this_expect~0#1 > 16); {200#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-21 03:10:33,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !(0 == main_~q~0#1); {199#false} is VALID [2022-02-21 03:10:33,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#false} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {199#false} is VALID [2022-02-21 03:10:33,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#false} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {199#false} is VALID [2022-02-21 03:10:33,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#false} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#1; {199#false} is VALID [2022-02-21 03:10:33,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#false} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {199#false} is VALID [2022-02-21 03:10:33,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#false} assume !(main_~this_expect~0#1 - 1 <= 2147483647); {199#false} is VALID [2022-02-21 03:10:33,257 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-21 03:10:33,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:33,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905459844] [2022-02-21 03:10:33,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905459844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:33,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:33,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:33,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373454897] [2022-02-21 03:10:33,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:33,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:10:33,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:33,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:33,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:33,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:33,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:33,304 INFO L87 Difference]: Start difference. First operand has 195 states, 152 states have (on average 1.9605263157894737) internal successors, (298), 194 states have internal predecessors, (298), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:33,781 INFO L93 Difference]: Finished difference Result 392 states and 602 transitions. [2022-02-21 03:10:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:33,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:10:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2022-02-21 03:10:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2022-02-21 03:10:33,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 602 transitions. [2022-02-21 03:10:34,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:34,221 INFO L225 Difference]: With dead ends: 392 [2022-02-21 03:10:34,222 INFO L226 Difference]: Without dead ends: 168 [2022-02-21 03:10:34,225 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-21 03:10:34,227 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 5 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:34,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 538 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-21 03:10:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-02-21 03:10:34,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:34,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 168 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 167 states have internal predecessors, (213), 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-21 03:10:34,254 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 168 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 167 states have internal predecessors, (213), 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-21 03:10:34,255 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 168 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 167 states have internal predecessors, (213), 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-21 03:10:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,259 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2022-02-21 03:10:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-02-21 03:10:34,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:34,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:34,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 167 states have internal predecessors, (213), 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 168 states. [2022-02-21 03:10:34,261 INFO L87 Difference]: Start difference. First operand has 168 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 167 states have internal predecessors, (213), 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 168 states. [2022-02-21 03:10:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,266 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2022-02-21 03:10:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-02-21 03:10:34,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:34,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:34,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:34,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 167 states have internal predecessors, (213), 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-21 03:10:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2022-02-21 03:10:34,273 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 11 [2022-02-21 03:10:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:34,273 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2022-02-21 03:10:34,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-02-21 03:10:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:10:34,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:34,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:34,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:10:34,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash 101136252, now seen corresponding path program 1 times [2022-02-21 03:10:34,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:34,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016569446] [2022-02-21 03:10:34,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:34,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#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; {1113#true} is VALID [2022-02-21 03:10:34,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#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~short28#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_#t~nondet44#1, main_#t~short45#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; {1113#true} is VALID [2022-02-21 03:10:34,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} goto; {1113#true} is VALID [2022-02-21 03:10:34,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {1113#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; {1113#true} is VALID [2022-02-21 03:10:34,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {1113#true} assume !(main_~this_expect~0#1 > 16); {1113#true} is VALID [2022-02-21 03:10:34,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1113#true} is VALID [2022-02-21 03:10:34,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {1113#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {1113#true} is VALID [2022-02-21 03:10:34,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#true} main_~method_id~0#1 := 1; {1113#true} is VALID [2022-02-21 03:10:34,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(= |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; {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(main_~this_expect~0#1 > 16); {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 == main_~q~0#1); {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(= |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; {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#1; {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:34,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {1115#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(main_~this_expect~0#1 - 1 <= 2147483647); {1114#false} is VALID [2022-02-21 03:10:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:34,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:34,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016569446] [2022-02-21 03:10:34,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016569446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:34,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:34,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:34,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797395197] [2022-02-21 03:10:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 03:10:34,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:34,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:34,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:34,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:34,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:34,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:34,348 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,633 INFO L93 Difference]: Finished difference Result 456 states and 625 transitions. [2022-02-21 03:10:34,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:34,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 03:10:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2022-02-21 03:10:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2022-02-21 03:10:34,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 612 transitions. [2022-02-21 03:10:34,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:34,999 INFO L225 Difference]: With dead ends: 456 [2022-02-21 03:10:35,000 INFO L226 Difference]: Without dead ends: 265 [2022-02-21 03:10:35,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 03:10:35,001 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 151 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:35,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 327 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-02-21 03:10:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2022-02-21 03:10:35,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:35,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 259 states, 217 states have (on average 1.6175115207373272) internal successors, (351), 258 states have internal predecessors, (351), 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-21 03:10:35,010 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 259 states, 217 states have (on average 1.6175115207373272) internal successors, (351), 258 states have internal predecessors, (351), 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-21 03:10:35,011 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 259 states, 217 states have (on average 1.6175115207373272) internal successors, (351), 258 states have internal predecessors, (351), 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-21 03:10:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,016 INFO L93 Difference]: Finished difference Result 265 states and 353 transitions. [2022-02-21 03:10:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 353 transitions. [2022-02-21 03:10:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:35,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:35,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 217 states have (on average 1.6175115207373272) internal successors, (351), 258 states have internal predecessors, (351), 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 265 states. [2022-02-21 03:10:35,018 INFO L87 Difference]: Start difference. First operand has 259 states, 217 states have (on average 1.6175115207373272) internal successors, (351), 258 states have internal predecessors, (351), 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 265 states. [2022-02-21 03:10:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,024 INFO L93 Difference]: Finished difference Result 265 states and 353 transitions. [2022-02-21 03:10:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 353 transitions. [2022-02-21 03:10:35,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:35,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:35,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:35,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 217 states have (on average 1.6175115207373272) internal successors, (351), 258 states have internal predecessors, (351), 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-21 03:10:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 351 transitions. [2022-02-21 03:10:35,032 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 351 transitions. Word has length 17 [2022-02-21 03:10:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:35,032 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 351 transitions. [2022-02-21 03:10:35,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2022-02-21 03:10:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:10:35,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:35,033 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:35,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:10:35,034 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2081470014, now seen corresponding path program 1 times [2022-02-21 03:10:35,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:35,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268453474] [2022-02-21 03:10:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:35,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {2380#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; {2380#true} is VALID [2022-02-21 03:10:35,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {2380#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~short28#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_#t~nondet44#1, main_#t~short45#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; {2380#true} is VALID [2022-02-21 03:10:35,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {2380#true} goto; {2380#true} is VALID [2022-02-21 03:10:35,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {2380#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; {2380#true} is VALID [2022-02-21 03:10:35,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {2380#true} assume !(main_~this_expect~0#1 > 16); {2380#true} is VALID [2022-02-21 03:10:35,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {2380#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {2380#true} is VALID [2022-02-21 03:10:35,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {2380#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {2380#true} is VALID [2022-02-21 03:10:35,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {2380#true} main_~method_id~0#1 := 1; {2380#true} is VALID [2022-02-21 03:10:35,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {2380#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#(= (+ (- 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; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume !(main_~this_expect~0#1 > 16); {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume !(0 == main_~q~0#1); {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~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; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 + main_~this_expect~0#1 <= 2147483647; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:35,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {2382#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume !(1 - main_~this_buffer_empty~0#1 <= 2147483647); {2381#false} is VALID [2022-02-21 03:10:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:35,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:35,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268453474] [2022-02-21 03:10:35,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268453474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:35,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:35,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:35,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870040729] [2022-02-21 03:10:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-02-21 03:10:35,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:35,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-21 03:10:35,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:35,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:35,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:35,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:35,122 INFO L87 Difference]: Start difference. First operand 259 states and 351 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-21 03:10:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,323 INFO L93 Difference]: Finished difference Result 364 states and 499 transitions. [2022-02-21 03:10:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-02-21 03:10:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-21 03:10:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-02-21 03:10:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-21 03:10:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-02-21 03:10:35,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 353 transitions. [2022-02-21 03:10:35,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:35,554 INFO L225 Difference]: With dead ends: 364 [2022-02-21 03:10:35,554 INFO L226 Difference]: Without dead ends: 356 [2022-02-21 03:10:35,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 03:10:35,557 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 123 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:35,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 386 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-21 03:10:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2022-02-21 03:10:35,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:35,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 350 states, 308 states have (on average 1.5714285714285714) internal successors, (484), 349 states have internal predecessors, (484), 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-21 03:10:35,568 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 350 states, 308 states have (on average 1.5714285714285714) internal successors, (484), 349 states have internal predecessors, (484), 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-21 03:10:35,568 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 350 states, 308 states have (on average 1.5714285714285714) internal successors, (484), 349 states have internal predecessors, (484), 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-21 03:10:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,576 INFO L93 Difference]: Finished difference Result 356 states and 491 transitions. [2022-02-21 03:10:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 491 transitions. [2022-02-21 03:10:35,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:35,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:35,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 308 states have (on average 1.5714285714285714) internal successors, (484), 349 states have internal predecessors, (484), 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 356 states. [2022-02-21 03:10:35,578 INFO L87 Difference]: Start difference. First operand has 350 states, 308 states have (on average 1.5714285714285714) internal successors, (484), 349 states have internal predecessors, (484), 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 356 states. [2022-02-21 03:10:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,586 INFO L93 Difference]: Finished difference Result 356 states and 491 transitions. [2022-02-21 03:10:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 491 transitions. [2022-02-21 03:10:35,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:35,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:35,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:35,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 308 states have (on average 1.5714285714285714) internal successors, (484), 349 states have internal predecessors, (484), 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-21 03:10:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 484 transitions. [2022-02-21 03:10:35,595 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 484 transitions. Word has length 19 [2022-02-21 03:10:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:35,595 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 484 transitions. [2022-02-21 03:10:35,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-21 03:10:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 484 transitions. [2022-02-21 03:10:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 03:10:35,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:35,596 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:35,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:10:35,597 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:35,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:35,597 INFO L85 PathProgramCache]: Analyzing trace with hash 851576329, now seen corresponding path program 1 times [2022-02-21 03:10:35,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:35,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587089239] [2022-02-21 03:10:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:35,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {3830#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; {3830#true} is VALID [2022-02-21 03:10:35,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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~short28#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_#t~nondet44#1, main_#t~short45#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; {3830#true} is VALID [2022-02-21 03:10:35,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} goto; {3830#true} is VALID [2022-02-21 03:10:35,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {3830#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; {3830#true} is VALID [2022-02-21 03:10:35,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {3830#true} assume !(main_~this_expect~0#1 > 16); {3830#true} is VALID [2022-02-21 03:10:35,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {3830#true} is VALID [2022-02-21 03:10:35,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {3830#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {3830#true} is VALID [2022-02-21 03:10:35,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} main_~method_id~0#1 := 1; {3830#true} is VALID [2022-02-21 03:10:35,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {3830#true} is VALID [2022-02-21 03:10:35,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#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; {3830#true} is VALID [2022-02-21 03:10:35,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume !(main_~this_expect~0#1 > 16); {3830#true} is VALID [2022-02-21 03:10:35,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {3830#true} assume !(0 == main_~q~0#1); {3830#true} is VALID [2022-02-21 03:10:35,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {3830#true} is VALID [2022-02-21 03:10:35,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {3830#true} is VALID [2022-02-21 03:10:35,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#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; {3830#true} is VALID [2022-02-21 03:10:35,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 + main_~this_expect~0#1 <= 2147483647; {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {3832#(= 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; {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume !(main_~this_expect~0#1 > 16); {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-21 03:10:35,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {3831#false} is VALID [2022-02-21 03:10:35,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {3831#false} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {3831#false} is VALID [2022-02-21 03:10:35,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {3831#false} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#1; {3831#false} is VALID [2022-02-21 03:10:35,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {3831#false} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3; {3831#false} is VALID [2022-02-21 03:10:35,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {3831#false} assume !(main_~this_expect~0#1 - 1 <= 2147483647); {3831#false} is VALID [2022-02-21 03:10:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:10:35,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:35,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587089239] [2022-02-21 03:10:35,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587089239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:35,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:35,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:35,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814285306] [2022-02-21 03:10:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:35,660 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 28 [2022-02-21 03:10:35,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:35,661 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-21 03:10:35,674 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-21 03:10:35,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:35,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:35,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:35,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:35,675 INFO L87 Difference]: Start difference. First operand 350 states and 484 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-21 03:10:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,837 INFO L93 Difference]: Finished difference Result 715 states and 996 transitions. [2022-02-21 03:10:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:35,837 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 28 [2022-02-21 03:10:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:35,837 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-21 03:10:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2022-02-21 03:10:35,839 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-21 03:10:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2022-02-21 03:10:35,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 425 transitions. [2022-02-21 03:10:36,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,064 INFO L225 Difference]: With dead ends: 715 [2022-02-21 03:10:36,064 INFO L226 Difference]: Without dead ends: 368 [2022-02-21 03:10:36,065 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-21 03:10:36,065 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 40 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 359 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-21 03:10:36,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-21 03:10:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-02-21 03:10:36,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:36,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 368 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 367 states have internal predecessors, (503), 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-21 03:10:36,072 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 368 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 367 states have internal predecessors, (503), 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-21 03:10:36,073 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 368 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 367 states have internal predecessors, (503), 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-21 03:10:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,079 INFO L93 Difference]: Finished difference Result 368 states and 503 transitions. [2022-02-21 03:10:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 503 transitions. [2022-02-21 03:10:36,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 367 states have internal predecessors, (503), 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 368 states. [2022-02-21 03:10:36,081 INFO L87 Difference]: Start difference. First operand has 368 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 367 states have internal predecessors, (503), 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 368 states. [2022-02-21 03:10:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,087 INFO L93 Difference]: Finished difference Result 368 states and 503 transitions. [2022-02-21 03:10:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 503 transitions. [2022-02-21 03:10:36,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:36,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 367 states have internal predecessors, (503), 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-21 03:10:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 503 transitions. [2022-02-21 03:10:36,094 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 503 transitions. Word has length 28 [2022-02-21 03:10:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:36,094 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 503 transitions. [2022-02-21 03:10:36,094 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-21 03:10:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 503 transitions. [2022-02-21 03:10:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:10:36,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:36,095 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:36,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:10:36,096 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1974679586, now seen corresponding path program 1 times [2022-02-21 03:10:36,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:36,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178157581] [2022-02-21 03:10:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {5686#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; {5686#true} is VALID [2022-02-21 03:10:36,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {5686#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~short28#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_#t~nondet44#1, main_#t~short45#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; {5686#true} is VALID [2022-02-21 03:10:36,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {5686#true} goto; {5686#true} is VALID [2022-02-21 03:10:36,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {5686#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; {5686#true} is VALID [2022-02-21 03:10:36,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {5686#true} assume !(main_~this_expect~0#1 > 16); {5686#true} is VALID [2022-02-21 03:10:36,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {5686#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {5686#true} is VALID [2022-02-21 03:10:36,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {5686#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {5686#true} is VALID [2022-02-21 03:10:36,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {5686#true} main_~method_id~0#1 := 1; {5686#true} is VALID [2022-02-21 03:10:36,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {5686#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {5686#true} is VALID [2022-02-21 03:10:36,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {5686#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; {5686#true} is VALID [2022-02-21 03:10:36,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {5686#true} assume !(main_~this_expect~0#1 > 16); {5686#true} is VALID [2022-02-21 03:10:36,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {5686#true} assume !(0 == main_~q~0#1); {5686#true} is VALID [2022-02-21 03:10:36,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {5686#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {5686#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {5686#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; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {5686#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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {5686#true} assume 1 + main_~this_expect~0#1 <= 2147483647; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {5686#true} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {5686#true} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {5686#true} is VALID [2022-02-21 03:10:36,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {5686#true} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {5686#true} is VALID [2022-02-21 03:10:36,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {5686#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; {5686#true} is VALID [2022-02-21 03:10:36,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {5686#true} assume !(main_~this_expect~0#1 > 16); {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !(0 == main_~q~0#1); {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !(1 == main_~q~0#1); {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !(2 == main_~q~0#1); {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !main_#t~short28#1; {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} is VALID [2022-02-21 03:10:36,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {5688#(<= |ULTIMATE.start_main_~this_expect~0#1| 16)} assume !(main_~this_expect~0#1 - 1 <= 2147483647); {5687#false} is VALID [2022-02-21 03:10:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:36,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:36,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178157581] [2022-02-21 03:10:36,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178157581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:36,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:36,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:36,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213413297] [2022-02-21 03:10:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:36,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-21 03:10:36,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:36,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 03:10:36,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:36,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:36,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:36,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:36,168 INFO L87 Difference]: Start difference. First operand 368 states and 503 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 03:10:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,344 INFO L93 Difference]: Finished difference Result 720 states and 1009 transitions. [2022-02-21 03:10:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-21 03:10:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 03:10:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-02-21 03:10:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 03:10:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-02-21 03:10:36,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 417 transitions. [2022-02-21 03:10:36,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,575 INFO L225 Difference]: With dead ends: 720 [2022-02-21 03:10:36,575 INFO L226 Difference]: Without dead ends: 355 [2022-02-21 03:10:36,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 03:10:36,576 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 166 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:36,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 158 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-02-21 03:10:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2022-02-21 03:10:36,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:36,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 351 states, 326 states have (on average 1.4846625766871167) internal successors, (484), 350 states have internal predecessors, (484), 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-21 03:10:36,596 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 351 states, 326 states have (on average 1.4846625766871167) internal successors, (484), 350 states have internal predecessors, (484), 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-21 03:10:36,596 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 351 states, 326 states have (on average 1.4846625766871167) internal successors, (484), 350 states have internal predecessors, (484), 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-21 03:10:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,602 INFO L93 Difference]: Finished difference Result 355 states and 489 transitions. [2022-02-21 03:10:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 489 transitions. [2022-02-21 03:10:36,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 326 states have (on average 1.4846625766871167) internal successors, (484), 350 states have internal predecessors, (484), 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 355 states. [2022-02-21 03:10:36,604 INFO L87 Difference]: Start difference. First operand has 351 states, 326 states have (on average 1.4846625766871167) internal successors, (484), 350 states have internal predecessors, (484), 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 355 states. [2022-02-21 03:10:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,612 INFO L93 Difference]: Finished difference Result 355 states and 489 transitions. [2022-02-21 03:10:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 489 transitions. [2022-02-21 03:10:36,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:36,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 326 states have (on average 1.4846625766871167) internal successors, (484), 350 states have internal predecessors, (484), 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-21 03:10:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 484 transitions. [2022-02-21 03:10:36,619 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 484 transitions. Word has length 31 [2022-02-21 03:10:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:36,619 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 484 transitions. [2022-02-21 03:10:36,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 03:10:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 484 transitions. [2022-02-21 03:10:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:10:36,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:36,620 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:36,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:10:36,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:36,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1085523680, now seen corresponding path program 1 times [2022-02-21 03:10:36,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:36,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043318989] [2022-02-21 03:10:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {7510#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; {7510#true} is VALID [2022-02-21 03:10:36,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {7510#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~short28#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_#t~nondet44#1, main_#t~short45#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; {7510#true} is VALID [2022-02-21 03:10:36,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7510#true} goto; {7510#true} is VALID [2022-02-21 03:10:36,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {7510#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; {7510#true} is VALID [2022-02-21 03:10:36,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {7510#true} assume !(main_~this_expect~0#1 > 16); {7510#true} is VALID [2022-02-21 03:10:36,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {7510#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {7510#true} is VALID [2022-02-21 03:10:36,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {7510#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {7510#true} is VALID [2022-02-21 03:10:36,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {7510#true} main_~method_id~0#1 := 1; {7510#true} is VALID [2022-02-21 03:10:36,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {7510#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {7510#true} is VALID [2022-02-21 03:10:36,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {7510#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; {7510#true} is VALID [2022-02-21 03:10:36,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {7510#true} assume !(main_~this_expect~0#1 > 16); {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {7510#true} assume !(0 == main_~q~0#1); {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {7510#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {7510#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {7510#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; {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {7510#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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {7510#true} assume 1 + main_~this_expect~0#1 <= 2147483647; {7510#true} is VALID [2022-02-21 03:10:36,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {7510#true} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {7510#true} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {7510#true} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {7510#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; {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {7510#true} assume !(main_~this_expect~0#1 > 16); {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {7510#true} assume !(0 == main_~q~0#1); {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {7510#true} assume !(1 == main_~q~0#1); {7510#true} is VALID [2022-02-21 03:10:36,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {7510#true} assume !(2 == main_~q~0#1); {7510#true} is VALID [2022-02-21 03:10:36,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {7510#true} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {7510#true} is VALID [2022-02-21 03:10:36,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {7510#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {7510#true} is VALID [2022-02-21 03:10:36,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {7510#true} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {7510#true} is VALID [2022-02-21 03:10:36,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {7510#true} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {7510#true} is VALID [2022-02-21 03:10:36,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {7510#true} assume main_#t~short28#1; {7512#|ULTIMATE.start_main_#t~short28#1|} is VALID [2022-02-21 03:10:36,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {7512#|ULTIMATE.start_main_#t~short28#1|} assume !main_#t~short28#1;havoc main_#t~short28#1;main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1; {7511#false} is VALID [2022-02-21 03:10:36,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {7511#false} assume !(1 - main_~this_buffer_empty~0#1 <= 2147483647); {7511#false} is VALID [2022-02-21 03:10:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:36,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:36,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043318989] [2022-02-21 03:10:36,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043318989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:36,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:36,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:36,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128138035] [2022-02-21 03:10:36,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:36,710 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 32 [2022-02-21 03:10:36,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:36,711 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-21 03:10:36,723 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-21 03:10:36,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:36,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:36,724 INFO L87 Difference]: Start difference. First operand 351 states and 484 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-21 03:10:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,869 INFO L93 Difference]: Finished difference Result 702 states and 968 transitions. [2022-02-21 03:10:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:36,870 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 32 [2022-02-21 03:10:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:36,870 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-21 03:10:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2022-02-21 03:10:36,872 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-21 03:10:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2022-02-21 03:10:36,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 381 transitions. [2022-02-21 03:10:37,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:37,089 INFO L225 Difference]: With dead ends: 702 [2022-02-21 03:10:37,089 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 03:10:37,090 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-21 03:10:37,091 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:37,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 03:10:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-02-21 03:10:37,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:37,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 351 states, 326 states have (on average 1.4754601226993864) internal successors, (481), 350 states have internal predecessors, (481), 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-21 03:10:37,104 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 351 states, 326 states have (on average 1.4754601226993864) internal successors, (481), 350 states have internal predecessors, (481), 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-21 03:10:37,104 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 351 states, 326 states have (on average 1.4754601226993864) internal successors, (481), 350 states have internal predecessors, (481), 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-21 03:10:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:37,109 INFO L93 Difference]: Finished difference Result 351 states and 481 transitions. [2022-02-21 03:10:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 481 transitions. [2022-02-21 03:10:37,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:37,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:37,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 326 states have (on average 1.4754601226993864) internal successors, (481), 350 states have internal predecessors, (481), 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 351 states. [2022-02-21 03:10:37,111 INFO L87 Difference]: Start difference. First operand has 351 states, 326 states have (on average 1.4754601226993864) internal successors, (481), 350 states have internal predecessors, (481), 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 351 states. [2022-02-21 03:10:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:37,117 INFO L93 Difference]: Finished difference Result 351 states and 481 transitions. [2022-02-21 03:10:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 481 transitions. [2022-02-21 03:10:37,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:37,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:37,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:37,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 326 states have (on average 1.4754601226993864) internal successors, (481), 350 states have internal predecessors, (481), 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-21 03:10:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 481 transitions. [2022-02-21 03:10:37,124 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 481 transitions. Word has length 32 [2022-02-21 03:10:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:37,124 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 481 transitions. [2022-02-21 03:10:37,125 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-21 03:10:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 481 transitions. [2022-02-21 03:10:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:10:37,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:37,125 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:37,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:10:37,126 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1085525346, now seen corresponding path program 1 times [2022-02-21 03:10:37,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:37,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401414554] [2022-02-21 03:10:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {9308#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; {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {9308#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~short28#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_#t~nondet44#1, main_#t~short45#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; {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {9308#true} goto; {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {9308#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; {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {9308#true} assume !(main_~this_expect~0#1 > 16); {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {9308#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {9308#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {9308#true} is VALID [2022-02-21 03:10:37,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {9308#true} main_~method_id~0#1 := 1; {9308#true} is VALID [2022-02-21 03:10:37,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {9308#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {9310#(= |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; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(main_~this_expect~0#1 > 16); {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 == main_~q~0#1); {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {9310#(= |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; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {9310#(= |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; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {9310#(= |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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 1 + main_~this_expect~0#1 <= 2147483647; {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:37,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {9310#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~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; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(main_~this_expect~0#1 > 16); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 == main_~q~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(1 == main_~q~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(2 == main_~q~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !main_#t~short28#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume main_~this_expect~0#1 - 1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(main_~this_expect~0#1 - 1 >= -2147483648); {9309#false} is VALID [2022-02-21 03:10:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:37,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:37,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401414554] [2022-02-21 03:10:37,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401414554] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:37,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669308720] [2022-02-21 03:10:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:37,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:37,200 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-21 03:10:37,205 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-21 03:10:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:10:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {9308#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; {9308#true} is VALID [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {9308#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~short28#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_#t~nondet44#1, main_#t~short45#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; {9308#true} is VALID [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {9308#true} goto; {9308#true} is VALID [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {9308#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; {9308#true} is VALID [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {9308#true} assume !(main_~this_expect~0#1 > 16); {9308#true} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {9308#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {9308#true} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {9308#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {9308#true} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {9308#true} main_~method_id~0#1 := 1; {9308#true} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {9308#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~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; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(main_~this_expect~0#1 > 16); {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 == main_~q~0#1); {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~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; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 + main_~this_expect~0#1 <= 2147483647; {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {9339#(<= 0 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~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; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(main_~this_expect~0#1 > 16); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 == main_~q~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(1 == main_~q~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(2 == main_~q~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !main_#t~short28#1; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume main_~this_expect~0#1 - 1 <= 2147483647; {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} is VALID [2022-02-21 03:10:37,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {9311#(<= 1 |ULTIMATE.start_main_~this_expect~0#1|)} assume !(main_~this_expect~0#1 - 1 >= -2147483648); {9309#false} is VALID [2022-02-21 03:10:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:37,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:37,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669308720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:37,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:37,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-02-21 03:10:37,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989886394] [2022-02-21 03:10:37,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-02-21 03:10:37,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:37,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-21 03:10:37,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:37,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:37,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:37,445 INFO L87 Difference]: Start difference. First operand 351 states and 481 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-21 03:10:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:37,879 INFO L93 Difference]: Finished difference Result 519 states and 690 transitions. [2022-02-21 03:10:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-02-21 03:10:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-21 03:10:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2022-02-21 03:10:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-21 03:10:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2022-02-21 03:10:37,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 514 transitions. [2022-02-21 03:10:38,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:38,228 INFO L225 Difference]: With dead ends: 519 [2022-02-21 03:10:38,228 INFO L226 Difference]: Without dead ends: 476 [2022-02-21 03:10:38,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:38,230 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 277 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:38,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 574 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-02-21 03:10:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 359. [2022-02-21 03:10:38,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:38,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 476 states. Second operand has 359 states, 334 states have (on average 1.4820359281437125) internal successors, (495), 358 states have internal predecessors, (495), 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-21 03:10:38,251 INFO L74 IsIncluded]: Start isIncluded. First operand 476 states. Second operand has 359 states, 334 states have (on average 1.4820359281437125) internal successors, (495), 358 states have internal predecessors, (495), 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-21 03:10:38,251 INFO L87 Difference]: Start difference. First operand 476 states. Second operand has 359 states, 334 states have (on average 1.4820359281437125) internal successors, (495), 358 states have internal predecessors, (495), 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-21 03:10:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:38,261 INFO L93 Difference]: Finished difference Result 476 states and 647 transitions. [2022-02-21 03:10:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 647 transitions. [2022-02-21 03:10:38,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:38,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:38,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 334 states have (on average 1.4820359281437125) internal successors, (495), 358 states have internal predecessors, (495), 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 476 states. [2022-02-21 03:10:38,263 INFO L87 Difference]: Start difference. First operand has 359 states, 334 states have (on average 1.4820359281437125) internal successors, (495), 358 states have internal predecessors, (495), 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 476 states. [2022-02-21 03:10:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:38,274 INFO L93 Difference]: Finished difference Result 476 states and 647 transitions. [2022-02-21 03:10:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 647 transitions. [2022-02-21 03:10:38,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:38,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:38,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:38,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 334 states have (on average 1.4820359281437125) internal successors, (495), 358 states have internal predecessors, (495), 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-21 03:10:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 495 transitions. [2022-02-21 03:10:38,282 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 495 transitions. Word has length 32 [2022-02-21 03:10:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:38,282 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 495 transitions. [2022-02-21 03:10:38,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-21 03:10:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 495 transitions. [2022-02-21 03:10:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:10:38,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:38,283 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:38,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:38,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:38,500 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 384460768, now seen corresponding path program 1 times [2022-02-21 03:10:38,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:38,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856061363] [2022-02-21 03:10:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {11273#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~short28#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_#t~nondet44#1, main_#t~short45#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; {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {11273#true} goto; {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {11273#true} assume !(main_~this_expect~0#1 > 16); {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {11273#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {11273#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {11273#true} is VALID [2022-02-21 03:10:38,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {11273#true} main_~method_id~0#1 := 1; {11273#true} is VALID [2022-02-21 03:10:38,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {11273#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {11275#(= |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; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(main_~this_expect~0#1 > 16); {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume !(0 == main_~q~0#1); {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {11275#(= |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; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {11275#(= |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; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {11275#(= |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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 1 + main_~this_expect~0#1 <= 2147483647; {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} is VALID [2022-02-21 03:10:38,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {11275#(= |ULTIMATE.start_main_~this_expect~0#1| 0)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} is VALID [2022-02-21 03:10:38,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} is VALID [2022-02-21 03:10:38,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} is VALID [2022-02-21 03:10:38,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {11276#(<= |ULTIMATE.start_main_~this_expect~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; {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} is VALID [2022-02-21 03:10:38,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {11276#(<= |ULTIMATE.start_main_~this_expect~0#1| 1)} assume main_~this_expect~0#1 > 16;main_~this_expect~0#1 := -16; {11274#false} is VALID [2022-02-21 03:10:38,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {11274#false} assume !(0 == main_~q~0#1); {11274#false} is VALID [2022-02-21 03:10:38,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {11274#false} assume !(1 == main_~q~0#1); {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {11274#false} assume !(2 == main_~q~0#1); {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {11274#false} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {11274#false} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {11274#false} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {11274#false} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#false} assume !main_#t~short28#1; {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {11274#false} assume main_~this_expect~0#1 - 1 <= 2147483647; {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {11274#false} assume !(main_~this_expect~0#1 - 1 >= -2147483648); {11274#false} is VALID [2022-02-21 03:10:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:38,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:38,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856061363] [2022-02-21 03:10:38,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856061363] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:38,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370667495] [2022-02-21 03:10:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:38,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:38,580 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-21 03:10:38,581 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-21 03:10:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:38,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:38,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {11273#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~short28#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_#t~nondet44#1, main_#t~short45#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; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {11273#true} goto; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {11273#true} assume !(main_~this_expect~0#1 > 16); {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {11273#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {11273#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {11273#true} main_~method_id~0#1 := 1; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {11273#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {11273#true} assume !(main_~this_expect~0#1 > 16); {11273#true} is VALID [2022-02-21 03:10:38,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {11273#true} assume !(0 == main_~q~0#1); {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {11273#true} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#true} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {11273#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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {11273#true} assume 1 + main_~this_expect~0#1 <= 2147483647; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {11273#true} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {11273#true} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {11273#true} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {11273#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; {11273#true} is VALID [2022-02-21 03:10:38,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {11273#true} assume main_~this_expect~0#1 > 16;main_~this_expect~0#1 := -16; {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !(0 == main_~q~0#1); {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !(1 == main_~q~0#1); {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !(2 == main_~q~0#1); {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !main_#t~short28#1; {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume main_~this_expect~0#1 - 1 <= 2147483647; {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} is VALID [2022-02-21 03:10:38,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {11343#(<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|))} assume !(main_~this_expect~0#1 - 1 >= -2147483648); {11274#false} is VALID [2022-02-21 03:10:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:38,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:38,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370667495] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:38,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:38,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-02-21 03:10:38,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756019931] [2022-02-21 03:10:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-21 03:10:38,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:38,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:38,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:38,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:38,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:38,793 INFO L87 Difference]: Start difference. First operand 359 states and 495 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:38,949 INFO L93 Difference]: Finished difference Result 359 states and 495 transitions. [2022-02-21 03:10:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:38,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-21 03:10:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-21 03:10:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-21 03:10:38,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 190 transitions. [2022-02-21 03:10:39,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:39,069 INFO L225 Difference]: With dead ends: 359 [2022-02-21 03:10:39,070 INFO L226 Difference]: Without dead ends: 316 [2022-02-21 03:10:39,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:39,070 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:39,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 147 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-21 03:10:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 215. [2022-02-21 03:10:39,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:39,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 215 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 214 states have internal predecessors, (300), 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-21 03:10:39,089 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 215 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 214 states have internal predecessors, (300), 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-21 03:10:39,089 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 215 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 214 states have internal predecessors, (300), 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-21 03:10:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:39,094 INFO L93 Difference]: Finished difference Result 316 states and 452 transitions. [2022-02-21 03:10:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2022-02-21 03:10:39,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:39,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:39,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 214 states have internal predecessors, (300), 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 316 states. [2022-02-21 03:10:39,095 INFO L87 Difference]: Start difference. First operand has 215 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 214 states have internal predecessors, (300), 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 316 states. [2022-02-21 03:10:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:39,100 INFO L93 Difference]: Finished difference Result 316 states and 452 transitions. [2022-02-21 03:10:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2022-02-21 03:10:39,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:39,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:39,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:39,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 214 states have internal predecessors, (300), 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-21 03:10:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 300 transitions. [2022-02-21 03:10:39,118 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 300 transitions. Word has length 32 [2022-02-21 03:10:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:39,118 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 300 transitions. [2022-02-21 03:10:39,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 300 transitions. [2022-02-21 03:10:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-21 03:10:39,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:39,119 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:39,139 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-21 03:10:39,335 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,SelfDestructingSolverStorable7 [2022-02-21 03:10:39,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-02-21 03:10:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:39,336 INFO L85 PathProgramCache]: Analyzing trace with hash -487184860, now seen corresponding path program 1 times [2022-02-21 03:10:39,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:39,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848147132] [2022-02-21 03:10:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:39,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {12604#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; {12604#true} is VALID [2022-02-21 03:10:39,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {12604#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~short28#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_#t~nondet44#1, main_#t~short45#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; {12604#true} is VALID [2022-02-21 03:10:39,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {12604#true} goto; {12604#true} is VALID [2022-02-21 03:10:39,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {12604#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; {12604#true} is VALID [2022-02-21 03:10:39,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {12604#true} assume !(main_~this_expect~0#1 > 16); {12604#true} is VALID [2022-02-21 03:10:39,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {12604#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {12604#true} is VALID [2022-02-21 03:10:39,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {12604#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {12604#true} is VALID [2022-02-21 03:10:39,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {12604#true} main_~method_id~0#1 := 1; {12604#true} is VALID [2022-02-21 03:10:39,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {12604#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {12606#(= (+ (- 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; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume !(main_~this_expect~0#1 > 16); {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume !(0 == main_~q~0#1); {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~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; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 + main_~this_expect~0#1 <= 2147483647; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} is VALID [2022-02-21 03:10:39,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {12606#(= (+ (- 1) |ULTIMATE.start_main_~this_buffer_empty~0#1|) 0)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~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; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(main_~this_expect~0#1 > 16); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(0 == main_~q~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(1 == main_~q~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(2 == main_~q~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !main_#t~short28#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume main_~this_expect~0#1 - 1 <= 2147483647; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume main_~this_expect~0#1 - 1 >= -2147483648;main_#t~short28#1 := (main_~P3~0#1 != (if main_~this_expect~0#1 - 1 < 0 && 0 != (main_~this_expect~0#1 - 1) % 2 then (main_~this_expect~0#1 - 1) % 2 - 2 else (main_~this_expect~0#1 - 1) % 2) && 1 != main_~this_buffer_empty~0#1) && !(0 != main_~P3~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !main_#t~short28#1;havoc main_#t~short28#1;main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(1 - main_~this_buffer_empty~0#1 <= 2147483647); {12605#false} is VALID [2022-02-21 03:10:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:39,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:39,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848147132] [2022-02-21 03:10:39,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848147132] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:39,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959083659] [2022-02-21 03:10:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:39,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:39,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:39,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:39,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:10:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:10:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {12604#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; {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {12604#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~short28#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_#t~nondet44#1, main_#t~short45#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; {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {12604#true} goto; {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {12604#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; {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {12604#true} assume !(main_~this_expect~0#1 > 16); {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {12604#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {12604#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {12604#true} is VALID [2022-02-21 03:10:39,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {12604#true} main_~method_id~0#1 := 1; {12604#true} is VALID [2022-02-21 03:10:39,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {12604#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {12635#(<= |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; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume !(main_~this_expect~0#1 > 16); {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume !(0 == main_~q~0#1); {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {12635#(<= |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; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {12635#(<= |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; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {12635#(<= |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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 1 + main_~this_expect~0#1 <= 2147483647; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} is VALID [2022-02-21 03:10:39,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {12635#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~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; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(main_~this_expect~0#1 > 16); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(0 == main_~q~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(1 == main_~q~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(2 == main_~q~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !main_#t~short28#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume main_~this_expect~0#1 - 1 <= 2147483647; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume main_~this_expect~0#1 - 1 >= -2147483648;main_#t~short28#1 := (main_~P3~0#1 != (if main_~this_expect~0#1 - 1 < 0 && 0 != (main_~this_expect~0#1 - 1) % 2 then (main_~this_expect~0#1 - 1) % 2 - 2 else (main_~this_expect~0#1 - 1) % 2) && 1 != main_~this_buffer_empty~0#1) && !(0 != main_~P3~0#1); {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !main_#t~short28#1;havoc main_#t~short28#1;main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1; {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} is VALID [2022-02-21 03:10:39,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {12607#(<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|)} assume !(1 - main_~this_buffer_empty~0#1 <= 2147483647); {12605#false} is VALID [2022-02-21 03:10:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:39,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:39,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(1 - main_~this_buffer_empty~0#1 <= 2147483647); {12605#false} is VALID [2022-02-21 03:10:39,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !main_#t~short28#1;havoc main_#t~short28#1;main_~q~0#1 := 4;main_~this_expect~0#1 := main_~this_expect~0#1; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume main_~this_expect~0#1 - 1 >= -2147483648;main_#t~short28#1 := (main_~P3~0#1 != (if main_~this_expect~0#1 - 1 < 0 && 0 != (main_~this_expect~0#1 - 1) % 2 then (main_~this_expect~0#1 - 1) % 2 - 2 else (main_~this_expect~0#1 - 1) % 2) && 1 != main_~this_buffer_empty~0#1) && !(0 != main_~P3~0#1); {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume main_~this_expect~0#1 - 1 <= 2147483647; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !main_#t~short28#1; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(0 != main_~P1~0#1);main_~method_id~0#1 := 3;main_#t~short28#1 := 1 == main_~this_buffer_empty~0#1 && !(0 != main_~P3~0#1); {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume 0 != main_#t~nondet27#1;havoc main_#t~nondet27#1; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume -2147483648 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 2147483647; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(2 == main_~q~0#1); {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(1 == main_~q~0#1); {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(0 == main_~q~0#1); {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} assume !(main_~this_expect~0#1 > 16); {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} 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; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume 1 - main_~this_buffer_empty~0#1 >= -2147483648;main_~this_buffer_empty~0#1 := 1 - main_~this_buffer_empty~0#1; {12711#(<= 0 (+ |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483646))} is VALID [2022-02-21 03:10:39,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume 1 - main_~this_buffer_empty~0#1 <= 2147483647; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume 1 + main_~this_expect~0#1 >= -2147483648;main_~this_expect~0#1 := 1 + main_~this_expect~0#1; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume 1 + main_~this_expect~0#1 <= 2147483647; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} 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) != (if main_~this_expect~0#1 < 0 && 0 != main_~this_expect~0#1 % 2 then main_~this_expect~0#1 % 2 - 2 else main_~this_expect~0#1 % 2) && 1 == main_~this_buffer_empty~0#1) && !(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 && !(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; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} 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; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume !(0 == main_~q~0#1); {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} assume !(main_~this_expect~0#1 > 16); {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} 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; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {12604#true} assume !false;main_~q~0#1 := 1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 1; {12754#(<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 2147483647)} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {12604#true} main_~method_id~0#1 := 1; {12604#true} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {12604#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1; {12604#true} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {12604#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {12604#true} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {12604#true} assume !(main_~this_expect~0#1 > 16); {12604#true} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {12604#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; {12604#true} is VALID [2022-02-21 03:10:39,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {12604#true} goto; {12604#true} is VALID [2022-02-21 03:10:39,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {12604#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~short28#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_#t~nondet44#1, main_#t~short45#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; {12604#true} is VALID [2022-02-21 03:10:39,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {12604#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; {12604#true} is VALID [2022-02-21 03:10:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:39,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959083659] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:39,775 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:39,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 03:10:39,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991439263] [2022-02-21 03:10:39,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-21 03:10:39,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:39,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-21 03:10:39,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:39,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:10:39,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:39,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:10:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:39,820 INFO L87 Difference]: Start difference. First operand 215 states and 300 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-21 03:10:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,097 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2022-02-21 03:10:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-21 03:10:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-21 03:10:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2022-02-21 03:10:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-21 03:10:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2022-02-21 03:10:40,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 283 transitions. [2022-02-21 03:10:40,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:40,278 INFO L225 Difference]: With dead ends: 221 [2022-02-21 03:10:40,278 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:10:40,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:10:40,279 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 369 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:40,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 260 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:10:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:10:40,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:40,280 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-21 03:10:40,280 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-21 03:10:40,280 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-21 03:10:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,280 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:10:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:10:40,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:40,280 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-21 03:10:40,282 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-21 03:10:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,282 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:10:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:10:40,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:40,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:40,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:40,282 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-21 03:10:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:10:40,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-02-21 03:10:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:40,282 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:10:40,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-21 03:10:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:10:40,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,284 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2022-02-21 03:10:40,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2022-02-21 03:10:40,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2022-02-21 03:10:40,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2022-02-21 03:10:40,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2022-02-21 03:10:40,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2022-02-21 03:10:40,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2022-02-21 03:10:40,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2022-02-21 03:10:40,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2022-02-21 03:10:40,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2022-02-21 03:10:40,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2022-02-21 03:10:40,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2022-02-21 03:10:40,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2022-02-21 03:10:40,291 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2022-02-21 03:10:40,291 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2022-02-21 03:10:40,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:40,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:40,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L498(lines 498 513) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 564) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 443) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 252) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 381) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L300(lines 300 311) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 179) no Hoare annotation was computed. [2022-02-21 03:10:40,609 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 543) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 388) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 481) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 411) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 279) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 536) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L136-1(line 136) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L136-2(lines 136 138) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 511) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 388) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 379) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 488) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L236-1(line 236) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L236-2(lines 236 238) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 106) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 479) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L336(line 336) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L336-1(line 336) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L336-2(lines 336 338) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 206) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 74) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L436(line 436) no Hoare annotation was computed. [2022-02-21 03:10:40,610 INFO L858 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L436-2(lines 436 438) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 306) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 174) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 26 567) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L536-1(line 536) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 536 538) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 406) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 236) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L272(lines 272 274) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 506) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 374) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 236) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 352) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L472(lines 472 474) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 488) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 136) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 288) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,611 INFO L858 garLoopResultBuilder]: For program point L78-3(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 288) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L46(lines 46 61) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 161) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 552) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 261) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 129) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 59) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 536) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 88) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L346(lines 346 361) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 229) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 159) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 97) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L861 garLoopResultBuilder]: At program point L16(lines 16 572) the Hoare annotation is: true [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 461) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 88) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L314(lines 314 329) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 259) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 197) no Hoare annotation was computed. [2022-02-21 03:10:40,612 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 127) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 561) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 429) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 359) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 297) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 227) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 95) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 252) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 529) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 459) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 397) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 327) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 195) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 436) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L548(lines 548 559) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L482(lines 482 497) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 427) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 295) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L152-1(line 152) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L152-2(lines 152 154) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 152) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 527) no Hoare annotation was computed. [2022-02-21 03:10:40,613 INFO L858 garLoopResultBuilder]: For program point L384(lines 384 395) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L252(line 252) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L252-1(line 252) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L252-2(lines 252 254) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 122) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 152) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 495) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L352(line 352) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L352-1(line 352) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L352-2(lines 352 354) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L220(lines 220 222) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 294) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L88-2(lines 88 90) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L452(line 452) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L452-1(line 452) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L452-2(lines 452 454) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L320(lines 320 322) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L188-1(line 188) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L188-2(lines 188 190) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 294) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L552-2(line 552) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L552-3(line 552) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L420(lines 420 422) no Hoare annotation was computed. [2022-02-21 03:10:40,614 INFO L858 garLoopResultBuilder]: For program point L552-4(lines 552 554) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L288-2(line 288) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L288-3(line 288) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L288-4(lines 288 290) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L861 garLoopResultBuilder]: At program point L553(lines 16 572) the Hoare annotation is: true [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 522) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L388(line 388) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L388-1(line 388) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L388-2(lines 388 390) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 552) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L488(line 488) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L488-1(line 488) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L488-2(lines 488 490) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 567) the Hoare annotation is: (and (<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|)) (<= |ULTIMATE.start_main_~this_expect~0#1| 16) (<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|) (<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point L26-3(lines 26 567) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 136) no Hoare annotation was computed. [2022-02-21 03:10:40,615 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 352) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 452) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L558-1(line 558) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L426-1(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L426-2(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L426-3(line 426) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L294(line 294) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L294-1(line 294) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 188) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 145) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 188) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L230(lines 230 245) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L98(lines 98 113) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 164) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 336) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 452) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 345) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 213) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 264) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 143) no Hoare annotation was computed. [2022-02-21 03:10:40,616 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 81) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 336) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L430(lines 430 445) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 313) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 364) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 243) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 181) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 111) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 436) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L854 garLoopResultBuilder]: At program point L563(lines 26 567) the Hoare annotation is: (and (<= 0 (+ 16 |ULTIMATE.start_main_~this_expect~0#1|)) (<= 0 |ULTIMATE.start_main_~this_buffer_empty~0#1|) (<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 545) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 413) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 464) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 343) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 281) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 211) no Hoare annotation was computed. [2022-02-21 03:10:40,617 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 79) no Hoare annotation was computed. [2022-02-21 03:10:40,619 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:40,620 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:10:40,623 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:10:40,623 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-21 03:10:40,625 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L365 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L365 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L198 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L198 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L465 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L465 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-21 03:10:40,626 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L368 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L368 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L382 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L382 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L466 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L466 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L188-1 has no Hoare annotation [2022-02-21 03:10:40,627 WARN L170 areAnnotationChecker]: L188-1 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L314 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L314 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L188-2 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L188-2 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-02-21 03:10:40,628 WARN L170 areAnnotationChecker]: L288-4 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L288-4 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L288-2 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L288-2 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L330 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L330 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L414 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L414 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L472 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L472 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L498 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L498 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L288-3 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L288-3 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2022-02-21 03:10:40,629 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L388-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L388-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L430 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L430 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L488 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L488 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L500 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L500 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L236-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L236-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L294-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L294-1 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L388-2 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L388-2 has no Hoare annotation [2022-02-21 03:10:40,630 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L432 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L432 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L446 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L446 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L488-1 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L488-1 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L504 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L504 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L152-2 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L152-2 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L236-2 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L236-2 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L252-1 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L252-1 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L336-1 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L336-1 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L352 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L352 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L426 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L426 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L436 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L436 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L488-2 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L488-2 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-02-21 03:10:40,631 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L252-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L252-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L336-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L336-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L352-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L352-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L426-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L426-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L436-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L436-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L352-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L352-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L426-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L426-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L436-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L436-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L452-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L452-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L536-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L536-1 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L426-3 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L426-3 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L452-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L452-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2022-02-21 03:10:40,632 WARN L170 areAnnotationChecker]: L552-4 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L552-4 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L552-3 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L552-3 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L558-1 has no Hoare annotation [2022-02-21 03:10:40,633 WARN L170 areAnnotationChecker]: L558-1 has no Hoare annotation [2022-02-21 03:10:40,633 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-21 03:10:40,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:10:40 BoogieIcfgContainer [2022-02-21 03:10:40,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:10:40,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:10:40,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:10:40,640 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:10:40,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:32" (3/4) ... [2022-02-21 03:10:40,642 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:10:40,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-21 03:10:40,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:10:40,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-21 03:10:40,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:10:40,678 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:10:40,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:10:40,679 INFO L158 Benchmark]: Toolchain (without parser) took 9283.61ms. Allocated memory was 127.9MB in the beginning and 199.2MB in the end (delta: 71.3MB). Free memory was 100.8MB in the beginning and 144.5MB in the end (delta: -43.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,679 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 53.6MB in the beginning and 53.5MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:10:40,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.77ms. Allocated memory is still 127.9MB. Free memory was 100.5MB in the beginning and 89.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.48ms. Allocated memory is still 127.9MB. Free memory was 89.3MB in the beginning and 82.2MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,680 INFO L158 Benchmark]: Boogie Preprocessor took 49.13ms. Allocated memory is still 127.9MB. Free memory was 82.2MB in the beginning and 79.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,680 INFO L158 Benchmark]: RCFGBuilder took 1093.49ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 79.2MB in the beginning and 109.1MB in the end (delta: -29.8MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,681 INFO L158 Benchmark]: TraceAbstraction took 7703.60ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 109.1MB in the beginning and 147.6MB in the end (delta: -38.5MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,683 INFO L158 Benchmark]: Witness Printer took 38.13ms. Allocated memory is still 199.2MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:10:40,686 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.17ms. Allocated memory is still 92.3MB. Free memory was 53.6MB in the beginning and 53.5MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.77ms. Allocated memory is still 127.9MB. Free memory was 100.5MB in the beginning and 89.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.48ms. Allocated memory is still 127.9MB. Free memory was 89.3MB in the beginning and 82.2MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.13ms. Allocated memory is still 127.9MB. Free memory was 82.2MB in the beginning and 79.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1093.49ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 79.2MB in the beginning and 109.1MB in the end (delta: -29.8MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7703.60ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 109.1MB in the beginning and 147.6MB in the end (delta: -38.5MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. * Witness Printer took 38.13ms. Allocated memory is still 199.2MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 136]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 136]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 152]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 152]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 188]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 188]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 236]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 236]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 252]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 252]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 288]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 288]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 294]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 294]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 336]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 336]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 352]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 352]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 388]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 388]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 436]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 436]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 452]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 452]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 488]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 488]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 536]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 536]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 195 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1287 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1287 mSDsluCounter, 3125 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1337 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 424 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 1788 mSDtfsCounter, 424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 234 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 29 HoareAnnotationTreeSize, 4 FomulaSimplifications, 99 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 377 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 89/107 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 42 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((0 <= 16 + this_expect && this_expect <= 16) && 0 <= this_buffer_empty) && this_buffer_empty <= 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (0 <= 16 + this_expect && 0 <= this_buffer_empty) && this_buffer_empty <= 1 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:10:40,726 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