/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:16:28,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:16:28,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:16:28,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:16:28,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:16:28,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:16:28,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:16:28,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:16:28,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:16:28,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:16:28,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:16:28,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:16:28,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:16:28,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:16:28,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:16:28,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:16:28,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:16:28,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:16:28,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:16:28,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:16:28,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:16:28,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:16:28,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:16:28,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:16:28,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:16:28,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:16:28,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:16:28,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:16:28,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:16:28,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:16:28,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:16:28,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:16:28,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:16:28,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:16:28,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:16:28,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:16:28,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:16:28,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:16:28,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:16:28,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:16:28,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:16:28,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:16:28,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:16:28,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:16:28,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:16:28,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:16:28,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:16:28,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:16:28,409 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:16:28,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:16:28,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:16:28,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:16:28,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:16:28,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:16:28,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:16:28,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:16:28,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:16:28,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:28,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:16:28,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:16:28,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:16:28,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:16:28,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:16:28,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:16:28,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:16:28,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:16:28,413 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:16:28,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:16:28,414 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:16:28,414 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:16:28,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:16:28,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:16:28,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:16:28,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:16:28,663 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:16:28,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2022-01-11 00:16:28,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a120f3166/d1640ad5a6bc408ca5721d67aea99198/FLAG25459682c [2022-01-11 00:16:29,139 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:16:29,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2022-01-11 00:16:29,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a120f3166/d1640ad5a6bc408ca5721d67aea99198/FLAG25459682c [2022-01-11 00:16:29,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a120f3166/d1640ad5a6bc408ca5721d67aea99198 [2022-01-11 00:16:29,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:16:29,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:16:29,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:29,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:16:29,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:16:29,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd7892b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29, skipping insertion in model container [2022-01-11 00:16:29,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:16:29,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:16:29,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-01-11 00:16:29,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:29,386 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:16:29,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-01-11 00:16:29,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:29,430 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:16:29,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29 WrapperNode [2022-01-11 00:16:29,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:29,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:29,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:16:29,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:16:29,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,464 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 255 [2022-01-11 00:16:29,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:29,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:16:29,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:16:29,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:16:29,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:16:29,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:16:29,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:16:29,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:16:29,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:29,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:29,526 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-01-11 00:16:29,552 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-01-11 00:16:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:16:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:16:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:16:29,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:16:29,664 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:16:29,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:16:29,966 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:16:29,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:16:29,972 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-11 00:16:29,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:29 BoogieIcfgContainer [2022-01-11 00:16:29,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:16:29,974 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:16:29,974 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:16:29,975 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:16:29,977 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:29" (1/1) ... [2022-01-11 00:16:30,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:30 BasicIcfg [2022-01-11 00:16:30,059 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:16:30,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:16:30,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:16:30,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:16:30,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:16:29" (1/4) ... [2022-01-11 00:16:30,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3772487c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:30, skipping insertion in model container [2022-01-11 00:16:30,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:29" (2/4) ... [2022-01-11 00:16:30,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3772487c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:30, skipping insertion in model container [2022-01-11 00:16:30,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:29" (3/4) ... [2022-01-11 00:16:30,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3772487c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:30, skipping insertion in model container [2022-01-11 00:16:30,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:30" (4/4) ... [2022-01-11 00:16:30,069 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.cTransformedIcfg [2022-01-11 00:16:30,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:16:30,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-11 00:16:30,130 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:16:30,140 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:16:30,140 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-11 00:16:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 80 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 00:16:30,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:30,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:30,161 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash -685744817, now seen corresponding path program 1 times [2022-01-11 00:16:30,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:30,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100037476] [2022-01-11 00:16:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:30,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:30,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:30,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100037476] [2022-01-11 00:16:30,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100037476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:30,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:30,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:30,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875226841] [2022-01-11 00:16:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:30,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:30,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:30,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:30,406 INFO L87 Difference]: Start difference. First operand has 81 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 80 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:30,479 INFO L93 Difference]: Finished difference Result 223 states and 335 transitions. [2022-01-11 00:16:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 00:16:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:30,489 INFO L225 Difference]: With dead ends: 223 [2022-01-11 00:16:30,490 INFO L226 Difference]: Without dead ends: 140 [2022-01-11 00:16:30,492 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-01-11 00:16:30,495 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 80 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:30,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 212 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-11 00:16:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2022-01-11 00:16:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 118 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2022-01-11 00:16:30,555 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 35 [2022-01-11 00:16:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:30,556 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2022-01-11 00:16:30,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-01-11 00:16:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 00:16:30,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:30,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:30,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:16:30,558 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash 153878748, now seen corresponding path program 1 times [2022-01-11 00:16:30,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:30,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659190939] [2022-01-11 00:16:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:30,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:30,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659190939] [2022-01-11 00:16:30,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659190939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:30,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:30,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:30,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487747541] [2022-01-11 00:16:30,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:30,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:30,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:30,646 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:30,679 INFO L93 Difference]: Finished difference Result 288 states and 400 transitions. [2022-01-11 00:16:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-11 00:16:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:30,684 INFO L225 Difference]: With dead ends: 288 [2022-01-11 00:16:30,684 INFO L226 Difference]: Without dead ends: 177 [2022-01-11 00:16:30,685 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-01-11 00:16:30,686 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:30,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-11 00:16:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2022-01-11 00:16:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.4) internal successors, (238), 171 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2022-01-11 00:16:30,718 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 36 [2022-01-11 00:16:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:30,718 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2022-01-11 00:16:30,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2022-01-11 00:16:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 00:16:30,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:30,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:30,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:16:30,721 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash -418085, now seen corresponding path program 1 times [2022-01-11 00:16:30,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814429114] [2022-01-11 00:16:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:30,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:30,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:30,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814429114] [2022-01-11 00:16:30,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814429114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:30,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:30,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:30,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281882701] [2022-01-11 00:16:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:30,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:30,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:30,853 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:30,906 INFO L93 Difference]: Finished difference Result 489 states and 674 transitions. [2022-01-11 00:16:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-11 00:16:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:30,908 INFO L225 Difference]: With dead ends: 489 [2022-01-11 00:16:30,909 INFO L226 Difference]: Without dead ends: 325 [2022-01-11 00:16:30,910 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-01-11 00:16:30,911 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:30,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-11 00:16:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 303. [2022-01-11 00:16:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 301 states have (on average 1.3754152823920265) internal successors, (414), 302 states have internal predecessors, (414), 0 states have call successors, (0), 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-01-11 00:16:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2022-01-11 00:16:30,947 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 36 [2022-01-11 00:16:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:30,948 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2022-01-11 00:16:30,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2022-01-11 00:16:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-11 00:16:30,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:30,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:30,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:16:30,958 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash -255349929, now seen corresponding path program 1 times [2022-01-11 00:16:30,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:30,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803489278] [2022-01-11 00:16:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:30,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:31,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:31,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803489278] [2022-01-11 00:16:31,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803489278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:31,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:31,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:31,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742929925] [2022-01-11 00:16:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:31,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:31,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:31,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:31,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:31,039 INFO L87 Difference]: Start difference. First operand 303 states and 414 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:31,074 INFO L93 Difference]: Finished difference Result 754 states and 1021 transitions. [2022-01-11 00:16:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-01-11 00:16:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:31,076 INFO L225 Difference]: With dead ends: 754 [2022-01-11 00:16:31,076 INFO L226 Difference]: Without dead ends: 459 [2022-01-11 00:16:31,078 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-01-11 00:16:31,079 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:31,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-01-11 00:16:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2022-01-11 00:16:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 1.3172866520787747) internal successors, (602), 458 states have internal predecessors, (602), 0 states have call successors, (0), 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-01-11 00:16:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 602 transitions. [2022-01-11 00:16:31,101 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 602 transitions. Word has length 50 [2022-01-11 00:16:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:31,102 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 602 transitions. [2022-01-11 00:16:31,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 602 transitions. [2022-01-11 00:16:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:16:31,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:31,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:31,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:16:31,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1157188318, now seen corresponding path program 1 times [2022-01-11 00:16:31,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:31,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583238315] [2022-01-11 00:16:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:31,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:31,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583238315] [2022-01-11 00:16:31,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583238315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:31,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:31,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:31,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764055817] [2022-01-11 00:16:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:31,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:31,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:31,174 INFO L87 Difference]: Start difference. First operand 459 states and 602 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-11 00:16:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:31,217 INFO L93 Difference]: Finished difference Result 932 states and 1218 transitions. [2022-01-11 00:16:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:16:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:31,221 INFO L225 Difference]: With dead ends: 932 [2022-01-11 00:16:31,221 INFO L226 Difference]: Without dead ends: 567 [2022-01-11 00:16:31,222 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-01-11 00:16:31,234 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:31,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 191 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-01-11 00:16:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2022-01-11 00:16:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 565 states have (on average 1.2920353982300885) internal successors, (730), 566 states have internal predecessors, (730), 0 states have call successors, (0), 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-01-11 00:16:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 730 transitions. [2022-01-11 00:16:31,278 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 730 transitions. Word has length 54 [2022-01-11 00:16:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:31,278 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 730 transitions. [2022-01-11 00:16:31,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-11 00:16:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 730 transitions. [2022-01-11 00:16:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 00:16:31,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:31,287 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:31,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:16:31,288 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash 308763675, now seen corresponding path program 1 times [2022-01-11 00:16:31,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:31,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170093349] [2022-01-11 00:16:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:31,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:31,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:31,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170093349] [2022-01-11 00:16:31,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170093349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:31,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:31,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:16:31,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779045786] [2022-01-11 00:16:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:31,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:16:31,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:16:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:31,431 INFO L87 Difference]: Start difference. First operand 567 states and 730 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-11 00:16:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:31,548 INFO L93 Difference]: Finished difference Result 1650 states and 2134 transitions. [2022-01-11 00:16:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:16:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 00:16:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:31,553 INFO L225 Difference]: With dead ends: 1650 [2022-01-11 00:16:31,553 INFO L226 Difference]: Without dead ends: 1227 [2022-01-11 00:16:31,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:16:31,555 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 302 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:31,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 565 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-01-11 00:16:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 591. [2022-01-11 00:16:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 589 states have (on average 1.2733446519524618) internal successors, (750), 590 states have internal predecessors, (750), 0 states have call successors, (0), 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-01-11 00:16:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2022-01-11 00:16:31,594 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 55 [2022-01-11 00:16:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:31,595 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2022-01-11 00:16:31,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-11 00:16:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2022-01-11 00:16:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 00:16:31,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:31,596 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:31,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:16:31,596 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash 659563612, now seen corresponding path program 1 times [2022-01-11 00:16:31,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:31,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117739946] [2022-01-11 00:16:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:31,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:31,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117739946] [2022-01-11 00:16:31,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117739946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:31,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:31,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:16:31,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386527520] [2022-01-11 00:16:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:31,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:16:31,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:16:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:31,651 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-11 00:16:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:31,760 INFO L93 Difference]: Finished difference Result 1380 states and 1760 transitions. [2022-01-11 00:16:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:16:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 00:16:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:31,764 INFO L225 Difference]: With dead ends: 1380 [2022-01-11 00:16:31,764 INFO L226 Difference]: Without dead ends: 882 [2022-01-11 00:16:31,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:16:31,767 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 276 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:31,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 568 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-01-11 00:16:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 489. [2022-01-11 00:16:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 1.271047227926078) internal successors, (619), 488 states have internal predecessors, (619), 0 states have call successors, (0), 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-01-11 00:16:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 619 transitions. [2022-01-11 00:16:31,809 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 619 transitions. Word has length 55 [2022-01-11 00:16:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:31,810 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 619 transitions. [2022-01-11 00:16:31,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-11 00:16:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 619 transitions. [2022-01-11 00:16:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 00:16:31,811 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:31,812 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:31,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:16:31,812 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1417615940, now seen corresponding path program 1 times [2022-01-11 00:16:31,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:31,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065530645] [2022-01-11 00:16:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:31,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 00:16:31,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:31,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065530645] [2022-01-11 00:16:31,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065530645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:31,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:31,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:16:31,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306354565] [2022-01-11 00:16:31,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:31,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:16:31,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:16:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:31,864 INFO L87 Difference]: Start difference. First operand 489 states and 619 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-11 00:16:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:31,971 INFO L93 Difference]: Finished difference Result 1143 states and 1455 transitions. [2022-01-11 00:16:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:16:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 00:16:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:31,974 INFO L225 Difference]: With dead ends: 1143 [2022-01-11 00:16:31,975 INFO L226 Difference]: Without dead ends: 754 [2022-01-11 00:16:31,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:16:31,976 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 243 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:31,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 447 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-01-11 00:16:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 483. [2022-01-11 00:16:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 481 states have (on average 1.2598752598752598) internal successors, (606), 482 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 606 transitions. [2022-01-11 00:16:32,019 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 606 transitions. Word has length 55 [2022-01-11 00:16:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:32,020 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 606 transitions. [2022-01-11 00:16:32,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-11 00:16:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 606 transitions. [2022-01-11 00:16:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 00:16:32,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:32,022 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:32,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:16:32,022 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1221102435, now seen corresponding path program 1 times [2022-01-11 00:16:32,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:32,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617592829] [2022-01-11 00:16:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:32,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:32,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:32,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617592829] [2022-01-11 00:16:32,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617592829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:32,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:32,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:16:32,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328187949] [2022-01-11 00:16:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:32,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:32,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:16:32,152 INFO L87 Difference]: Start difference. First operand 483 states and 606 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-11 00:16:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:32,228 INFO L93 Difference]: Finished difference Result 533 states and 666 transitions. [2022-01-11 00:16:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:16:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 00:16:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:32,231 INFO L225 Difference]: With dead ends: 533 [2022-01-11 00:16:32,231 INFO L226 Difference]: Without dead ends: 531 [2022-01-11 00:16:32,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-11 00:16:32,234 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 174 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:32,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 172 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-01-11 00:16:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 481. [2022-01-11 00:16:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.25625) internal successors, (603), 480 states have internal predecessors, (603), 0 states have call successors, (0), 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-01-11 00:16:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 603 transitions. [2022-01-11 00:16:32,277 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 603 transitions. Word has length 55 [2022-01-11 00:16:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:32,278 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 603 transitions. [2022-01-11 00:16:32,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-11 00:16:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2022-01-11 00:16:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 00:16:32,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:32,279 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:32,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:16:32,279 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash 800529613, now seen corresponding path program 1 times [2022-01-11 00:16:32,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:32,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435612155] [2022-01-11 00:16:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:32,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:32,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435612155] [2022-01-11 00:16:32,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435612155] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:16:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100752720] [2022-01-11 00:16:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:32,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:16:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:32,520 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-01-11 00:16:32,574 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-01-11 00:16:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:32,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 00:16:32,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:16:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:32,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:16:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:33,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100752720] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:16:33,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:16:33,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 00:16:33,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227274376] [2022-01-11 00:16:33,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:16:33,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 00:16:33,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 00:16:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 00:16:33,292 INFO L87 Difference]: Start difference. First operand 481 states and 603 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 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-01-11 00:16:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:33,491 INFO L93 Difference]: Finished difference Result 1355 states and 1709 transitions. [2022-01-11 00:16:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 00:16:33,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 00:16:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:33,516 INFO L225 Difference]: With dead ends: 1355 [2022-01-11 00:16:33,516 INFO L226 Difference]: Without dead ends: 1353 [2022-01-11 00:16:33,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 00:16:33,518 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 499 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:33,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 796 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-01-11 00:16:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 747. [2022-01-11 00:16:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.2667560321715818) internal successors, (945), 746 states have internal predecessors, (945), 0 states have call successors, (0), 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-01-11 00:16:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 945 transitions. [2022-01-11 00:16:33,608 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 945 transitions. Word has length 56 [2022-01-11 00:16:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:33,608 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 945 transitions. [2022-01-11 00:16:33,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 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-01-11 00:16:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 945 transitions. [2022-01-11 00:16:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-11 00:16:33,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:33,610 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-11 00:16:33,636 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-01-11 00:16:33,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-11 00:16:33,824 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2071545257, now seen corresponding path program 2 times [2022-01-11 00:16:33,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186543155] [2022-01-11 00:16:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:33,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:33,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:33,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186543155] [2022-01-11 00:16:33,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186543155] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:33,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:33,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:33,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188110050] [2022-01-11 00:16:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:33,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:33,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:33,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:33,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:33,873 INFO L87 Difference]: Start difference. First operand 747 states and 945 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-01-11 00:16:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:33,951 INFO L93 Difference]: Finished difference Result 1242 states and 1581 transitions. [2022-01-11 00:16:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:33,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-01-11 00:16:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:33,954 INFO L225 Difference]: With dead ends: 1242 [2022-01-11 00:16:33,954 INFO L226 Difference]: Without dead ends: 658 [2022-01-11 00:16:33,955 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-01-11 00:16:33,956 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 53 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:33,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-01-11 00:16:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2022-01-11 00:16:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.2567353407290016) internal successors, (793), 631 states have internal predecessors, (793), 0 states have call successors, (0), 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-01-11 00:16:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 793 transitions. [2022-01-11 00:16:34,025 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 793 transitions. Word has length 71 [2022-01-11 00:16:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:34,026 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 793 transitions. [2022-01-11 00:16:34,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-01-11 00:16:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 793 transitions. [2022-01-11 00:16:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 00:16:34,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:34,028 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-11 00:16:34,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:16:34,028 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2081409404, now seen corresponding path program 1 times [2022-01-11 00:16:34,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:34,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257881513] [2022-01-11 00:16:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:34,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 00:16:34,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:34,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257881513] [2022-01-11 00:16:34,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257881513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:34,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:34,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:34,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741877406] [2022-01-11 00:16:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:34,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:34,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:34,066 INFO L87 Difference]: Start difference. First operand 632 states and 793 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-01-11 00:16:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:34,160 INFO L93 Difference]: Finished difference Result 1274 states and 1596 transitions. [2022-01-11 00:16:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 83 [2022-01-11 00:16:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:34,163 INFO L225 Difference]: With dead ends: 1274 [2022-01-11 00:16:34,163 INFO L226 Difference]: Without dead ends: 650 [2022-01-11 00:16:34,164 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-01-11 00:16:34,165 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:34,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-01-11 00:16:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 632. [2022-01-11 00:16:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.2250396196513471) internal successors, (773), 631 states have internal predecessors, (773), 0 states have call successors, (0), 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-01-11 00:16:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 773 transitions. [2022-01-11 00:16:34,232 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 773 transitions. Word has length 83 [2022-01-11 00:16:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:34,233 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 773 transitions. [2022-01-11 00:16:34,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-01-11 00:16:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 773 transitions. [2022-01-11 00:16:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 00:16:34,234 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:34,234 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-11 00:16:34,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:16:34,235 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1117318961, now seen corresponding path program 1 times [2022-01-11 00:16:34,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332102058] [2022-01-11 00:16:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:34,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 00:16:34,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:34,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332102058] [2022-01-11 00:16:34,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332102058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:34,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:34,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:34,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237977553] [2022-01-11 00:16:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:34,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:34,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:34,270 INFO L87 Difference]: Start difference. First operand 632 states and 773 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-01-11 00:16:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:34,325 INFO L93 Difference]: Finished difference Result 896 states and 1088 transitions. [2022-01-11 00:16:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 84 [2022-01-11 00:16:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:34,326 INFO L225 Difference]: With dead ends: 896 [2022-01-11 00:16:34,326 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 00:16:34,328 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-01-11 00:16:34,328 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 56 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:34,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 204 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 00:16:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 00:16:34,329 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-01-11 00:16:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 00:16:34,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2022-01-11 00:16:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:34,330 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 00:16:34,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-01-11 00:16:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 00:16:34,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 00:16:34,332 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-11 00:16:34,333 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-11 00:16:34,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:16:34,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 00:16:41,215 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 00:16:41,216 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 00:16:41,216 INFO L854 garLoopResultBuilder]: At program point L356(lines 342 358) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= ~q_free~0Int 1) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-11 00:16:41,216 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2022-01-11 00:16:41,216 INFO L858 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2022-01-11 00:16:41,216 INFO L854 garLoopResultBuilder]: At program point L211-1(lines 202 219) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse4 (= ~c_dr_st~0Int 0)) (.cse5 (= ~c_num_read~0Int 0)) (.cse6 (= ~p_num_write~0Int 0)) (.cse1 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse2 (= ~q_free~0Int 1)) (.cse8 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (<= 2 ~c_dr_st~0Int)) (and .cse0 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse1 .cse7 .cse2 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 (<= 2 ~p_dw_st~0Int) .cse2 .cse8 .cse9))) [2022-01-11 00:16:41,216 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,217 INFO L861 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2022-01-11 00:16:41,217 INFO L858 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2022-01-11 00:16:41,217 INFO L861 garLoopResultBuilder]: At program point L368(lines 359 370) the Hoare annotation is: true [2022-01-11 00:16:41,217 INFO L854 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,217 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 00:16:41,217 INFO L854 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,217 INFO L858 garLoopResultBuilder]: For program point L248(line 248) no Hoare annotation was computed. [2022-01-11 00:16:41,217 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 00:16:41,217 INFO L858 garLoopResultBuilder]: For program point L224-1(lines 224 234) no Hoare annotation was computed. [2022-01-11 00:16:41,217 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2022-01-11 00:16:41,218 INFO L854 garLoopResultBuilder]: At program point L236-1(lines 223 238) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,218 INFO L858 garLoopResultBuilder]: For program point L228-1(lines 228 233) no Hoare annotation was computed. [2022-01-11 00:16:41,218 INFO L854 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,218 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2022-01-11 00:16:41,218 INFO L854 garLoopResultBuilder]: At program point L237-1(lines 220 239) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,218 INFO L854 garLoopResultBuilder]: At program point L237(lines 220 239) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,218 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2022-01-11 00:16:41,218 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2022-01-11 00:16:41,218 INFO L854 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,218 INFO L858 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L854 garLoopResultBuilder]: At program point L310(lines 294 312) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L854 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~q_free~0Int 0)) (.cse10 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse4 (+ ~p_num_write~0Int 1)) (.cse9 (<= 2 ~c_dr_st~0Int)) (.cse6 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~c_dr_st~0Int 0)) (.cse7 (= ~p_dw_pc~0Int 0)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse3 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 (< .cse3 .cse4) .cse5 (<= ~p_num_write~0Int .cse3))) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse10 .cse11 .cse9) (and .cse0 .cse10 .cse2 .cse11 .cse9 .cse5) (and (< ~c_num_read~0Int .cse4) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse2 .cse8 .cse9 .cse5) (and .cse6 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse1 (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) .cse7 .cse2 .cse8 (<= ~p_last_write~0Int ~c_last_read~0Int) .cse5))) [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-01-11 00:16:41,219 INFO L854 garLoopResultBuilder]: At program point L138(lines 101 143) the Hoare annotation is: (let ((.cse3 (= ~q_free~0Int 0)) (.cse0 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse5 (<= 2 ~p_dw_st~0Int)) (.cse2 (<= 2 ~c_dr_st~0Int)) (.cse7 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (= 0 ~c_dr_pc~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse0 .cse1 .cse2) (let ((.cse6 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse3 (= ~c_dr_st~0Int 0) .cse4 .cse5 (< .cse6 (+ ~p_num_write~0Int 1)) .cse7 (<= ~p_num_write~0Int .cse6))) (and .cse3 .cse0 .cse4 .cse1 .cse5 .cse2 .cse7))) [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2022-01-11 00:16:41,220 INFO L854 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0Int)) (.cse3 (= 0 ~c_dr_pc~0Int)) (.cse4 (= ~p_dw_pc~0Int 0)) (.cse0 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse2 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0) .cse1) (and .cse3 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) .cse4 .cse0 .cse2))) [2022-01-11 00:16:41,220 INFO L854 garLoopResultBuilder]: At program point L182-1(lines 148 200) the Hoare annotation is: (let ((.cse3 (+ ~p_num_write~0Int 1))) (let ((.cse5 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse8 (< ~c_num_read~0Int .cse3)) (.cse9 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse1 (<= 2 ~p_dw_st~0Int)) (.cse6 (= ~q_free~0Int 1)) (.cse7 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse4 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse2 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) .cse0 .cse1 (< .cse2 .cse3) .cse4 (<= ~p_num_write~0Int .cse2))) (and .cse5 (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse5 (= 0 ~p_dw_st~0Int) .cse8 .cse9 .cse0 .cse6 .cse7 .cse4) (and .cse5 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse9 .cse0 .cse1 .cse6 .cse7 .cse4)))) [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2022-01-11 00:16:41,220 INFO L854 garLoopResultBuilder]: At program point L196(lines 145 201) the Hoare annotation is: (let ((.cse0 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse1 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse3 (= ~q_free~0Int 1)) (.cse4 (<= 2 ~c_dr_st~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (= 0 ~p_dw_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= 2 ~p_dw_st~0Int) .cse3 .cse4 .cse5))) [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2022-01-11 00:16:41,220 INFO L854 garLoopResultBuilder]: At program point L153(lines 148 200) the Hoare annotation is: (let ((.cse0 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (< .cse0 (+ ~p_num_write~0Int 1)) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= ~p_num_write~0Int .cse0))) [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2022-01-11 00:16:41,220 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L854 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse9 (mod (+ ~c_num_read~0Int 1) 4294967296))) (let ((.cse0 (= ~q_free~0Int 0)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse3 (< .cse9 (+ ~p_num_write~0Int 1))) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse6 (<= ~p_num_write~0Int .cse9)) (.cse7 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse8 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~c_dr_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 1) .cse8 .cse2 .cse5) (and .cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse4) (and .cse0 .cse2 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse4)))) [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L42-3(lines 42 51) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L854 garLoopResultBuilder]: At program point L54(lines 38 56) the Hoare annotation is: (let ((.cse10 (mod (+ ~c_num_read~0Int 1) 4294967296))) (let ((.cse2 (< .cse10 (+ ~p_num_write~0Int 1))) (.cse5 (<= ~p_num_write~0Int .cse10)) (.cse3 (<= 2 ~c_dr_st~0Int)) (.cse6 (= 0 ~c_dr_pc~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse1 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse2 (<= 1 |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int|) .cse3 .cse4 .cse5) (and .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse3) (and .cse6 .cse0 .cse7 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) .cse8 (= ~p_num_write~0Int 1) .cse9 .cse1 .cse4)))) [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 43 48) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L42-5(lines 42 51) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L854 garLoopResultBuilder]: At program point L53-1(lines 41 55) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= 2 ~p_dw_st~0Int)) (.cse5 (= ~q_free~0Int 1)) (.cse6 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse7 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse5 .cse6 .cse7))) [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L854 garLoopResultBuilder]: At program point L54-1(lines 38 56) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= 2 ~p_dw_st~0Int)) (.cse5 (= ~q_free~0Int 1)) (.cse6 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse7 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse5 (<= 1 |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int|) .cse6 .cse7))) [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2022-01-11 00:16:41,221 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-01-11 00:16:41,222 INFO L858 garLoopResultBuilder]: For program point L84-5(lines 84 88) no Hoare annotation was computed. [2022-01-11 00:16:41,222 INFO L854 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_dr_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse2 .cse5) (let ((.cse6 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse3 .cse4 (< .cse6 (+ ~p_num_write~0Int 1)) .cse2 .cse5 (<= ~p_num_write~0Int .cse6))) (and .cse0 .cse3 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (= ~p_num_write~0Int 1) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) (= ~p_dw_pc~0Int 0) .cse4 .cse5))) [2022-01-11 00:16:41,222 INFO L858 garLoopResultBuilder]: For program point L61-3(lines 61 70) no Hoare annotation was computed. [2022-01-11 00:16:41,222 INFO L854 garLoopResultBuilder]: At program point L73(lines 57 75) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse1 (= ~q_free~0Int 0)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse6 (<= 2 ~c_dr_st~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse3 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (= ~p_num_write~0Int 1) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) (= ~p_dw_pc~0Int 0) .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse2 .cse3 .cse6) (let ((.cse7 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse1 .cse4 (< .cse7 (+ ~p_num_write~0Int 1)) .cse6 .cse5 (<= ~p_num_write~0Int .cse7))))) [2022-01-11 00:16:41,222 INFO L858 garLoopResultBuilder]: For program point L62-1(lines 62 67) no Hoare annotation was computed. [2022-01-11 00:16:41,222 INFO L858 garLoopResultBuilder]: For program point L61-5(lines 61 70) no Hoare annotation was computed. [2022-01-11 00:16:41,222 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-01-11 00:16:41,222 INFO L854 garLoopResultBuilder]: At program point L72-1(lines 60 74) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse2 .cse3 (<= 2 ~p_dw_st~0Int) .cse4 .cse5 .cse6))) [2022-01-11 00:16:41,222 INFO L854 garLoopResultBuilder]: At program point L92-2(lines 76 100) the Hoare annotation is: (let ((.cse0 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse1 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse6 (<= 2 ~c_dr_st~0Int)) (.cse3 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse2 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 (= ~c_dr_st~0Int 0) .cse1 (< .cse2 (+ ~p_num_write~0Int 1)) .cse3 (<= ~p_num_write~0Int .cse2))) (and (= 0 ~c_dr_pc~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse6 .cse3))) [2022-01-11 00:16:41,222 INFO L854 garLoopResultBuilder]: At program point L73-1(lines 57 75) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse2 .cse3 (<= 2 ~p_dw_st~0Int) .cse4 .cse5 .cse6))) [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point L92-3(lines 92 96) no Hoare annotation was computed. [2022-01-11 00:16:41,223 INFO L854 garLoopResultBuilder]: At program point L92-5(lines 76 100) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse2 .cse3 (<= 2 ~p_dw_st~0Int) .cse4 .cse5 .cse6))) [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 00:16:41,223 INFO L854 garLoopResultBuilder]: At program point L20-1(lines 15 22) the Hoare annotation is: false [2022-01-11 00:16:41,223 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 00:16:41,224 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-01-11 00:16:41,226 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:41,231 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:16:41,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:41 BasicIcfg [2022-01-11 00:16:41,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:16:41,324 INFO L158 Benchmark]: Toolchain (without parser) took 12160.47ms. Allocated memory was 176.2MB in the beginning and 393.2MB in the end (delta: 217.1MB). Free memory was 118.1MB in the beginning and 214.3MB in the end (delta: -96.2MB). Peak memory consumption was 204.8MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,324 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:16:41,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.24ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 117.8MB in the beginning and 197.1MB in the end (delta: -79.3MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.22ms. Allocated memory is still 226.5MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,325 INFO L158 Benchmark]: Boogie Preprocessor took 22.35ms. Allocated memory is still 226.5MB. Free memory was 195.0MB in the beginning and 193.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,325 INFO L158 Benchmark]: RCFGBuilder took 485.35ms. Allocated memory is still 226.5MB. Free memory was 193.4MB in the beginning and 177.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,326 INFO L158 Benchmark]: IcfgTransformer took 85.46ms. Allocated memory is still 226.5MB. Free memory was 177.2MB in the beginning and 171.4MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,326 INFO L158 Benchmark]: TraceAbstraction took 11263.20ms. Allocated memory was 226.5MB in the beginning and 393.2MB in the end (delta: 166.7MB). Free memory was 170.9MB in the beginning and 214.3MB in the end (delta: -43.4MB). Peak memory consumption was 207.4MB. Max. memory is 8.0GB. [2022-01-11 00:16:41,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.24ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 117.8MB in the beginning and 197.1MB in the end (delta: -79.3MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.22ms. Allocated memory is still 226.5MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.35ms. Allocated memory is still 226.5MB. Free memory was 195.0MB in the beginning and 193.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 485.35ms. Allocated memory is still 226.5MB. Free memory was 193.4MB in the beginning and 177.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 85.46ms. Allocated memory is still 226.5MB. Free memory was 177.2MB in the beginning and 171.4MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 11263.20ms. Allocated memory was 226.5MB in the beginning and 393.2MB in the end (delta: 166.7MB). Free memory was 170.9MB in the beginning and 214.3MB in the end (delta: -43.4MB). Peak memory consumption was 207.4MB. Max. memory is 8.0GB. * 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1953 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1953 mSDsluCounter, 4183 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2438 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1745 mSDtfsCounter, 202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=747occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2048 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 31 PreInvPairs, 232 NumberOfFragments, 3382 HoareAnnotationTreeSize, 31 FomulaSimplifications, 10798 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 31 FomulaSimplificationsInter, 54620 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 3603 SizeOfPredicates, 2 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 97/103 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 2 specifications checked. All of them hold - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((~bvule32(2bv32, c_dr_st) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && p_dw_pc == 0bv32) || (((((((((p_num_write == 1bv32 && c_num_read == 0bv32) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32)) || (((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(1bv32, \result)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32)) || (((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(q_buf_0, p_last_write)) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || ((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(1bv32, \result)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32) || ((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) || (((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((p_num_write == 1bv32 && ~bvule32(tmp, 0bv32)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 1bv32 && ~bvule32(tmp, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((~bvule32(2bv32, c_dr_st) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32)) || ((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32)) || ((((((((p_num_write == 1bv32 && c_num_read == 0bv32) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33)) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32)) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && p_dw_pc == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-11 00:16:41,375 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...