./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:10:05,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:10:05,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:10:05,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:10:05,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:10:05,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:10:05,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:10:05,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:10:05,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:10:05,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:10:05,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:10:05,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:10:05,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:10:05,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:10:05,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:10:05,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:10:05,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:10:05,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:10:05,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:10:05,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:10:05,447 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:10:05,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:10:05,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:10:05,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:10:05,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:10:05,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:10:05,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:10:05,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:10:05,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:10:05,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:10:05,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:10:05,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:10:05,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:10:05,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:10:05,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:10:05,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:10:05,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:10:05,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:10:05,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:10:05,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:10:05,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:10:05,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:10:05,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:10:05,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:10:05,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:10:05,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:10:05,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:10:05,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:10:05,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:10:05,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:10:05,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:10:05,494 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:10:05,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:10:05,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:10:05,496 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:10:05,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:10:05,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:10:05,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:10:05,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:10:05,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:10:05,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:10:05,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:10:05,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:10:05,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:10:05,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:10:05,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:10:05,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:10:05,498 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:10:05,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:10:05,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:10:05,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-07-13 21:10:05,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:10:05,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:10:05,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:10:05,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:10:05,744 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:10:05,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-07-13 21:10:05,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894a2c33b/738ecb99427e46078dd9f33f647b2445/FLAG678866f95 [2022-07-13 21:10:06,131 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:10:06,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-07-13 21:10:06,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894a2c33b/738ecb99427e46078dd9f33f647b2445/FLAG678866f95 [2022-07-13 21:10:06,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894a2c33b/738ecb99427e46078dd9f33f647b2445 [2022-07-13 21:10:06,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:10:06,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:10:06,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:10:06,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:10:06,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:10:06,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467eb6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06, skipping insertion in model container [2022-07-13 21:10:06,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:10:06,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:10:06,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-07-13 21:10:06,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-07-13 21:10:06,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:10:06,717 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:10:06,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-07-13 21:10:06,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-07-13 21:10:06,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:10:06,759 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:10:06,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06 WrapperNode [2022-07-13 21:10:06,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:10:06,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:10:06,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:10:06,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:10:06,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,803 INFO L137 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-07-13 21:10:06,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:10:06,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:10:06,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:10:06,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:10:06,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:10:06,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:10:06,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:10:06,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:10:06,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (1/1) ... [2022-07-13 21:10:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:10:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:06,855 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-07-13 21:10:06,882 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-07-13 21:10:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:10:06,908 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 21:10:06,908 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 21:10:06,908 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 21:10:06,908 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 21:10:06,908 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-13 21:10:06,908 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-13 21:10:06,908 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-13 21:10:06,908 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-13 21:10:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-13 21:10:06,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-13 21:10:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-13 21:10:06,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-13 21:10:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-13 21:10:06,909 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-13 21:10:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-13 21:10:06,909 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-13 21:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 21:10:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 21:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-13 21:10:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-13 21:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-13 21:10:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-13 21:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-13 21:10:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-13 21:10:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-13 21:10:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-13 21:10:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:10:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:10:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-13 21:10:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-13 21:10:06,967 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:10:06,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:10:07,321 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:10:07,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:10:07,328 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-13 21:10:07,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:10:07 BoogieIcfgContainer [2022-07-13 21:10:07,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:10:07,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:10:07,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:10:07,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:10:07,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:10:06" (1/3) ... [2022-07-13 21:10:07,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74565b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:10:07, skipping insertion in model container [2022-07-13 21:10:07,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:06" (2/3) ... [2022-07-13 21:10:07,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74565b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:10:07, skipping insertion in model container [2022-07-13 21:10:07,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:10:07" (3/3) ... [2022-07-13 21:10:07,345 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-07-13 21:10:07,355 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:10:07,355 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:10:07,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:10:07,450 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@333e9a8c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b2af5e4 [2022-07-13 21:10:07,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 21:10:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-13 21:10:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 21:10:07,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:07,474 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-13 21:10:07,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2022-07-13 21:10:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164938162] [2022-07-13 21:10:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:07,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164938162] [2022-07-13 21:10:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164938162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:07,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732958876] [2022-07-13 21:10:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:07,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:07,800 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:08,436 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2022-07-13 21:10:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:10:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 21:10:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:08,446 INFO L225 Difference]: With dead ends: 530 [2022-07-13 21:10:08,446 INFO L226 Difference]: Without dead ends: 329 [2022-07-13 21:10:08,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:08,451 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 516 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:08,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 746 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:10:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-13 21:10:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2022-07-13 21:10:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-07-13 21:10:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2022-07-13 21:10:08,531 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2022-07-13 21:10:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:08,532 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2022-07-13 21:10:08,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2022-07-13 21:10:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 21:10:08,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:08,540 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-13 21:10:08,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:10:08,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:08,542 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2022-07-13 21:10:08,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:08,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337489218] [2022-07-13 21:10:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:08,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337489218] [2022-07-13 21:10:08,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337489218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:08,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:08,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654994564] [2022-07-13 21:10:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:08,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:08,655 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:09,155 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2022-07-13 21:10:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:10:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 21:10:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:09,159 INFO L225 Difference]: With dead ends: 620 [2022-07-13 21:10:09,159 INFO L226 Difference]: Without dead ends: 437 [2022-07-13 21:10:09,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:10:09,161 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 493 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:09,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1025 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-13 21:10:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2022-07-13 21:10:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-07-13 21:10:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2022-07-13 21:10:09,183 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2022-07-13 21:10:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:09,184 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2022-07-13 21:10:09,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2022-07-13 21:10:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 21:10:09,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:09,185 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-13 21:10:09,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:10:09,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2022-07-13 21:10:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:09,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850510269] [2022-07-13 21:10:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:09,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:09,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850510269] [2022-07-13 21:10:09,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850510269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:09,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:09,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107239175] [2022-07-13 21:10:09,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:09,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:09,289 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:09,572 INFO L93 Difference]: Finished difference Result 703 states and 997 transitions. [2022-07-13 21:10:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:10:09,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 21:10:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:09,575 INFO L225 Difference]: With dead ends: 703 [2022-07-13 21:10:09,575 INFO L226 Difference]: Without dead ends: 435 [2022-07-13 21:10:09,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:09,582 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 436 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:09,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 688 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-13 21:10:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 373. [2022-07-13 21:10:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-07-13 21:10:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2022-07-13 21:10:09,621 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 57 [2022-07-13 21:10:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:09,621 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2022-07-13 21:10:09,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2022-07-13 21:10:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 21:10:09,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:09,623 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-13 21:10:09,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:10:09,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2022-07-13 21:10:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:09,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795319833] [2022-07-13 21:10:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:09,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:09,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795319833] [2022-07-13 21:10:09,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795319833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:09,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:09,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:09,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7978595] [2022-07-13 21:10:09,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:09,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:09,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:09,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:09,740 INFO L87 Difference]: Start difference. First operand 373 states and 518 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:10,167 INFO L93 Difference]: Finished difference Result 739 states and 1054 transitions. [2022-07-13 21:10:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:10:10,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 21:10:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:10,171 INFO L225 Difference]: With dead ends: 739 [2022-07-13 21:10:10,171 INFO L226 Difference]: Without dead ends: 472 [2022-07-13 21:10:10,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:10:10,178 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 267 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:10,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 916 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-13 21:10:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-07-13 21:10:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-07-13 21:10:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2022-07-13 21:10:10,202 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 57 [2022-07-13 21:10:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:10,203 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2022-07-13 21:10:10,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2022-07-13 21:10:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 21:10:10,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:10,205 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-13 21:10:10,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:10:10,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:10,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2022-07-13 21:10:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:10,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431582806] [2022-07-13 21:10:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:10,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431582806] [2022-07-13 21:10:10,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431582806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:10,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:10,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070338808] [2022-07-13 21:10:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:10,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:10,341 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:11,178 INFO L93 Difference]: Finished difference Result 1537 states and 2220 transitions. [2022-07-13 21:10:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:10:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 21:10:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:11,183 INFO L225 Difference]: With dead ends: 1537 [2022-07-13 21:10:11,183 INFO L226 Difference]: Without dead ends: 1261 [2022-07-13 21:10:11,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 21:10:11,184 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 938 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:11,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 913 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:10:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-07-13 21:10:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1090. [2022-07-13 21:10:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-07-13 21:10:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1511 transitions. [2022-07-13 21:10:11,237 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1511 transitions. Word has length 57 [2022-07-13 21:10:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:11,237 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1511 transitions. [2022-07-13 21:10:11,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1511 transitions. [2022-07-13 21:10:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:11,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:11,238 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:11,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:10:11,238 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2022-07-13 21:10:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330430712] [2022-07-13 21:10:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:11,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:11,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330430712] [2022-07-13 21:10:11,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330430712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:11,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:11,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717303838] [2022-07-13 21:10:11,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:11,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:11,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:11,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:11,321 INFO L87 Difference]: Start difference. First operand 1090 states and 1511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:11,767 INFO L93 Difference]: Finished difference Result 1313 states and 1826 transitions. [2022-07-13 21:10:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:10:11,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:11,772 INFO L225 Difference]: With dead ends: 1313 [2022-07-13 21:10:11,772 INFO L226 Difference]: Without dead ends: 1225 [2022-07-13 21:10:11,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:10:11,775 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 532 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:11,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 897 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-07-13 21:10:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1186. [2022-07-13 21:10:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-07-13 21:10:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1643 transitions. [2022-07-13 21:10:11,846 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1643 transitions. Word has length 65 [2022-07-13 21:10:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:11,848 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1643 transitions. [2022-07-13 21:10:11,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1643 transitions. [2022-07-13 21:10:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:11,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:11,849 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:11,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:10:11,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2022-07-13 21:10:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:11,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548047669] [2022-07-13 21:10:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:11,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548047669] [2022-07-13 21:10:11,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548047669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:11,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:11,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330998595] [2022-07-13 21:10:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:11,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:11,910 INFO L87 Difference]: Start difference. First operand 1186 states and 1643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:12,466 INFO L93 Difference]: Finished difference Result 1533 states and 2120 transitions. [2022-07-13 21:10:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:10:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:12,471 INFO L225 Difference]: With dead ends: 1533 [2022-07-13 21:10:12,471 INFO L226 Difference]: Without dead ends: 1356 [2022-07-13 21:10:12,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:10:12,472 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 706 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:12,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1040 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-07-13 21:10:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1282. [2022-07-13 21:10:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-07-13 21:10:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1777 transitions. [2022-07-13 21:10:12,520 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1777 transitions. Word has length 65 [2022-07-13 21:10:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:12,520 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1777 transitions. [2022-07-13 21:10:12,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1777 transitions. [2022-07-13 21:10:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:12,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:12,521 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:12,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:10:12,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2022-07-13 21:10:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932019766] [2022-07-13 21:10:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:12,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932019766] [2022-07-13 21:10:12,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932019766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717256560] [2022-07-13 21:10:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:12,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:12,597 INFO L87 Difference]: Start difference. First operand 1282 states and 1777 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:12,965 INFO L93 Difference]: Finished difference Result 1583 states and 2191 transitions. [2022-07-13 21:10:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:10:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-13 21:10:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:12,970 INFO L225 Difference]: With dead ends: 1583 [2022-07-13 21:10:12,970 INFO L226 Difference]: Without dead ends: 1316 [2022-07-13 21:10:12,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:10:12,971 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 305 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:12,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1078 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-07-13 21:10:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1287. [2022-07-13 21:10:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-07-13 21:10:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1780 transitions. [2022-07-13 21:10:13,044 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1780 transitions. Word has length 65 [2022-07-13 21:10:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:13,044 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1780 transitions. [2022-07-13 21:10:13,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1780 transitions. [2022-07-13 21:10:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:13,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:13,045 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:13,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:10:13,046 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2022-07-13 21:10:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140527102] [2022-07-13 21:10:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:13,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:13,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140527102] [2022-07-13 21:10:13,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140527102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:13,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:13,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58615650] [2022-07-13 21:10:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:13,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:13,133 INFO L87 Difference]: Start difference. First operand 1287 states and 1780 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:10:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:14,378 INFO L93 Difference]: Finished difference Result 2949 states and 4052 transitions. [2022-07-13 21:10:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:10:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-07-13 21:10:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:14,394 INFO L225 Difference]: With dead ends: 2949 [2022-07-13 21:10:14,394 INFO L226 Difference]: Without dead ends: 2677 [2022-07-13 21:10:14,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 21:10:14,397 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1324 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:14,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1469 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 21:10:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-07-13 21:10:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2427. [2022-07-13 21:10:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-07-13 21:10:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3264 transitions. [2022-07-13 21:10:14,503 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3264 transitions. Word has length 65 [2022-07-13 21:10:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:14,503 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 3264 transitions. [2022-07-13 21:10:14,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:10:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3264 transitions. [2022-07-13 21:10:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:14,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:14,505 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:14,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:10:14,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2022-07-13 21:10:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:14,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645941434] [2022-07-13 21:10:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645941434] [2022-07-13 21:10:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645941434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:14,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:14,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517946765] [2022-07-13 21:10:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:14,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:14,575 INFO L87 Difference]: Start difference. First operand 2427 states and 3264 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:15,079 INFO L93 Difference]: Finished difference Result 4028 states and 5388 transitions. [2022-07-13 21:10:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:10:15,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-13 21:10:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:15,088 INFO L225 Difference]: With dead ends: 4028 [2022-07-13 21:10:15,088 INFO L226 Difference]: Without dead ends: 2616 [2022-07-13 21:10:15,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:10:15,091 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 206 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:15,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1193 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-07-13 21:10:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2472. [2022-07-13 21:10:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-07-13 21:10:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3303 transitions. [2022-07-13 21:10:15,213 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3303 transitions. Word has length 65 [2022-07-13 21:10:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:15,214 INFO L495 AbstractCegarLoop]: Abstraction has 2472 states and 3303 transitions. [2022-07-13 21:10:15,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3303 transitions. [2022-07-13 21:10:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:15,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:15,215 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:15,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:10:15,215 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2022-07-13 21:10:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970386149] [2022-07-13 21:10:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:15,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:15,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970386149] [2022-07-13 21:10:15,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970386149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:15,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:15,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443302667] [2022-07-13 21:10:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:15,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:15,270 INFO L87 Difference]: Start difference. First operand 2472 states and 3303 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:15,870 INFO L93 Difference]: Finished difference Result 3907 states and 5142 transitions. [2022-07-13 21:10:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:10:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:15,878 INFO L225 Difference]: With dead ends: 3907 [2022-07-13 21:10:15,879 INFO L226 Difference]: Without dead ends: 2670 [2022-07-13 21:10:15,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:10:15,881 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 680 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:15,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 814 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-07-13 21:10:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2450. [2022-07-13 21:10:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 1943 states have (on average 1.3293875450334534) internal successors, (2583), 1982 states have internal predecessors, (2583), 275 states have call successors, (275), 196 states have call predecessors, (275), 230 states have return successors, (405), 276 states have call predecessors, (405), 273 states have call successors, (405) [2022-07-13 21:10:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3263 transitions. [2022-07-13 21:10:15,990 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3263 transitions. Word has length 65 [2022-07-13 21:10:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:15,990 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 3263 transitions. [2022-07-13 21:10:15,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3263 transitions. [2022-07-13 21:10:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:15,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:15,992 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:15,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:10:15,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2022-07-13 21:10:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:15,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917010369] [2022-07-13 21:10:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:16,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917010369] [2022-07-13 21:10:16,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917010369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:16,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:16,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58469838] [2022-07-13 21:10:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:16,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:16,040 INFO L87 Difference]: Start difference. First operand 2450 states and 3263 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:16,435 INFO L93 Difference]: Finished difference Result 5525 states and 7242 transitions. [2022-07-13 21:10:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:10:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:16,447 INFO L225 Difference]: With dead ends: 5525 [2022-07-13 21:10:16,447 INFO L226 Difference]: Without dead ends: 4093 [2022-07-13 21:10:16,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-13 21:10:16,450 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 653 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:16,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 655 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-07-13 21:10:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3821. [2022-07-13 21:10:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3009 states have (on average 1.296111665004985) internal successors, (3900), 3069 states have internal predecessors, (3900), 427 states have call successors, (427), 319 states have call predecessors, (427), 383 states have return successors, (677), 440 states have call predecessors, (677), 425 states have call successors, (677) [2022-07-13 21:10:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5004 transitions. [2022-07-13 21:10:16,634 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5004 transitions. Word has length 65 [2022-07-13 21:10:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:16,635 INFO L495 AbstractCegarLoop]: Abstraction has 3821 states and 5004 transitions. [2022-07-13 21:10:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5004 transitions. [2022-07-13 21:10:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 21:10:16,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:16,636 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:10:16,637 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2022-07-13 21:10:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251224280] [2022-07-13 21:10:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:16,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251224280] [2022-07-13 21:10:16,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251224280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:16,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:16,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404479745] [2022-07-13 21:10:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:16,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:16,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:16,674 INFO L87 Difference]: Start difference. First operand 3821 states and 5004 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:17,136 INFO L93 Difference]: Finished difference Result 8839 states and 11518 transitions. [2022-07-13 21:10:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:10:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-07-13 21:10:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:17,159 INFO L225 Difference]: With dead ends: 8839 [2022-07-13 21:10:17,159 INFO L226 Difference]: Without dead ends: 6015 [2022-07-13 21:10:17,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:17,166 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 377 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:17,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 766 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2022-07-13 21:10:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5499. [2022-07-13 21:10:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5499 states, 4294 states have (on average 1.2808570097810899) internal successors, (5500), 4361 states have internal predecessors, (5500), 621 states have call successors, (621), 493 states have call predecessors, (621), 582 states have return successors, (998), 652 states have call predecessors, (998), 619 states have call successors, (998) [2022-07-13 21:10:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 7119 transitions. [2022-07-13 21:10:17,414 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 7119 transitions. Word has length 66 [2022-07-13 21:10:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:17,415 INFO L495 AbstractCegarLoop]: Abstraction has 5499 states and 7119 transitions. [2022-07-13 21:10:17,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 7119 transitions. [2022-07-13 21:10:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 21:10:17,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:17,417 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:10:17,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2022-07-13 21:10:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:17,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127576147] [2022-07-13 21:10:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127576147] [2022-07-13 21:10:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127576147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:17,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:17,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752941977] [2022-07-13 21:10:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:17,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:17,478 INFO L87 Difference]: Start difference. First operand 5499 states and 7119 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:17,980 INFO L93 Difference]: Finished difference Result 7129 states and 9121 transitions. [2022-07-13 21:10:17,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:10:17,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-07-13 21:10:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:18,012 INFO L225 Difference]: With dead ends: 7129 [2022-07-13 21:10:18,012 INFO L226 Difference]: Without dead ends: 7126 [2022-07-13 21:10:18,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-13 21:10:18,015 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 918 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:18,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 554 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2022-07-13 21:10:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 6553. [2022-07-13 21:10:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 5097 states have (on average 1.2693741416519522) internal successors, (6470), 5173 states have internal predecessors, (6470), 747 states have call successors, (747), 607 states have call predecessors, (747), 707 states have return successors, (1191), 780 states have call predecessors, (1191), 746 states have call successors, (1191) [2022-07-13 21:10:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8408 transitions. [2022-07-13 21:10:18,318 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8408 transitions. Word has length 73 [2022-07-13 21:10:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:18,318 INFO L495 AbstractCegarLoop]: Abstraction has 6553 states and 8408 transitions. [2022-07-13 21:10:18,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8408 transitions. [2022-07-13 21:10:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 21:10:18,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:18,320 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:18,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:10:18,321 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2022-07-13 21:10:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:18,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657816663] [2022-07-13 21:10:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:18,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:18,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657816663] [2022-07-13 21:10:18,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657816663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951437376] [2022-07-13 21:10:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:18,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:18,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:18,412 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-07-13 21:10:18,415 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-07-13 21:10:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 21:10:18,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:18,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:10:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:18,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951437376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:10:18,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:10:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-13 21:10:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432056647] [2022-07-13 21:10:18,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:10:18,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:10:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:10:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:18,824 INFO L87 Difference]: Start difference. First operand 6553 states and 8408 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 21:10:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:20,250 INFO L93 Difference]: Finished difference Result 14199 states and 17936 transitions. [2022-07-13 21:10:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 21:10:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-07-13 21:10:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:20,288 INFO L225 Difference]: With dead ends: 14199 [2022-07-13 21:10:20,288 INFO L226 Difference]: Without dead ends: 14196 [2022-07-13 21:10:20,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-07-13 21:10:20,297 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 1211 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:20,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1246 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:10:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2022-07-13 21:10:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 11811. [2022-07-13 21:10:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11811 states, 9189 states have (on average 1.2600935901621504) internal successors, (11579), 9317 states have internal predecessors, (11579), 1313 states have call successors, (1313), 1097 states have call predecessors, (1313), 1307 states have return successors, (2130), 1404 states have call predecessors, (2130), 1312 states have call successors, (2130) [2022-07-13 21:10:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 15022 transitions. [2022-07-13 21:10:21,017 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 15022 transitions. Word has length 74 [2022-07-13 21:10:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:21,017 INFO L495 AbstractCegarLoop]: Abstraction has 11811 states and 15022 transitions. [2022-07-13 21:10:21,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 21:10:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 15022 transitions. [2022-07-13 21:10:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 21:10:21,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:21,019 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 21:10:21,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 21:10:21,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 21:10:21,246 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2022-07-13 21:10:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:21,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366512748] [2022-07-13 21:10:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366512748] [2022-07-13 21:10:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366512748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:21,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:21,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437002014] [2022-07-13 21:10:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:21,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:21,282 INFO L87 Difference]: Start difference. First operand 11811 states and 15022 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:21,916 INFO L93 Difference]: Finished difference Result 18354 states and 23364 transitions. [2022-07-13 21:10:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:10:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-07-13 21:10:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:21,939 INFO L225 Difference]: With dead ends: 18354 [2022-07-13 21:10:21,939 INFO L226 Difference]: Without dead ends: 8416 [2022-07-13 21:10:21,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:21,960 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 423 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:21,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 783 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-07-13 21:10:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 7864. [2022-07-13 21:10:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7864 states, 6136 states have (on average 1.2416883963494132) internal successors, (7619), 6220 states have internal predecessors, (7619), 880 states have call successors, (880), 721 states have call predecessors, (880), 846 states have return successors, (1349), 930 states have call predecessors, (1349), 879 states have call successors, (1349) [2022-07-13 21:10:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9848 transitions. [2022-07-13 21:10:22,410 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9848 transitions. Word has length 77 [2022-07-13 21:10:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:22,410 INFO L495 AbstractCegarLoop]: Abstraction has 7864 states and 9848 transitions. [2022-07-13 21:10:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9848 transitions. [2022-07-13 21:10:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 21:10:22,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:22,413 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:22,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 21:10:22,413 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2022-07-13 21:10:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:22,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618084362] [2022-07-13 21:10:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 21:10:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:10:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:22,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618084362] [2022-07-13 21:10:22,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618084362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:22,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:22,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451264726] [2022-07-13 21:10:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:22,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:22,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:22,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:22,475 INFO L87 Difference]: Start difference. First operand 7864 states and 9848 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:23,710 INFO L93 Difference]: Finished difference Result 21738 states and 27065 transitions. [2022-07-13 21:10:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 21:10:23,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-07-13 21:10:23,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:23,748 INFO L225 Difference]: With dead ends: 21738 [2022-07-13 21:10:23,749 INFO L226 Difference]: Without dead ends: 14895 [2022-07-13 21:10:23,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-07-13 21:10:23,766 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 765 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:23,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1054 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:10:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2022-07-13 21:10:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 14036. [2022-07-13 21:10:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 10812 states have (on average 1.212171661117277) internal successors, (13106), 11002 states have internal predecessors, (13106), 1596 states have call successors, (1596), 1325 states have call predecessors, (1596), 1626 states have return successors, (2752), 1722 states have call predecessors, (2752), 1595 states have call successors, (2752) [2022-07-13 21:10:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 17454 transitions. [2022-07-13 21:10:24,662 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 17454 transitions. Word has length 84 [2022-07-13 21:10:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:24,662 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 17454 transitions. [2022-07-13 21:10:24,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 17454 transitions. [2022-07-13 21:10:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 21:10:24,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:24,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 21:10:24,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 21:10:24,667 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2022-07-13 21:10:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:24,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222029375] [2022-07-13 21:10:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:24,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 21:10:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 21:10:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 21:10:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:24,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222029375] [2022-07-13 21:10:24,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222029375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:24,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707252027] [2022-07-13 21:10:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:24,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:24,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:24,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:24,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 21:10:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:24,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 21:10:24,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:24,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707252027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:24,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:24,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135749804] [2022-07-13 21:10:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:24,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:24,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:24,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:24,829 INFO L87 Difference]: Start difference. First operand 14036 states and 17454 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:25,406 INFO L93 Difference]: Finished difference Result 15912 states and 20081 transitions. [2022-07-13 21:10:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-07-13 21:10:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:25,431 INFO L225 Difference]: With dead ends: 15912 [2022-07-13 21:10:25,432 INFO L226 Difference]: Without dead ends: 14282 [2022-07-13 21:10:25,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:25,436 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 113 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:25,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 624 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2022-07-13 21:10:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 14282. [2022-07-13 21:10:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14282 states, 11010 states have (on average 1.2143505903723888) internal successors, (13370), 11202 states have internal predecessors, (13370), 1624 states have call successors, (1624), 1343 states have call predecessors, (1624), 1646 states have return successors, (2794), 1750 states have call predecessors, (2794), 1623 states have call successors, (2794) [2022-07-13 21:10:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 17788 transitions. [2022-07-13 21:10:26,015 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 17788 transitions. Word has length 92 [2022-07-13 21:10:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:26,016 INFO L495 AbstractCegarLoop]: Abstraction has 14282 states and 17788 transitions. [2022-07-13 21:10:26,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 17788 transitions. [2022-07-13 21:10:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 21:10:26,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:26,021 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 21:10:26,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 21:10:26,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 21:10:26,239 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2022-07-13 21:10:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:26,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015424040] [2022-07-13 21:10:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:10:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 21:10:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015424040] [2022-07-13 21:10:26,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015424040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:26,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:26,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155502949] [2022-07-13 21:10:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:26,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:26,298 INFO L87 Difference]: Start difference. First operand 14282 states and 17788 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:27,622 INFO L93 Difference]: Finished difference Result 25156 states and 31107 transitions. [2022-07-13 21:10:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 21:10:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-07-13 21:10:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:27,655 INFO L225 Difference]: With dead ends: 25156 [2022-07-13 21:10:27,655 INFO L226 Difference]: Without dead ends: 12757 [2022-07-13 21:10:27,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-13 21:10:27,677 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1520 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:27,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 931 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:10:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2022-07-13 21:10:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 11857. [2022-07-13 21:10:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11857 states, 9176 states have (on average 1.207606800348736) internal successors, (11081), 9335 states have internal predecessors, (11081), 1325 states have call successors, (1325), 1092 states have call predecessors, (1325), 1354 states have return successors, (2126), 1440 states have call predecessors, (2126), 1324 states have call successors, (2126) [2022-07-13 21:10:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11857 states to 11857 states and 14532 transitions. [2022-07-13 21:10:28,201 INFO L78 Accepts]: Start accepts. Automaton has 11857 states and 14532 transitions. Word has length 93 [2022-07-13 21:10:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:28,203 INFO L495 AbstractCegarLoop]: Abstraction has 11857 states and 14532 transitions. [2022-07-13 21:10:28,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 11857 states and 14532 transitions. [2022-07-13 21:10:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 21:10:28,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:28,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-07-13 21:10:28,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 21:10:28,210 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2022-07-13 21:10:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:28,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137225662] [2022-07-13 21:10:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 21:10:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 21:10:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 21:10:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 21:10:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137225662] [2022-07-13 21:10:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137225662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405470151] [2022-07-13 21:10:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:28,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:28,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:28,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 21:10:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:28,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 21:10:28,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:28,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405470151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:28,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:28,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 21:10:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877905822] [2022-07-13 21:10:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:28,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:28,475 INFO L87 Difference]: Start difference. First operand 11857 states and 14532 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 21:10:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:29,070 INFO L93 Difference]: Finished difference Result 13574 states and 16943 transitions. [2022-07-13 21:10:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:29,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-07-13 21:10:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:29,098 INFO L225 Difference]: With dead ends: 13574 [2022-07-13 21:10:29,099 INFO L226 Difference]: Without dead ends: 12576 [2022-07-13 21:10:29,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:29,107 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 196 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:29,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 406 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2022-07-13 21:10:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 12550. [2022-07-13 21:10:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12550 states, 9734 states have (on average 1.216046846106431) internal successors, (11837), 9902 states have internal predecessors, (11837), 1403 states have call successors, (1403), 1143 states have call predecessors, (1403), 1411 states have return successors, (2230), 1515 states have call predecessors, (2230), 1402 states have call successors, (2230) [2022-07-13 21:10:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 15470 transitions. [2022-07-13 21:10:29,815 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 15470 transitions. Word has length 118 [2022-07-13 21:10:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:29,815 INFO L495 AbstractCegarLoop]: Abstraction has 12550 states and 15470 transitions. [2022-07-13 21:10:29,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 21:10:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 15470 transitions. [2022-07-13 21:10:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 21:10:29,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:29,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:29,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:30,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:30,058 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2022-07-13 21:10:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:30,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161419456] [2022-07-13 21:10:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 21:10:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:10:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:10:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:10:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:10:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:30,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161419456] [2022-07-13 21:10:30,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161419456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:30,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920000511] [2022-07-13 21:10:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:30,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:30,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:30,125 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:30,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 21:10:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:30,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 21:10:30,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:30,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920000511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:30,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:30,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076141976] [2022-07-13 21:10:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:30,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:30,253 INFO L87 Difference]: Start difference. First operand 12550 states and 15470 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:10:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:30,877 INFO L93 Difference]: Finished difference Result 14780 states and 18580 transitions. [2022-07-13 21:10:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-07-13 21:10:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:30,902 INFO L225 Difference]: With dead ends: 14780 [2022-07-13 21:10:30,902 INFO L226 Difference]: Without dead ends: 12856 [2022-07-13 21:10:30,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:30,912 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 247 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 294 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-07-13 21:10:30,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12856 states. [2022-07-13 21:10:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12856 to 12790. [2022-07-13 21:10:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 9953 states have (on average 1.2065708831508088) internal successors, (12009), 10118 states have internal predecessors, (12009), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-07-13 21:10:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 15636 transitions. [2022-07-13 21:10:31,549 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 15636 transitions. Word has length 134 [2022-07-13 21:10:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 12790 states and 15636 transitions. [2022-07-13 21:10:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:10:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 15636 transitions. [2022-07-13 21:10:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 21:10:31,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:31,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:31,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 21:10:31,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:31,779 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2022-07-13 21:10:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:31,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546547793] [2022-07-13 21:10:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:31,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 21:10:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:10:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:10:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:10:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:10:31,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:31,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546547793] [2022-07-13 21:10:31,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546547793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:31,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755068563] [2022-07-13 21:10:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:31,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:31,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:31,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:31,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 21:10:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:10:31,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 21:10:31,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:31,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755068563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:31,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:31,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150637542] [2022-07-13 21:10:31,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:31,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:31,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:31,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:31,924 INFO L87 Difference]: Start difference. First operand 12790 states and 15636 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:10:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:32,417 INFO L93 Difference]: Finished difference Result 15003 states and 18535 transitions. [2022-07-13 21:10:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2022-07-13 21:10:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:32,443 INFO L225 Difference]: With dead ends: 15003 [2022-07-13 21:10:32,444 INFO L226 Difference]: Without dead ends: 12841 [2022-07-13 21:10:32,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:32,467 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 247 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 405 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-07-13 21:10:32,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12841 states. [2022-07-13 21:10:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12841 to 12772. [2022-07-13 21:10:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12772 states, 9935 states have (on average 1.2015098137896325) internal successors, (11937), 10100 states have internal predecessors, (11937), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-07-13 21:10:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 15564 transitions. [2022-07-13 21:10:33,082 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 15564 transitions. Word has length 134 [2022-07-13 21:10:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:33,082 INFO L495 AbstractCegarLoop]: Abstraction has 12772 states and 15564 transitions. [2022-07-13 21:10:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:10:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 15564 transitions. [2022-07-13 21:10:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 21:10:33,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:33,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:33,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 21:10:33,306 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2022-07-13 21:10:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:33,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124188090] [2022-07-13 21:10:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 21:10:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 21:10:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:33,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124188090] [2022-07-13 21:10:33,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124188090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:33,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428463190] [2022-07-13 21:10:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:33,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:33,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:33,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 21:10:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:10:33,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 21:10:33,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:33,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428463190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:33,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:33,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:33,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173360466] [2022-07-13 21:10:33,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:33,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:33,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:33,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:33,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:33,509 INFO L87 Difference]: Start difference. First operand 12772 states and 15564 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:10:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:34,097 INFO L93 Difference]: Finished difference Result 13697 states and 16818 transitions. [2022-07-13 21:10:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-07-13 21:10:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:34,118 INFO L225 Difference]: With dead ends: 13697 [2022-07-13 21:10:34,118 INFO L226 Difference]: Without dead ends: 12606 [2022-07-13 21:10:34,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:34,122 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 75 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:34,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 623 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2022-07-13 21:10:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 12568. [2022-07-13 21:10:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12568 states, 9773 states have (on average 1.1971758927657832) internal successors, (11700), 9936 states have internal predecessors, (11700), 1381 states have call successors, (1381), 1146 states have call predecessors, (1381), 1412 states have return successors, (2184), 1496 states have call predecessors, (2184), 1380 states have call successors, (2184) [2022-07-13 21:10:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 15265 transitions. [2022-07-13 21:10:34,677 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 15265 transitions. Word has length 135 [2022-07-13 21:10:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:34,678 INFO L495 AbstractCegarLoop]: Abstraction has 12568 states and 15265 transitions. [2022-07-13 21:10:34,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:10:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 15265 transitions. [2022-07-13 21:10:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 21:10:34,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:34,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:34,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:34,902 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2022-07-13 21:10:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:34,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43713423] [2022-07-13 21:10:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:10:34,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:34,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43713423] [2022-07-13 21:10:34,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43713423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:34,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710311138] [2022-07-13 21:10:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:34,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:34,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:34,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 21:10:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:35,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:10:35,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 21:10:35,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:35,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710311138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:35,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:35,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:10:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038043473] [2022-07-13 21:10:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:35,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:10:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:35,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:10:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:35,101 INFO L87 Difference]: Start difference. First operand 12568 states and 15265 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:35,751 INFO L93 Difference]: Finished difference Result 13904 states and 16977 transitions. [2022-07-13 21:10:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 21:10:35,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 21:10:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:35,777 INFO L225 Difference]: With dead ends: 13904 [2022-07-13 21:10:35,778 INFO L226 Difference]: Without dead ends: 12561 [2022-07-13 21:10:35,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:35,784 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 300 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:35,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 478 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 21:10:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12561 states. [2022-07-13 21:10:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12561 to 12002. [2022-07-13 21:10:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12002 states, 9315 states have (on average 1.191196994095545) internal successors, (11096), 9468 states have internal predecessors, (11096), 1323 states have call successors, (1323), 1103 states have call predecessors, (1323), 1362 states have return successors, (2092), 1440 states have call predecessors, (2092), 1322 states have call successors, (2092) [2022-07-13 21:10:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 14511 transitions. [2022-07-13 21:10:36,435 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 14511 transitions. Word has length 136 [2022-07-13 21:10:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:36,435 INFO L495 AbstractCegarLoop]: Abstraction has 12002 states and 14511 transitions. [2022-07-13 21:10:36,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 14511 transitions. [2022-07-13 21:10:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 21:10:36,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:36,442 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:36,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 21:10:36,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:36,658 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2022-07-13 21:10:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:36,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032850505] [2022-07-13 21:10:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:10:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:36,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032850505] [2022-07-13 21:10:36,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032850505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:36,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654521702] [2022-07-13 21:10:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:36,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:36,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:36,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:36,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 21:10:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:36,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:10:36,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 21:10:36,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:36,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654521702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:36,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:10:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109685181] [2022-07-13 21:10:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:36,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:10:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:36,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:10:36,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:36,837 INFO L87 Difference]: Start difference. First operand 12002 states and 14511 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:37,517 INFO L93 Difference]: Finished difference Result 13122 states and 15882 transitions. [2022-07-13 21:10:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:10:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 21:10:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:37,538 INFO L225 Difference]: With dead ends: 13122 [2022-07-13 21:10:37,539 INFO L226 Difference]: Without dead ends: 11748 [2022-07-13 21:10:37,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:10:37,545 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 321 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:37,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 486 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2022-07-13 21:10:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 11726. [2022-07-13 21:10:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11726 states, 9097 states have (on average 1.1854457513465977) internal successors, (10784), 9246 states have internal predecessors, (10784), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-07-13 21:10:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14112 transitions. [2022-07-13 21:10:38,128 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14112 transitions. Word has length 136 [2022-07-13 21:10:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:38,128 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14112 transitions. [2022-07-13 21:10:38,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14112 transitions. [2022-07-13 21:10:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 21:10:38,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:38,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:38,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 21:10:38,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-13 21:10:38,353 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2022-07-13 21:10:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977471269] [2022-07-13 21:10:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:10:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977471269] [2022-07-13 21:10:38,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977471269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313988941] [2022-07-13 21:10:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:38,430 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 21:10:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 21:10:38,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 21:10:38,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:38,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313988941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:38,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:38,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 21:10:38,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343662913] [2022-07-13 21:10:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:38,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:10:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:38,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:10:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:38,529 INFO L87 Difference]: Start difference. First operand 11726 states and 14112 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:39,140 INFO L93 Difference]: Finished difference Result 12853 states and 15487 transitions. [2022-07-13 21:10:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:10:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-13 21:10:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:39,163 INFO L225 Difference]: With dead ends: 12853 [2022-07-13 21:10:39,163 INFO L226 Difference]: Without dead ends: 11754 [2022-07-13 21:10:39,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:39,169 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:39,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1043 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2022-07-13 21:10:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11738. [2022-07-13 21:10:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11738 states, 9109 states have (on average 1.1828960368865957) internal successors, (10775), 9258 states have internal predecessors, (10775), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-07-13 21:10:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 14103 transitions. [2022-07-13 21:10:39,946 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 14103 transitions. Word has length 136 [2022-07-13 21:10:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:39,946 INFO L495 AbstractCegarLoop]: Abstraction has 11738 states and 14103 transitions. [2022-07-13 21:10:39,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 14103 transitions. [2022-07-13 21:10:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 21:10:39,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:39,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:39,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 21:10:40,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 21:10:40,171 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2022-07-13 21:10:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327104045] [2022-07-13 21:10:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 21:10:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327104045] [2022-07-13 21:10:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327104045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:40,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:40,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042449076] [2022-07-13 21:10:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:40,234 INFO L87 Difference]: Start difference. First operand 11738 states and 14103 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 21:10:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:41,285 INFO L93 Difference]: Finished difference Result 12713 states and 15200 transitions. [2022-07-13 21:10:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:10:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-07-13 21:10:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:41,315 INFO L225 Difference]: With dead ends: 12713 [2022-07-13 21:10:41,316 INFO L226 Difference]: Without dead ends: 12711 [2022-07-13 21:10:41,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:10:41,323 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 690 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:41,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 770 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12711 states. [2022-07-13 21:10:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12711 to 12442. [2022-07-13 21:10:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12442 states, 9689 states have (on average 1.1791722571988854) internal successors, (11425), 9844 states have internal predecessors, (11425), 1353 states have call successors, (1353), 1129 states have call predecessors, (1353), 1398 states have return successors, (2122), 1478 states have call predecessors, (2122), 1352 states have call successors, (2122) [2022-07-13 21:10:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 14900 transitions. [2022-07-13 21:10:42,047 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 14900 transitions. Word has length 136 [2022-07-13 21:10:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:42,048 INFO L495 AbstractCegarLoop]: Abstraction has 12442 states and 14900 transitions. [2022-07-13 21:10:42,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 21:10:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 14900 transitions. [2022-07-13 21:10:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 21:10:42,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:42,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:42,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 21:10:42,057 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2022-07-13 21:10:42,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:42,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282882711] [2022-07-13 21:10:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 21:10:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 21:10:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 21:10:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 21:10:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 21:10:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 21:10:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 21:10:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:42,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282882711] [2022-07-13 21:10:42,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282882711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981035428] [2022-07-13 21:10:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:42,123 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:42,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 21:10:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:42,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 21:10:42,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 21:10:42,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:42,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981035428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:42,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:42,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-13 21:10:42,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139074938] [2022-07-13 21:10:42,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:42,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:42,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:10:42,217 INFO L87 Difference]: Start difference. First operand 12442 states and 14900 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 21:10:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:42,694 INFO L93 Difference]: Finished difference Result 17590 states and 21120 transitions. [2022-07-13 21:10:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:10:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-07-13 21:10:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:42,710 INFO L225 Difference]: With dead ends: 17590 [2022-07-13 21:10:42,710 INFO L226 Difference]: Without dead ends: 7008 [2022-07-13 21:10:42,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:10:42,725 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 34 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:42,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1280 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2022-07-13 21:10:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 6566. [2022-07-13 21:10:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 5254 states have (on average 1.159307194518462) internal successors, (6091), 5307 states have internal predecessors, (6091), 655 states have call successors, (655), 523 states have call predecessors, (655), 655 states have return successors, (962), 736 states have call predecessors, (962), 654 states have call successors, (962) [2022-07-13 21:10:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7708 transitions. [2022-07-13 21:10:43,112 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 7708 transitions. Word has length 145 [2022-07-13 21:10:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:43,112 INFO L495 AbstractCegarLoop]: Abstraction has 6566 states and 7708 transitions. [2022-07-13 21:10:43,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 21:10:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 7708 transitions. [2022-07-13 21:10:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 21:10:43,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:43,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:43,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:43,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 21:10:43,335 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2022-07-13 21:10:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187325066] [2022-07-13 21:10:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 21:10:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 21:10:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 21:10:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 21:10:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 21:10:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 21:10:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 21:10:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 21:10:43,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:43,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187325066] [2022-07-13 21:10:43,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187325066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:43,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:43,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887544292] [2022-07-13 21:10:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:43,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:43,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:43,379 INFO L87 Difference]: Start difference. First operand 6566 states and 7708 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 21:10:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:43,881 INFO L93 Difference]: Finished difference Result 7114 states and 8326 transitions. [2022-07-13 21:10:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:10:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-07-13 21:10:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:43,895 INFO L225 Difference]: With dead ends: 7114 [2022-07-13 21:10:43,896 INFO L226 Difference]: Without dead ends: 6365 [2022-07-13 21:10:43,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:43,899 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 388 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:43,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 535 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-07-13 21:10:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6141. [2022-07-13 21:10:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 4925 states have (on average 1.1595939086294416) internal successors, (5711), 4975 states have internal predecessors, (5711), 609 states have call successors, (609), 483 states have call predecessors, (609), 605 states have return successors, (898), 683 states have call predecessors, (898), 608 states have call successors, (898) [2022-07-13 21:10:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 7218 transitions. [2022-07-13 21:10:44,258 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 7218 transitions. Word has length 147 [2022-07-13 21:10:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 7218 transitions. [2022-07-13 21:10:44,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 21:10:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 7218 transitions. [2022-07-13 21:10:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-13 21:10:44,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:44,264 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 21:10:44,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 21:10:44,264 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2022-07-13 21:10:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675886087] [2022-07-13 21:10:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 21:10:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:10:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 21:10:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 21:10:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 21:10:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 21:10:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 21:10:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 21:10:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 21:10:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 21:10:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 21:10:44,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:44,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675886087] [2022-07-13 21:10:44,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675886087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079651373] [2022-07-13 21:10:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:44,330 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:44,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 21:10:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:44,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:44,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 21:10:44,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:44,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079651373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:44,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:44,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510209394] [2022-07-13 21:10:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:44,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:44,533 INFO L87 Difference]: Start difference. First operand 6141 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 21:10:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:44,833 INFO L93 Difference]: Finished difference Result 7977 states and 9378 transitions. [2022-07-13 21:10:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2022-07-13 21:10:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:44,841 INFO L225 Difference]: With dead ends: 7977 [2022-07-13 21:10:44,842 INFO L226 Difference]: Without dead ends: 3937 [2022-07-13 21:10:44,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:44,848 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 171 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:44,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-07-13 21:10:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2022-07-13 21:10:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3191 states have (on average 1.144468818552178) internal successors, (3652), 3225 states have internal predecessors, (3652), 380 states have call successors, (380), 295 states have call predecessors, (380), 364 states have return successors, (516), 417 states have call predecessors, (516), 379 states have call successors, (516) [2022-07-13 21:10:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4548 transitions. [2022-07-13 21:10:45,094 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4548 transitions. Word has length 158 [2022-07-13 21:10:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:45,094 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4548 transitions. [2022-07-13 21:10:45,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 21:10:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4548 transitions. [2022-07-13 21:10:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-13 21:10:45,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:45,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:45,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:45,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:45,308 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2022-07-13 21:10:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:45,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060788381] [2022-07-13 21:10:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 21:10:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:10:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 21:10:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 21:10:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 21:10:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 21:10:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 21:10:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 21:10:45,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:45,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060788381] [2022-07-13 21:10:45,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060788381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:45,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:45,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762886482] [2022-07-13 21:10:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:45,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:45,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:45,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:45,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:45,382 INFO L87 Difference]: Start difference. First operand 3937 states and 4548 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 21:10:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:45,938 INFO L93 Difference]: Finished difference Result 5801 states and 6758 transitions. [2022-07-13 21:10:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:10:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-07-13 21:10:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:45,945 INFO L225 Difference]: With dead ends: 5801 [2022-07-13 21:10:45,945 INFO L226 Difference]: Without dead ends: 4040 [2022-07-13 21:10:45,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:45,950 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 313 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:45,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 792 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-07-13 21:10:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3496. [2022-07-13 21:10:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 2842 states have (on average 1.145320197044335) internal successors, (3255), 2875 states have internal predecessors, (3255), 336 states have call successors, (336), 259 states have call predecessors, (336), 316 states have return successors, (448), 362 states have call predecessors, (448), 335 states have call successors, (448) [2022-07-13 21:10:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4039 transitions. [2022-07-13 21:10:46,171 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4039 transitions. Word has length 159 [2022-07-13 21:10:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:46,171 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4039 transitions. [2022-07-13 21:10:46,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 21:10:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4039 transitions. [2022-07-13 21:10:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-13 21:10:46,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:46,174 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 21:10:46,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 21:10:46,174 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:46,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2022-07-13 21:10:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:46,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344422662] [2022-07-13 21:10:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 21:10:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:10:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 21:10:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 21:10:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 21:10:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 21:10:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 21:10:46,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:46,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344422662] [2022-07-13 21:10:46,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344422662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:46,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957398299] [2022-07-13 21:10:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:46,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:46,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:46,243 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:46,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 21:10:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 21:10:46,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 21:10:46,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:10:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 21:10:46,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957398299] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:10:46,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:10:46,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-13 21:10:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520712485] [2022-07-13 21:10:46,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:10:46,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 21:10:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 21:10:46,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:10:46,676 INFO L87 Difference]: Start difference. First operand 3496 states and 4039 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-07-13 21:10:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:47,579 INFO L93 Difference]: Finished difference Result 5531 states and 6517 transitions. [2022-07-13 21:10:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 21:10:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-07-13 21:10:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:47,586 INFO L225 Difference]: With dead ends: 5531 [2022-07-13 21:10:47,586 INFO L226 Difference]: Without dead ends: 3783 [2022-07-13 21:10:47,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 354 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-07-13 21:10:47,589 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1184 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:47,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1004 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:10:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-07-13 21:10:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3583. [2022-07-13 21:10:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 2887 states have (on average 1.1323172843782474) internal successors, (3269), 2925 states have internal predecessors, (3269), 358 states have call successors, (358), 283 states have call predecessors, (358), 336 states have return successors, (499), 375 states have call predecessors, (499), 357 states have call successors, (499) [2022-07-13 21:10:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4126 transitions. [2022-07-13 21:10:47,819 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4126 transitions. Word has length 162 [2022-07-13 21:10:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:47,819 INFO L495 AbstractCegarLoop]: Abstraction has 3583 states and 4126 transitions. [2022-07-13 21:10:47,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-07-13 21:10:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4126 transitions. [2022-07-13 21:10:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-13 21:10:47,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:47,822 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 21:10:47,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:48,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-13 21:10:48,032 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2022-07-13 21:10:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:48,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521012130] [2022-07-13 21:10:48,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 21:10:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 21:10:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-13 21:10:48,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:48,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521012130] [2022-07-13 21:10:48,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521012130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:48,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:48,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917531970] [2022-07-13 21:10:48,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:48,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:48,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:48,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:48,105 INFO L87 Difference]: Start difference. First operand 3583 states and 4126 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 21:10:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:48,751 INFO L93 Difference]: Finished difference Result 5452 states and 6270 transitions. [2022-07-13 21:10:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:10:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2022-07-13 21:10:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:48,755 INFO L225 Difference]: With dead ends: 5452 [2022-07-13 21:10:48,755 INFO L226 Difference]: Without dead ends: 1760 [2022-07-13 21:10:48,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:10:48,761 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 796 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:48,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 710 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-07-13 21:10:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2022-07-13 21:10:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1387 states have (on average 1.1391492429704397) internal successors, (1580), 1408 states have internal predecessors, (1580), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2022-07-13 21:10:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2022-07-13 21:10:48,880 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2022-07-13 21:10:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:48,880 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2022-07-13 21:10:48,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 21:10:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2022-07-13 21:10:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-13 21:10:48,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:48,882 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 21:10:48,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 21:10:48,882 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:48,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2022-07-13 21:10:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:48,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269811220] [2022-07-13 21:10:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 21:10:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 21:10:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 21:10:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 21:10:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 21:10:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:10:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 21:10:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 21:10:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 21:10:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 21:10:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 21:10:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 21:10:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:48,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269811220] [2022-07-13 21:10:48,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269811220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:48,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063175305] [2022-07-13 21:10:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:48,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:48,929 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:48,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 21:10:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:10:49,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-13 21:10:49,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:49,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063175305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:49,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:49,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:10:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096161117] [2022-07-13 21:10:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:10:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:49,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:10:49,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:49,037 INFO L87 Difference]: Start difference. First operand 1760 states and 2046 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 21:10:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:49,245 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2022-07-13 21:10:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:10:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2022-07-13 21:10:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:49,247 INFO L225 Difference]: With dead ends: 3405 [2022-07-13 21:10:49,247 INFO L226 Difference]: Without dead ends: 1477 [2022-07-13 21:10:49,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:10:49,249 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:49,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 275 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 21:10:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-07-13 21:10:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2022-07-13 21:10:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1143 states have (on average 1.1286089238845145) internal successors, (1290), 1155 states have internal predecessors, (1290), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2022-07-13 21:10:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2022-07-13 21:10:49,352 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2022-07-13 21:10:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:49,353 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2022-07-13 21:10:49,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 21:10:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2022-07-13 21:10:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-13 21:10:49,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:49,355 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:49,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:49,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-13 21:10:49,573 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2022-07-13 21:10:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:49,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131617897] [2022-07-13 21:10:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 21:10:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 21:10:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 21:10:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 21:10:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 21:10:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 21:10:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 21:10:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 21:10:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 21:10:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 21:10:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 21:10:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 21:10:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 21:10:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-13 21:10:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-13 21:10:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131617897] [2022-07-13 21:10:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131617897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194924529] [2022-07-13 21:10:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:49,692 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:10:49,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 21:10:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:49,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 21:10:49,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 21:10:49,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:10:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-13 21:10:50,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194924529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:10:50,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:10:50,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-07-13 21:10:50,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232160251] [2022-07-13 21:10:50,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:10:50,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 21:10:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:50,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 21:10:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:50,098 INFO L87 Difference]: Start difference. First operand 1440 states and 1649 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-07-13 21:10:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:50,522 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2022-07-13 21:10:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:10:50,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2022-07-13 21:10:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:50,523 INFO L225 Difference]: With dead ends: 1743 [2022-07-13 21:10:50,523 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 21:10:50,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 548 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-07-13 21:10:50,525 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 346 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:50,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 448 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 21:10:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 21:10:50,526 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-07-13 21:10:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 21:10:50,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2022-07-13 21:10:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:50,526 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 21:10:50,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-07-13 21:10:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 21:10:50,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 21:10:50,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-13 21:10:50,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-13 21:10:50,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 21:10:50,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:50,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 21:11:36,559 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-07-13 21:11:36,561 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= ~E_M~0 0)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse14 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse15 (= |old(~t1_st~0)| 0)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 (not (<= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 (not (< ~local~0 ~token~0)) .cse10 .cse11 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1)))) (let ((.cse17 (<= ~m_pc~0 0))) (or .cse1 (and (or (not (<= ~t1_pc~0 1)) (<= ~m_pc~0 1)) (not .cse17)) .cse13 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) (and (not (<= 1 ~t1_pc~0)) .cse17) .cse11)) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-07-13 21:11:36,561 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-07-13 21:11:36,561 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-07-13 21:11:36,561 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse36 (= ~T1_E~0 ~M_E~0)) (.cse38 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse43 (= ~m_pc~0 ~t1_pc~0)) (.cse46 (<= 1 ~c_dr_pc~0)) (.cse45 (= ~q_free~0 1)) (.cse47 (<= ~c_dr_pc~0 1)) (.cse50 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse48 (<= ~p_num_write~0 ~c_num_read~0)) (.cse33 (<= ~m_pc~0 1)) (.cse32 (<= ~m_pc~0 0)) (.cse34 (= ~E_M~0 0)) (.cse39 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse40 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse41 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse44 (= ~c_last_read~0 ~p_last_write~0)) (.cse42 (= ~M_E~0 2)) (.cse49 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (let ((.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse6 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse23 (and .cse36 .cse38 .cse37 .cse43 .cse46 .cse45 .cse47 .cse50 .cse48 (or (not .cse33) .cse32) (not .cse34) .cse39 .cse40 .cse41 .cse44 .cse42 .cse49)) (.cse30 (not (= ~p_num_write~0 0))) (.cse31 (not (= ~c_num_read~0 0))) (.cse4 (and .cse38 .cse39 .cse41 (= ~q_read_ev~0 2))) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse13 (not .cse50)) (.cse16 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not .cse49)) (.cse21 (not .cse48)) (.cse10 (not .cse47)) (.cse35 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse22 (not (<= 2 |old(~q_write_ev~0)|))) (.cse24 (not .cse46)) (.cse25 (not .cse45)) (.cse26 (not .cse44)) (.cse0 (= ~c_dr_st~0 0)) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse43)) (.cse2 (not .cse42)) (.cse28 (and .cse38 .cse39 .cse40 .cse41)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not .cse37)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse12 (= ~p_dw_st~0 0)) (.cse14 (not .cse36)) (.cse15 (not (= ~m_st~0 0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse27 .cse28 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse27 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse29 .cse1 (not .cse12) .cse2 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse30 .cse7 .cse31 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (and (not .cse32) .cse33) .cse28 .cse30 .cse7 .cse34 .cse31 .cse12 .cse13 .cse35 .cse14 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse28 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse35 .cse14 .cse15 .cse22 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse29 .cse1 .cse2 .cse28 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19)))) [2022-07-13 21:11:36,562 INFO L895 garLoopResultBuilder]: At program point L56(lines 39 58) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse27 (<= ~q_req_up~0 0)) (.cse24 (not (= |old(~q_req_up~0)| 1))) (.cse14 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse15 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~q_free~0 0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (<= |old(~q_req_up~0)| 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse23 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse13) (or .cse1 .cse2 (not .cse8) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~c_num_read~0 0)) .cse7 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 (not (<= 1 |old(~q_read_ev~0)|)) .cse24 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse8 .cse9 .cse10 .cse23 (and .cse27 .cse28) .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 (and .cse27 (= ~q_read_ev~0 2)) .cse2 .cse3 .cse24 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse28 .cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13))) [2022-07-13 21:11:36,562 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-07-13 21:11:36,562 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-07-13 21:11:36,562 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2022-07-13 21:11:36,562 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2022-07-13 21:11:36,562 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2022-07-13 21:11:36,562 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse18 (not (< ~local~0 ~token~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (= ~E_M~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse15 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse16 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse17 .cse8 .cse9 .cse18 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19) (or .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse14 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse12) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-13 21:11:36,563 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2022-07-13 21:11:36,563 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-07-13 21:11:36,563 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2022-07-13 21:11:36,563 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse44 (<= ~p_dw_pc~0 0)) (.cse45 (<= ~p_dw_pc~0 1)) (.cse21 (= ~E_M~0 0)) (.cse47 (<= ~m_pc~0 1)) (.cse46 (<= ~m_pc~0 0))) (let ((.cse30 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse31 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse37 (= ~p_num_write~0 0)) (.cse35 (= ~c_num_read~0 0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (= ~q_free~0 0)) (.cse39 (<= 2 ~m_st~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse40 (or (not .cse47) .cse46)) (.cse41 (not .cse21)) (.cse42 (= ~p_dw_st~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (or .cse44 (not .cse45))) (.cse48 (= ~M_E~0 2))) (let ((.cse6 (not (<= ~t1_pc~0 0))) (.cse17 (not .cse48)) (.cse18 (and (= ~T1_E~0 ~M_E~0) .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43 .cse48)) (.cse22 (and .cse30 .cse31)) (.cse27 (not (= |old(~m_st~0)| 0))) (.cse26 (and (not .cse46) .cse47)) (.cse23 (and (not .cse44) .cse45)) (.cse11 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~token~0 ~local~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse42)) (.cse2 (and .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not .cse38)) (.cse7 (not .cse37)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse8 (not .cse36)) (.cse9 (not .cse35)) (.cse10 (not .cse34)) (.cse24 (not (< ~local~0 ~token~0))) (.cse12 (not .cse33)) (.cse13 (and .cse28 .cse29 .cse30 .cse31)) (.cse14 (not .cse32)) (.cse15 (not (<= 2 ~E_1~0))) (.cse25 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse22 .cse12 .cse23 .cse14 .cse15 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse26 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse27 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse14 .cse15 .cse25) (or .cse1 .cse2 .cse26 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse12 .cse23 .cse14) (or .cse0 .cse1 .cse4 (and .cse28 .cse29) .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 (and (= ~m_st~0 0) .cse30 .cse31 (not (= ~t1_st~0 0))) .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25))))) [2022-07-13 21:11:36,564 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-07-13 21:11:36,564 INFO L895 garLoopResultBuilder]: At program point L612(lines 596 614) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse11 (= ~E_M~0 0)) (.cse14 (not (< ~local~0 ~token~0))) (.cse18 (not (<= ~token~0 (+ ~local~0 1)))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~token~0 ~local~0))) (.cse19 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse4 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse5 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse21 (not (<= 2 ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse14 .cse15 (not (= |old(~m_st~0)| 0)) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17)))) [2022-07-13 21:11:36,564 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-07-13 21:11:36,564 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-07-13 21:11:36,565 INFO L895 garLoopResultBuilder]: At program point L631(lines 615 633) the Hoare annotation is: (let ((.cse46 (<= ~p_dw_pc~0 0)) (.cse47 (<= ~p_dw_pc~0 1)) (.cse10 (= ~E_M~0 0)) (.cse49 (<= ~m_pc~0 1)) (.cse48 (<= ~m_pc~0 0))) (let ((.cse23 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse24 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse25 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse26 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse39 (= ~p_num_write~0 0)) (.cse37 (= ~c_num_read~0 0)) (.cse38 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse33 (= ~m_st~0 |old(~m_st~0)|)) (.cse36 (= ~q_free~0 0)) (.cse41 (<= 2 ~m_st~0)) (.cse35 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse42 (or (not .cse49) .cse48)) (.cse43 (not .cse10)) (.cse44 (= ~p_dw_st~0 0)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (or .cse46 (not .cse47))) (.cse50 (= ~M_E~0 2))) (let ((.cse2 (not .cse50)) (.cse3 (and (= ~T1_E~0 ~M_E~0) .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45 .cse50)) (.cse18 (and .cse23 .cse24 .cse25 .cse26)) (.cse30 (and (not .cse48) .cse49)) (.cse15 (and (not .cse46) .cse47)) (.cse22 (not (< ~local~0 ~token~0))) (.cse31 (not (= |old(~m_st~0)| 0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse21 (= |old(~t1_st~0)| 0)) (.cse29 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse20 (and .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not .cse40)) (.cse8 (not .cse39)) (.cse9 (not .cse38)) (.cse11 (not .cse37)) (.cse12 (not .cse36)) (.cse13 (not (<= 2 ~E_M~0))) (.cse14 (not .cse35)) (.cse27 (and .cse32 .cse33 .cse23 .cse24 .cse25 .cse26)) (.cse16 (not .cse34)) (.cse17 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 (and (= ~m_st~0 0) .cse23 .cse24 .cse25 (not (= ~t1_st~0 0)) .cse26) .cse14 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18) (or .cse0 .cse1 .cse30 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse31 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse30 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse22 .cse14 .cse31 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse5 (and .cse32 .cse33) .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19))))) [2022-07-13 21:11:36,565 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-07-13 21:11:36,565 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-07-13 21:11:36,565 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-07-13 21:11:36,565 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse16 (= ~E_M~0 0)) (.cse21 (not (<= ~t1_pc~0 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (< ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse17 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse18 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse6 .cse7 .cse9 .cse16 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse14) (or .cse0 .cse1 .cse3 .cse4 (and .cse17 .cse18) .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse20) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22)))) [2022-07-13 21:11:36,565 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2022-07-13 21:11:36,565 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-07-13 21:11:36,566 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse40 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse39 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse32 (<= activate_threads1_~tmp~1 0)) (.cse33 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse31 (not .cse16)) (.cse35 (and .cse40 .cse39 .cse32 .cse33)) (.cse26 (not (<= ~q_req_up~0 0))) (.cse38 (not .cse3)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse30 (not (= ~q_free~0 0))) (.cse4 (and .cse40 .cse39)) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (not (<= ~c_dr_pc~0 1))) (.cse23 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 ~c_dr_pc~0))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse7 (= ~E_M~0 0)) (.cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse37 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse20 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (not (= ~m_st~0 0))) (.cse36 (and .cse32 .cse33)) (.cse25 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse34 (not (= ~q_read_ev~0 2))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (<= 2 ~E_1~0))) (.cse28 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 (and (= ~q_read_ev~0 1) .cse15 .cse16) .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse26 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 (and .cse31 .cse32 .cse33) .cse25 .cse13 .cse34 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse35 .cse18 .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 .cse23 .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse31 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse10 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse26 .cse34 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse25 .cse12 .cse38 .cse26 .cse34 .cse14 .cse27 (and .cse39 .cse32 .cse16 .cse33) .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse35 .cse18 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 (= ~q_write_ev~0 0) .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 (and .cse39 .cse16) .cse25 .cse12 .cse13 .cse38 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 (and .cse15 .cse16) .cse3 .cse4 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse34 .cse14) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28)))) [2022-07-13 21:11:36,566 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-07-13 21:11:36,566 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-07-13 21:11:36,566 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-07-13 21:11:36,566 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2022-07-13 21:11:36,566 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-07-13 21:11:36,566 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2022-07-13 21:11:36,567 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-07-13 21:11:36,567 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-07-13 21:11:36,567 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-07-13 21:11:36,567 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2022-07-13 21:11:36,568 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-07-13 21:11:36,568 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2022-07-13 21:11:36,568 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2022-07-13 21:11:36,568 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-07-13 21:11:36,568 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2022-07-13 21:11:36,568 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (<= 2 |old(~q_write_ev~0)|))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse20 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse26 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse27 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse25 (and .cse29 (= ~q_read_ev~0 2))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 (not (< ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse28 .cse7 .cse10 .cse11 .cse12 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse15 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse27 .cse4 (= ~E_M~0 0) .cse5 .cse28 .cse9 .cse10 .cse20 .cse11 .cse23 .cse24) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17) (or .cse26 .cse1 (not .cse9) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse27 .cse4 .cse28 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse24 .cse16 .cse25 .cse17)))) [2022-07-13 21:11:36,569 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2022-07-13 21:11:36,569 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2022-07-13 21:11:36,569 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-07-13 21:11:36,569 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-07-13 21:11:36,569 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2022-07-13 21:11:36,569 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-07-13 21:11:36,570 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-07-13 21:11:36,570 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2022-07-13 21:11:36,570 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-07-13 21:11:36,570 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse33 (= ~T1_E~0 ~M_E~0)) (.cse37 (= ~m_pc~0 ~t1_pc~0)) (.cse39 (<= ~c_dr_pc~0 1)) (.cse31 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse38 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (<= ~m_pc~0 1)) (.cse34 (<= ~m_pc~0 0)) (.cse7 (= ~E_M~0 0)) (.cse32 (<= 0 is_do_read_c_triggered_~__retres1~1)) (.cse36 (= ~M_E~0 2)) (.cse40 (<= 1 ~c_dr_pc~0))) (let ((.cse24 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse8 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse16 (not .cse40)) (.cse22 (and .cse33 .cse37 .cse40 .cse39 .cse31 .cse38 (or (not .cse35) .cse34) (not .cse7) .cse32 .cse36)) (.cse10 (not .cse39)) (.cse11 (= ~p_dw_st~0 0)) (.cse26 (not (= ~p_num_write~0 0))) (.cse27 (not (= ~c_num_read~0 0))) (.cse12 (not .cse38)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (<= ~q_req_up~0 0))) (.cse30 (not (= ~q_read_ev~0 2))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse37)) (.cse2 (not .cse36)) (.cse3 (and (not .cse34) .cse35)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse29 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse13 (not .cse33)) (.cse14 (not (= ~m_st~0 0))) (.cse25 (and .cse31 .cse32)) (.cse17 (not (= ~p_dw_i~0 1))) (.cse21 (not (<= 2 ~E_1~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse6 .cse7 .cse27 .cse11 .cse12 .cse24 .cse13 .cse25 .cse18 .cse20) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse26 .cse6 .cse7 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~q_write_ev~0 0) .cse25 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse28 .cse1 (not .cse11) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse26 .cse6 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse23) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse29 .cse9 .cse13 .cse14 .cse25 .cse17 .cse21 .cse23)))) [2022-07-13 21:11:36,571 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-07-13 21:11:36,571 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,571 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2022-07-13 21:11:36,571 INFO L895 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-07-13 21:11:36,571 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-07-13 21:11:36,571 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-07-13 21:11:36,571 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2022-07-13 21:11:36,571 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-07-13 21:11:36,571 INFO L895 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2022-07-13 21:11:36,572 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-07-13 21:11:36,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 21:11:36,572 INFO L895 garLoopResultBuilder]: At program point L829(lines 823 831) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,572 INFO L899 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2022-07-13 21:11:36,572 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-07-13 21:11:36,572 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,572 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-07-13 21:11:36,572 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-07-13 21:11:36,573 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2022-07-13 21:11:36,573 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-07-13 21:11:36,573 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2022-07-13 21:11:36,573 INFO L895 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2022-07-13 21:11:36,573 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-13 21:11:36,574 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-07-13 21:11:36,574 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2022-07-13 21:11:36,574 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-07-13 21:11:36,574 INFO L895 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse11 (not (= ~c_dr_st~0 0))) (.cse12 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~q_req_up~0 0) .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse0 (= ~q_req_up~0 1) .cse1 (not .cse13) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-07-13 21:11:36,574 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-07-13 21:11:36,574 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-07-13 21:11:36,574 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-07-13 21:11:36,574 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-07-13 21:11:36,575 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-07-13 21:11:36,575 INFO L895 garLoopResultBuilder]: At program point L568(lines 563 594) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse4 .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-07-13 21:11:36,575 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-07-13 21:11:36,582 INFO L895 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-07-13 21:11:36,583 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)))) [2022-07-13 21:11:36,583 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-07-13 21:11:36,583 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-13 21:11:36,583 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2022-07-13 21:11:36,583 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-07-13 21:11:36,583 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-07-13 21:11:36,583 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-07-13 21:11:36,583 INFO L895 garLoopResultBuilder]: At program point L470(lines 456 472) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-13 21:11:36,584 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,587 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,587 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-07-13 21:11:36,587 INFO L895 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-13 21:11:36,587 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-07-13 21:11:36,588 INFO L895 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-07-13 21:11:36,588 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-07-13 21:11:36,588 INFO L895 garLoopResultBuilder]: At program point L867(lines 860 869) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-13 21:11:36,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 21:11:36,589 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-07-13 21:11:36,589 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11))) [2022-07-13 21:11:36,589 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-07-13 21:11:36,589 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,589 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-07-13 21:11:36,589 INFO L895 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,589 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-07-13 21:11:36,590 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-07-13 21:11:36,590 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-07-13 21:11:36,590 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse19 .cse7 .cse20 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse17 .cse19 .cse7 .cse20 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-07-13 21:11:36,590 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse13 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse20 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse18 .cse7 .cse19 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse16 .cse18 .cse7 .cse19 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse14 .cse15 .cse18 (<= ~c_dr_pc~0 0) .cse19 .cse9))) [2022-07-13 21:11:36,590 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,590 INFO L895 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,591 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,591 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-07-13 21:11:36,591 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-07-13 21:11:36,591 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2022-07-13 21:11:36,591 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2022-07-13 21:11:36,591 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse24 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (< 0 ~q_write_ev~0)) (.cse14 (= ~q_read_ev~0 2)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse19 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 (= ~q_read_ev~0 1) .cse20 .cse7 .cse8 .cse10 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) .cse3 .cse4 .cse19 .cse8 .cse10 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse22 .cse24 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse15 .cse22 .cse16 .cse24 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2022-07-13 21:11:36,591 INFO L895 garLoopResultBuilder]: At program point L886(lines 870 888) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,592 INFO L895 garLoopResultBuilder]: At program point L589(lines 560 595) the Hoare annotation is: (let ((.cse3 (<= ~m_pc~0 0))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16 (< ~local~0 ~token~0))))) [2022-07-13 21:11:36,592 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-07-13 21:11:36,592 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-07-13 21:11:36,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 21:11:36,592 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-07-13 21:11:36,592 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-07-13 21:11:36,592 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-07-13 21:11:36,592 INFO L895 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-07-13 21:11:36,592 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,593 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-07-13 21:11:36,593 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-07-13 21:11:36,593 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-07-13 21:11:36,593 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-07-13 21:11:36,593 INFO L899 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2022-07-13 21:11:36,593 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)))) [2022-07-13 21:11:36,593 INFO L895 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-07-13 21:11:36,593 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse29 (= ~p_dw_st~0 0))) (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse2 (not .cse29)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse15 .cse24 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7 .cse8 .cse18 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse8 .cse18 .cse27 .cse19 .cse20 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse24 .cse8 .cse18 .cse19 .cse29 .cse20 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse19 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse15 .cse7 .cse17 .cse18 .cse21 .cse25 .cse22 .cse11)))) [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2022-07-13 21:11:36,594 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-07-13 21:11:36,595 INFO L895 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,595 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-07-13 21:11:36,595 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse20 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse21 (= ~q_free~0 1)) (.cse22 (<= ~q_req_up~0 0)) (.cse1 (= ~q_req_up~0 1)) (.cse24 (<= 1 ~c_dr_pc~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~c_dr_pc~0 1)) (.cse26 (= ~q_read_ev~0 2)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse11 (= ~q_free~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse23 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse21 .cse10 .cse25 .cse23 .cse12 .cse22 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse24 .cse8 .cse9 .cse10 .cse25 .cse23 .cse11 .cse12 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) [2022-07-13 21:11:36,595 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-07-13 21:11:36,595 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2022-07-13 21:11:36,595 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 21:11:36,595 INFO L902 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: true [2022-07-13 21:11:36,595 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-07-13 21:11:36,605 INFO L895 garLoopResultBuilder]: At program point L181(lines 176 224) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (<= 2 ~E_M~0) (<= 1 ~c_dr_pc~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-07-13 21:11:36,605 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-07-13 21:11:36,605 INFO L895 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,605 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< ~local~0 ~token~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse9 .cse10 .cse11 .cse13))) [2022-07-13 21:11:36,605 INFO L895 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse2 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse12 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse13 (not (= ~E_M~0 0))) (.cse15 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse18 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 .cse13 (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (<= 1 ~c_dr_pc~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 1) .cse18 .cse11 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse14 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-07-13 21:11:36,606 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2022-07-13 21:11:36,606 INFO L902 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2022-07-13 21:11:36,606 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-07-13 21:11:36,606 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2022-07-13 21:11:36,606 INFO L895 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse13 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~q_req_up~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse12 .cse13 (<= 1 ~p_num_write~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse16 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 (= ~q_read_ev~0 2) .cse12 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-07-13 21:11:36,606 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-07-13 21:11:36,606 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-07-13 21:11:36,607 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse19 (= ~q_req_up~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse20 (not .cse12)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse24 (not (= ~E_M~0 0))) (.cse18 (<= 1 ~q_read_ev~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse18 (let ((.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22)))) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 (<= ~p_num_write~0 1) .cse23 .cse24 .cse18 .cse13 .cse15 (<= 1 ~p_num_write~0) .cse16 .cse17)))) [2022-07-13 21:11:36,607 INFO L895 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2022-07-13 21:11:36,607 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2022-07-13 21:11:36,608 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2022-07-13 21:11:36,608 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse22 (not (= ~p_num_write~0 0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (<= 2 ~q_write_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse10 (= ~p_dw_st~0 0)) (.cse24 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse25 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse19 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 (not .cse10) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse22 .cse5 .cse6 (= ~E_M~0 0) .cse23 .cse10 .cse24 .cse11 .cse12 .cse17 .cse18) (or .cse0 .cse1 .cse2 (= ~q_read_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse16 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse16 .cse25 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 (= ~q_write_ev~0 0) .cse16 .cse25 .cse26 .cse19 .cse20))) [2022-07-13 21:11:36,608 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2022-07-13 21:11:36,608 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-07-13 21:11:36,608 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-07-13 21:11:36,608 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-07-13 21:11:36,608 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-07-13 21:11:36,609 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2022-07-13 21:11:36,609 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2022-07-13 21:11:36,609 INFO L895 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse27 (= ~q_read_ev~0 2)) (.cse26 (= ~p_dw_st~0 0))) (let ((.cse15 (not (= ~p_num_write~0 0))) (.cse3 (not .cse26)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not .cse27)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse21 (not (<= 2 ~q_write_ev~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse25 (not .cse0)) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse12 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse21 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse20 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse25 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse20 .cse26 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14) (or .cse1 .cse2 .cse4 (not (= ~q_req_up~0 1)) .cse5 .cse6 .cse16 .cse7 .cse8 .cse26 .cse9 .cse10 .cse21 .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse25 .cse27) .cse13 (not (<= ~p_num_write~0 1)) .cse14)))) [2022-07-13 21:11:36,609 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2022-07-13 21:11:36,609 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-07-13 21:11:36,609 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2022-07-13 21:11:36,609 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-07-13 21:11:36,609 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2022-07-13 21:11:36,609 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2022-07-13 21:11:36,610 INFO L902 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2022-07-13 21:11:36,610 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse19 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (< 0 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse7 (not (= ~q_free~0 0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= ~p_dw_st~0 0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse23 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse25 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse27 (not (= |old(~q_read_ev~0)| 2))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse26 (not (<= ~q_req_up~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse29 (and .cse32 (= ~q_read_ev~0 2))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse23 .cse5 (= ~E_M~0 0) .cse6 .cse24 .cse17 .cse25 .cse18 .cse9 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse25 .cse9 .cse10 (not (= |old(~q_read_ev~0)| 1)) .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse11 .cse26 .cse12 .cse29 .cse13) (or .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse20 .cse11 .cse26 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse11 (= |old(~q_write_ev~0)| 0) .cse26 .cse12 .cse13) (or .cse1 .cse2 (not .cse17) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse23 .cse5 .cse24 .cse8 .cse25 .cse9 .cse10 .cse27 .cse11 .cse21 .cse26 .cse22 .cse12 .cse29 .cse13)))) [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-07-13 21:11:36,611 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2022-07-13 21:11:36,611 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2022-07-13 21:11:36,620 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-13 21:11:36,624 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:11:36,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:11:36 BoogieIcfgContainer [2022-07-13 21:11:36,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:11:36,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:11:36,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:11:36,791 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:11:36,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:10:07" (3/4) ... [2022-07-13 21:11:36,793 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-07-13 21:11:36,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-07-13 21:11:36,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-07-13 21:11:36,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-07-13 21:11:36,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-07-13 21:11:36,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-07-13 21:11:36,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-07-13 21:11:36,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-07-13 21:11:36,816 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-13 21:11:36,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 21:11:36,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 21:11:36,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 21:11:36,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-07-13 21:11:36,851 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) [2022-07-13 21:11:36,851 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-07-13 21:11:36,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-07-13 21:11:36,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-07-13 21:11:36,904 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:11:36,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:11:36,904 INFO L158 Benchmark]: Toolchain (without parser) took 90372.11ms. Allocated memory was 86.0MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 49.6MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 379.9MB. Max. memory is 16.1GB. [2022-07-13 21:11:36,906 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:11:36,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.88ms. Allocated memory is still 86.0MB. Free memory was 49.4MB in the beginning and 33.3MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 21:11:36,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.94ms. Allocated memory is still 86.0MB. Free memory was 33.2MB in the beginning and 63.7MB in the end (delta: -30.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-07-13 21:11:36,910 INFO L158 Benchmark]: Boogie Preprocessor took 23.38ms. Allocated memory is still 86.0MB. Free memory was 63.7MB in the beginning and 61.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:11:36,912 INFO L158 Benchmark]: RCFGBuilder took 506.29ms. Allocated memory is still 86.0MB. Free memory was 61.4MB in the beginning and 38.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 21:11:36,912 INFO L158 Benchmark]: TraceAbstraction took 89451.58ms. Allocated memory was 86.0MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 37.8MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-07-13 21:11:36,912 INFO L158 Benchmark]: Witness Printer took 113.31ms. Allocated memory is still 3.9GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:11:36,913 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.16ms. Allocated memory is still 86.0MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.88ms. Allocated memory is still 86.0MB. Free memory was 49.4MB in the beginning and 33.3MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.94ms. Allocated memory is still 86.0MB. Free memory was 33.2MB in the beginning and 63.7MB in the end (delta: -30.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.38ms. Allocated memory is still 86.0MB. Free memory was 63.7MB in the beginning and 61.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.29ms. Allocated memory is still 86.0MB. Free memory was 61.4MB in the beginning and 38.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 89451.58ms. Allocated memory was 86.0MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 37.8MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 113.31ms. Allocated memory is still 3.9GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: 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 15 procedures, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 89.2s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18303 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17852 mSDsluCounter, 27313 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17186 mSDsCounter, 4532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15454 IncrementalHoareTripleChecker+Invalid, 19986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4532 mSolverCounterUnsat, 10127 mSDtfsCounter, 15454 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3273 SyntacticMatches, 16 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14282occurred in iteration=18, InterpolantAutomatonStates: 403, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 9753 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 16053 PreInvPairs, 18024 NumberOfFragments, 28642 HoareAnnotationTreeSize, 16053 FomulaSimplifications, 19504 FormulaSimplificationTreeSizeReduction, 12.1s HoareSimplificationTime, 84 FomulaSimplificationsInter, 577625 FormulaSimplificationTreeSizeReductionInter, 33.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11646 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3229/3363 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: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (1 <= q_read_ev && (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)))) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(q_req_up == 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local)) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) RESULT: Ultimate proved your program to be correct! [2022-07-13 21:11:36,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE